Translating timed I/O automata specifications for theorem proving in PVS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3829 LNCS, Issue , 2005, Pages 17-31

  Lim, Hongping ^a   Kaynar, Dilsun ^a   Lynch, Nancy ^a   Mitra, Sayan ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; DECISION THEORY; INTERACTIVE COMPUTER SYSTEMS; LOGIC DESIGN; SOFTWARE PROTOTYPING; THEOREM PROVING;

AUTOMATA SPECIFICATIONS; DESIGN DECISIONS; PROTOTYPE VERIFICATION SYSTEM (PVS); TIMED INPUT/OUTPUT AUTOMATON (TIOA);

COMPUTER PROGRAMMING;

EID: 33745476710     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11603009_3     Document Type: Conference Paper

References (21)

1. Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: Timed I/O automata: A mathematical framework for modeling and analyzing real-time systems. In: RTSS 2003: The 24th IEEE International Real-Time Systems Symposium, Cancun, Mexico (2003)
2. Kaynar, D., Lynch, N., Segala, R., Vaandrager, F.: The theory of timed I/O automata. Technical Report MIT/LCS/TR-917, MIT Laboratory for Computer Science (2003) Available at http://theory.lcs.mit.edu/tds/reflist.html.
3. Kaynar, D., Lynch, N., Mitra, S., Garland, S.: TIOA Language. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA. (2005)
4. Kaynar, D., Lynch, N., Mitra, S.: Specifying and proving timing properties with tioa tools. In: Work in progress session of the 25th IEEE International Real-Time Systems Symposium (RTSS 2004), Lisbon, Portugal (2004)
5. Garland, S., Lynch, N., Tauber, J., Vaziri, M.: IOA User Guide and Reference Manual. MIT Computer Science and Artificial Intelligence Laboratory, Cambridge, MA. (2003) Available at http://theory.lcs.mit.edu/tds/ioa.html.
6. Owre, S., Rajan, S., Rushby, J., Shankar, N., Srivas, M.: PVS: Combining specification, proof checking, and model checking. In Alur, R., Henzinger, T.A., eds.: Computer-Aided Verification, CAV '96. Number 1102 in Lecture Notes in Computer Science, New Brunswick, NJ, Springer-Verlag (1996) 411-414
7. Archer, M.: TAME: PVS Strategies for special purpose theorem proving. Annals of Mathematics and Artificial Intelligence 29 (2001)
8. Owre, S., Ruahby, J., Shankar, N., Stringer-Calvert, D.: PVS: an experience report. In Hutter, D., Stephan, W., Traverso, P., Ullman, M., eds.: Applied Formal Methods - FM-Trends 98. Volume 1641 of Lecture Notes in Computer Science., Boppard, Germany, Springer-Verlag (1998) 338-345
9. Bogdanov, A., Garland, S., Lynch, N.: Mechanical translation of I/O automaton specifications into first-order logic. In: Formal Techniques for Networked and Distributed Sytems - FORTE 2002 : 22nd IFIP WG 6.1 International Conference, Texas, Houston, USA (2002) 364-368
10. Garland, S.J., Guttag, J.V.: A guide to LP, the Larch prover. Technical report, DEC Systems Research Center (1991) Available at http://nms.lcs.mit.edu/ Larch/LP.
11. Devillers, M.: Translating IOA automata to PVS. Technical Report CSI-R9903, Computing Science Institute, University of Nijmegen (1999) Available at http://www.cs.ru.nl/research/reports/info/CSI-R9903.html.
12. Ne Win, T.: Theorem-proving distributed algorithms with dynamic analysis. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA (2003)
13. Paulson, L.C.: The Isabelle reference manual. Technical Report 283, University of Cambridge (1993)
14. Merritt, Modugno, Tuttle: Time-constrained automata. In: CONCUR: 2nd International Conference on Concurrency Theory, LNCS, Springer-Verlag (1991)
15. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc. (1996)
16. Lynch, N., Segala, R., Vaandrager, F.: Hybrid I/O automata. Information and Computation 185 (2003) 105-157
17. Bogdanov, A.: Formal verification of simulations between I/O automata. Master's thesis, Massachusetts Institute of Technology, Cambridge, MA (2000) Available at http://theory.lcs.mit.edu/tds/ioa.html.
18. Mitra, S., Archer, M.: Reusable PVS proof strategies for proving abstraction properties of I/O automata. In: STRATEGIES 2004, IJCAR Workshop on strategies in automated deduction, Cork, Ireland (2004)
19. Muñoz, C., Mayero, M.: Real automation in the field. Technical Report NASA/CR-2001-211271 Interim ICASE Report No. 39, ICASE-NASA Langley, ICASE Mail Stop 132C, NASA Langley Research Center, Hampton VA 23681-2199, USA (2001)
20. Vito, B.: A PVS prover strategy package for common manipulations (2003) Available at http://shemesh.larc.nasa.gov/people/bld/manip.html.
21. Mitra, S., Archer, M.: PVS strategies for proving abstraction properties of automata. Electronic Notes in Theoretical Computer Science 125 (2005) 45-65