Mechanical verification of timed automata: A case study

Real-Time Technology and Applications - Proceedings

Volumn , Issue , 1996, Pages 192-203

  Archer, Myla ^a   Heitmeyer, Constance ^a  

^a NAVAL RESEARCH LABORATORY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MECHANICAL METHODS; MECHANICAL VERIFICATION; PROOF SYSTEM; PVS SPECIFICATION; SPECTRAL PROPERTIES; TIMED AUTOMATA; TIMED AUTOMATA MODELS;

INTERACTIVE COMPUTER SYSTEMS; MATHEMATICAL MODELS; REAL TIME SYSTEMS; COMPUTER AIDED SOFTWARE ENGINEERING; FINITE AUTOMATA; USER INTERFACES;

AUTOMATA THEORY; REAL TIME SYSTEMS;

LYNCH VAANDRAGER TIMED AUTOMATA MODEL; MECHANICAL VERIFICATION SYSTEMS;

EID: 0029723623     PISSN: 10801812     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RTTAS.1996.509536     Document Type: Conference Paper

References (23)

1. M. Archer and C. Heitmeyer. Mechanical verification of timed automata: A case study. Technical Report NRL/MR/5546-96-7845, NRL, Wash., DC, 1996.
2. R. Boyer and J Moore. A Computational Logic. Academic Press, 1979.
3. S. Campos, E. Clarke, and M. Minea. Analysis of realtime systems using symbolic techniques. In Formal Methods for Real-Time Computing, chapter 9. John Wiley & Sons, 1996.
4. M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, 1993.
5. C. Heitmeyer and N. Lynch. The Generalized Railroad Crossing: A case study in formal verification of real-time systems. Technical Report MIT/LCS/TM-51, Lab. for Comp. Sci., MIT, Cambridge, MA, 1994. Also Technical Report 7619, NRL, Wash., DC 1994.
6. C. Heitmeyer and N. Lynch. The Generalized Railroad Crossing: A case study in formal verification of realtime systems. In Proc., Real-Time Systems Symp., San Juan, Puerto Rico, December 1994.
7. C. Heitmeyer and D. Mandrioli, editors. Formal Methods for Real-Time Computing. Number 5 in Trends in Software. John Wiley & Sons, 1996.
8. C. L. Heitmeyer, R. D. Jeffords, and B. G. Labaw. A benchmark for comparing different approaches for specifying and verifying real-time systems. In Proc., 10th Intern. Workshop on Real-Time Operating Systems and Software, May, 1993.
9. T. Henzinger and P. Ho. Hytech: The Cornel1 Hybrid Technology Tool. Technical report, Cornel1 University, 1995.
10. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes: the Automata-Theoretic Approach. Princeton University Press, 1994.
11. L. Laniport. Types are not harmless. Digital Systems Research Center, July 1995.
12. V. Luchangco, E. Soylemez, S. Garland, and N. Lynch. Verifying timing properties of concurrent algorithms. In D. Hogrefe and S. Lene, editors, Formal Description Techniques VII: Proc. of the 7th IFIP WG6. 1 Intern. Conference on Formal Description Techniques (FORTE'94, Berne, Switzerl'and, October 1994), pages 259-273. Chapman and Ball, 1995.
13. N. Lynch. Simulation techniques for proving properties of real-time systems. In REX Workshop '99, volume 803 of Lecture Notes in Computer Science, pages 375-424, Mook, the Netherlands, 1994. Springer-Verlag.
14. N. Lynch and H. Attiya. 'Using mappings to prove timing properties. Distrib. Comput., 6:121-139, 1992.
15. N. Lynch and M. Tuttle An introduction to Input/ Qiitput automata. CWJ-Quarterly, 2(3):219-246, September 1989. Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands.
16. N. Lynch and F. Vaandragei. Forward and backward simulations-Part 11: Timing-based systems. To appear in Information and Computation.
17. N. Lynch and F. Vaandragei. Forward and backward simulakions for timing-based systems. In Proc. of REX Workdiop "Real-Time: Theory in Practice", volume 600 of Lecture Notes in Computer Science, pages 397-446, Mook, The Netherlands, June 1991. Springer-Verlag.
18. K. L. McMillan. Symbolic Model Checking. Kluwer Academic Publishers, 1993.
19. M. Merritt, F. Modugno, and M. R. Tuttle. Time constrained automata. In J. C. M. Baeten and J. F. Goote, editors, CONCUR'91: 2nd Intern. Conference on Concurrency Theory, volume 527 of Lecture Notes in Computer Science, pages 408-423, Amsterdam, The Nether1 ands, August 1991. S pringer-Verlag.
20. Sam Olwre, John Rushby, Natarajan Shankar, and Friedrich von Henke. Formd verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 2 1 (2) : 107-125 ) February 1995.
21. N. Shankar, S. Owre, and J. Rushby. The PVS proof checker: A reference manual. Technical report, Computer Science Lab, SRI Intl., Menlo Park, CA, 1993.
22. J. Skaklkebaek and N. Shankai. Towards a duration cdculus proof assistant in PVS. In Third Intern. School and Symp. on Formal Techniques in Real Time and Fault Tolerant Systems, Lecture Notes in Computer Science 863. Springer-Verlag, 1994.
23. M. K. Srivas and S. P. Miller. Formal verification of a commercial microprocessor. Technical Report SRICSL-95-04, Computer Science Lab, SRI Intl., Menlo Park, CA, 1995.