메뉴 건너뛰기




Volumn , Issue , 2011, Pages 72-80

Time-bounded analysis of real-time systems

Author keywords

[No Author keywords available]

Indexed keywords

C PROGRAMS; COMPUTATIONAL MODEL; PARTIAL-ORDER REDUCTION; PERIODIC TASKS; RATE-MONOTONIC SCHEDULING; REAL-TIME EMBEDDED SOFTWARE; ROBOT CONTROLLER; SAFETY PROPERTY; SAFETY-CRITICAL; SEQUENTIAL PROGRAMS;

EID: 84857766400     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (23)

References (24)
  • 1
    • 84974687699 scopus 로고
    • Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
    • January
    • C. L. Liu and J. W. Layland, "Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment," Journal of the ACM (JACM), vol. 20, no. 1, pp. 46-61, January 1973.
    • (1973) Journal of the ACM (JACM) , vol.20 , Issue.1 , pp. 46-61
    • Liu, C.L.1    Layland, J.W.2
  • 3
    • 0003477216 scopus 로고
    • Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, Technical report CMU/SEI-90-TR-8-ESD-TR-90-209, December
    • D. C. Locke, D. R. Vogel, L. Lucas, and J. B. Goodenough, "Generic Avionics Software Specification," Software Engineering Institute, Carnegie Mellon University, Pittsburgh, PA, Technical report CMU/SEI-90-TR-8-ESD-TR-90- 209, December 1990.
    • (1990) Generic Avionics Software Specification
    • Locke, D.C.1    Vogel, D.R.2    Lucas, L.3    Goodenough, J.B.4
  • 6
    • 84887462531 scopus 로고    scopus 로고
    • Verification of Real-Time Designs: Combining Scheduling Theory with Automatic Formal Verification
    • Proceedings of the 7th ACM SIGSOFT Symposium on Foundations of Software Engineering (FSE '99), ser. Toulouse, France, September, New York, NY: Springer-Verlag, September 1999
    • V. A. Braberman and M. Felder, "Verification of Real-Time Designs: Combining Scheduling Theory with Automatic Formal Verification,"in Proceedings of the 7th ACM SIGSOFT Symposium on Foundations of Software Engineering (FSE '99), ser. Lecture Notes in Computer Science, vol. 1687. Toulouse, France, September, 1999. New York, NY: Springer-Verlag, September 1999, pp. 494-510.
    • (1999) Lecture Notes in Computer Science , vol.1687 , pp. 494-510
    • Braberman, V.A.1    Felder, M.2
  • 7
    • 0028413052 scopus 로고
    • A Theory of Timed Automata
    • April
    • R. Alur and D. L. Dill, "A Theory of Timed Automata," Theoretical Computer Science (TCS), vol. 126, no. 2, pp. 183-235, April 1994.
    • (1994) Theoretical Computer Science (TCS) , vol.126 , Issue.2 , pp. 183-235
    • Alur, R.1    Dill, D.L.2
  • 9
    • 48949086477 scopus 로고    scopus 로고
    • Reducing Concurrent Analysis under a Context Bound to Sequential Analysis
    • Proceedings of the 20th International Conference on Computer Aided Verification (CAV '08), ser. A. Gupta and S. Malik, Eds., Princeton, NJ, USA, July 7-14, New York, NY: Springer-Verlag, July 2008
    • A. Lal and T. W. Reps, "Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis," in Proceedings of the 20th International Conference on Computer Aided Verification (CAV '08), ser. Lecture Notes in Computer Science, A. Gupta and S. Malik, Eds., vol. 5123. Princeton, NJ, USA, July 7-14, 2008. New York, NY: Springer-Verlag, July 2008, pp. 37-51.
    • (2008) Lecture Notes in Computer Science , vol.5123 , pp. 37-51
    • Lal, A.1    Reps, T.W.2
  • 10
    • 70350241658 scopus 로고    scopus 로고
    • Reducing Context-Bounded Concurrent Reachability to Sequential Reachability
    • Proceedings of the 21st International Conference on Computer Aided Verification (CAV '09), ser. A. Bouajjani and O. Maler, Eds., Grenoble, France, June 26 - July 2, New York, NY: Springer-Verlag, July 2009
    • S. L. Torre, P. Madhusudan, and G. Parlato, "Reducing Context-Bounded Concurrent Reachability to Sequential Reachability," in Proceedings of the 21st International Conference on Computer Aided Verification (CAV '09), ser. Lecture Notes in Computer Science, A. Bouajjani and O. Maler, Eds., vol. 5643. Grenoble, France, June 26 - July 2, 2009. New York, NY: Springer-Verlag, July 2009, pp. 477-492.
    • (2009) Lecture Notes in Computer Science , vol.5643 , pp. 477-492
    • Torre, S.L.1    Madhusudan, P.2    Parlato, G.3
  • 12
    • 79251582891 scopus 로고    scopus 로고
    • Delay-Bounded Scheduling
    • T. Ball and M. Sagiv, Eds. Austin, TX, USA, January 26-28, New York, NY: Association for Computing Machinery, January 2011
    • M. Emmi, S. Qadeer, and Z. Rakamaric, "Delay-Bounded Scheduling,"in Popl11, T. Ball and M. Sagiv, Eds. Austin, TX, USA, January 26-28, 2011. New York, NY: Association for Computing Machinery, January 2011, pp. 411-422.
    • (2011) Popl11 , pp. 411-422
    • Emmi, M.1    Qadeer, S.2    Rakamaric, Z.3
  • 14
    • 0000703331 scopus 로고
    • Applying New Scheduling Theory to Static Priority Preemptive Scheduling
    • May
    • N. Audsley, A. Burns, K. Tindell, and A. Wellings, "Applying New Scheduling Theory to Static Priority Preemptive Scheduling," Software Engineering Journal (SEJ), vol. 8, no. 5, pp. 284-292, May 1993.
    • (1993) Software Engineering Journal (SEJ) , vol.8 , Issue.5 , pp. 284-292
    • Audsley, N.1    Burns, A.2    Tindell, K.3    Wellings, A.4
  • 17
    • 0003257889 scopus 로고    scopus 로고
    • Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem
    • ser. Springer-Verlag
    • P. Godefroid, Partial-Order Methods for the Verification of Concurrent Systems - An Approach to the State-Explosion Problem, ser. Lecture Notes in Computer Science. Springer-Verlag, 1996, vol. 1032.
    • (1996) Lecture Notes in Computer Science , vol.1032
    • Godefroid, P.1
  • 18
    • 85010991128 scopus 로고
    • All from One, One for All: On Model Checking Using Representatives
    • Proceedings of the 5th International Conference on Computer Aided Verification (CAV '93), ser. C. Courcoubetis, Ed., Elounda, Greece, June 28 - July 1, New York, NY: Springer-Verlag, June 1993
    • D. Peled, "All from One, One for All: on Model Checking Using Representatives," in Proceedings of the 5th International Conference on Computer Aided Verification (CAV '93), ser. Lecture Notes in Computer Science, C. Courcoubetis, Ed., vol. 697. Elounda, Greece, June 28 - July 1, 1993. New York, NY: Springer-Verlag, June 1993, pp. 409-423.
    • (1993) Lecture Notes in Computer Science , vol.697 , pp. 409-423
    • Peled, D.1
  • 19
    • 26944457680 scopus 로고    scopus 로고
    • Improving Spin's Partial-Order Reduction for Breadth-First Search
    • Proceedings of the 12th International SPIN Workshop on Model Checking of Software (SPIN '05), ser. P. Godefroid, Ed., San Francisco, CA, August 22-24, New York, NY: Springer-Verlag, August 2005
    • D. Bosnacki and G. J. Holzmann, "Improving Spin's Partial-Order Reduction for Breadth-First Search," in Proceedings of the 12th International SPIN Workshop on Model Checking of Software (SPIN '05), ser. Lecture Notes in Computer Science, P. Godefroid, Ed., vol. 3639. San Francisco, CA, August 22-24, 2005. New York, NY: Springer-Verlag, August 2005, pp. 91-105.
    • (2005) Lecture Notes in Computer Science , vol.3639 , pp. 91-105
    • Bosnacki, D.1    Holzmann, G.J.2
  • 20
    • 70350228798 scopus 로고    scopus 로고
    • Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
    • Proceedings of the 21st International Conference on Computer Aided Verification (CAV '09), ser. A. Bouajjani and O. Maler, Eds., Grenoble, France, June 26 - July 2, New York, NY: Springer-Verlag, July 2009
    • V. Kahlon, C. Wang, and A. Gupta, "Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique," in Proceedings of the 21st International Conference on Computer Aided Verification (CAV '09), ser. Lecture Notes in Computer Science, A. Bouajjani and O. Maler, Eds., vol. 5643. Grenoble, France, June 26 - July 2, 2009. New York, NY: Springer-Verlag, July 2009, pp. 398-413.
    • (2009) Lecture Notes in Computer Science , vol.5643 , pp. 398-413
    • Kahlon, V.1    Wang, C.2    Gupta, A.3
  • 21
    • 84959039613 scopus 로고    scopus 로고
    • CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs
    • Proceedings of the 11th International Conference on Compiler Construction (CC '02), ser. R. N. Horspool, Ed., Grenoble, France, April 8-12, New York, NY: Springer-Verlag, April 2002
    • G. C. Necula, S. McPeak, S. P. Rahul, and W. Weimer, "CIL: Intermediate Language and Tools for Analysis and Transformation of C Programs," in Proceedings of the 11th International Conference on Compiler Construction (CC '02), ser. Lecture Notes in Computer Science, R. N. Horspool, Ed., vol. 2304. Grenoble, France, April 8-12, 2002. New York, NY: Springer-Verlag, April 2002, pp. 213-228.
    • (2002) Lecture Notes in Computer Science , vol.2304 , pp. 213-228
    • Necula, G.C.1    McPeak, S.2    Rahul, S.P.3    Weimer, W.4
  • 22
    • 35048861896 scopus 로고    scopus 로고
    • A Tool for Checking ANSI-C Programs
    • Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '04), ser. K. Jensen and A. Podelski, Eds., Barcelona, Spain, March 29-April 2, New York, NY: Springer-Verlag, March-April 2004
    • E. Clarke, D. Kroening, and F. Lerda, "A Tool for Checking ANSI-C Programs," in Proceedings of the 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '04), ser. Lecture Notes in Computer Science, K. Jensen and A. Podelski, Eds., vol. 2988. Barcelona, Spain, March 29-April 2, 2004. New York, NY: Springer-Verlag, March-April 2004, pp. 168-176.
    • (2004) Lecture Notes in Computer Science , vol.2988 , pp. 168-176
    • Clarke, E.1    Kroening, D.2    Lerda, F.3
  • 24
    • 33244481991 scopus 로고    scopus 로고
    • Efficient timed model checking for discrete-time systems
    • DOI 10.1016/j.tcs.2005.11.020, PII S0304397505008698
    • F. Laroussinie, N. Markey, and P. Schnoebelen, "Efficient Timed Model Checking for Discrete-Time Systems," Theoretical Computer Science (TCS), vol. 353, no. 1-3, pp. 249-271, March 2006. (Pubitemid 43277733)
    • (2006) Theoretical Computer Science , vol.353 , Issue.1-3 , pp. 249-271
    • Laroussinie, F.1    Markey, N.2    Schnoebelen, P..3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.