Translation Templates to Support Strategy Development in PVS

Electronic Notes in Theoretical Computer Science

Volumn 174, Issue 11 SPEC. ISS., 2007, Pages 59-79

  Lim, Hongping ^a   Archer, Myla ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b NAVAL RESEARCH LABORATORY   (United States)

Author keywords

Hybrid Automata; I O Automata; Mechanical Theorem Proving; Specification Translation; Strategies; Templates; Timed Automata

Indexed keywords

CASE BASED REASONING; COMPUTER PROGRAMMING LANGUAGES; SYSTEMS ENGINEERING; THEOREM PROVING;

HYBRID AUTOMATA; SPECIFICATION FORMULATION; SPECIFICATION TRANSLATION; SYSTEM DEVELOPMENT FRAMEWORKS; TIMED AUTOMATA;

SPECIFICATION LANGUAGES;

EID: 34250803866     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.01.057     Document Type: Article

References (28)

1. Archer M., Heitmeyer C., and Riccobene E. Proving invariants of I/O automata with TAME. Automated Software Engineering 9 3 (2002) 201-232
2. Archer M. TAME: Using PVS strategies for special-purpose theorem proving. Annals of Mathematics and Artificial Intelligence 29 1-4 (2000) 139-181 Published Feb. 2001
3. Myla Archer. Basing a modeling environment on a general purpose theorem prover. Technical Report NRL/MR/5546-06-8952, NRL, Wash., DC, Dec. 2006
4. Myla Archer, HongPing Lim, Nancy Lynch, Sayan Mitra, and Shinya Umeno. Specifying and proving properties of Timed I/O Automata in the TIOA Toolkit. In Formal Methods and Models for Codesign (MEMOCODE 2006), 2006
5. James Arvo. Computer aided serendipity: The role of autonomous assistants in problem solving. In Proc. of Graphics Interface '99, pages 183-192, 1999
6. Andrej Bogdanov, Stephen Garland, and Nancy Lynch. Mechanical translation of I/O automaton specifications into first-order logic. In Formal Techniques for Networked and Distributed Systems - FORTE 2002 : 22nd IFIP WG 6.1 Intern. Conf., pages 364-368, Houston, TX, USA, Nov. 2002
7. Marco Devillers. Translating IOA automata to PVS. Technical Report CSI-R9903, Computing Science Institute, University of Nijmegen, February 1999
8. S.J. Garland and N.A. Lynch. The IOA Language and Toolset: Support for Designing, Analyzing, and Building Distributed Systems. Technical Report MIT/LCS/TR-762, MIT Laboratory for Computer Science, August 1998
9. Garland S. TIOA User Guide and Reference Manual. Technical report, MIT CSAIL, Cambridge, MA, URL (2006). http://tioa.csail.mit.edu
10. Stephen Garland, Nancy Lynch, Joshua Tauber, and Mandana Viziri. IOA User Guide and Reference Manual. Technical Report MIT-LCS-TR-961, MIT CSAIL, Cambridge, MA, 2004
11. Guttag J.V., and Horning J.J. Larch: Languages and Tools for Formal Specification (1993), Springer-Verlag
12. C. Heitmeyer and N. Lynch. The Generalized Railroad Crossing: A case study in formal verification of real-time systems. In Proc., Real-Time Systems Symp., San Juan, Puerto Rico, December 1994
13. Kaynar D., Lynch N.A., Segala R., and Vaandrager F. The Theory of Timed I/O automata. Synthesis Lectures on Computer Science (2005), Morgan Claypool Publishers
14. Dilsun Kaynar, Nancy Lynch, and Sayan Mitra. Specifying and proving timing properties with TIOA tools. In Work-In-Progress Proc. 2004 IEEE Real-Time Systems Symp. (RTSS'04), Lisbon, Portugal, December 2004
15. Manfred Kerber. How to prove higher order theorems in first order logic. Seki Report SR-90-19, Fachbereich Informatik, Universität Kaiserslautern, Germany, 1990
16. Manfred Kerber and Axel Präcklein. Tactics for the improvement of problem formulation in resolution-based theorem proving. Seki Report SR-92-09, Fachbereich Informatik, Universität des Saarlandes, Saarbrücken, Germany, 1992
17. Larsen K.G., Pettersson P., and Yi W. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer 1 1-2 (1997) 134-152
18. Lim H. Translating timed I/O automata specifications for theorem proving in PVS. Master's thesis, Mass. Inst. of Tech., Cambridge, MA. URL (2006). http://tioa.csail.mit.edu/
19. Lynch N., and Tuttle M. An introduction to Input/Output automata. CWI-Quarterly 2 3 (Sept. 1989) 219-246 Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands
20. Mavromattis P.P. TIOA Simulator Manual. URL (February 15, 2006). http://tioa.csail.mit.edu/public/Tools/simulator/
21. Mitra S., and Archer M. PVS strategies for proving abstraction properties of automata. Electronic Notes in Theor. Comp. Sci. 125 2 (2005) 45-65
22. Nipkow T., and Slind K. I/O automata in Isabelle/HOL. In: Dybjer P., Nordström B., and Smith J. (Eds). Types for Proofs and Programs. LNCS volume 996 (1995), Springer 101-119
23. Olaf Müller. A Verification Environment for I/O Automata Based on Formalized Meta-Theory. PhD thesis, Technische Universität München, Sept. 1998
24. Lawrence Paulson. The Isabelle reference manual. Technical Report 283, Univ. of Cambridge, 1993
25. Deepak Ramachandran and Eyal Amir. Compact propositional encodings of first-order theories. In Proc. 20th Natl. Conf. on Artif. Intel. and 17th Innovative Appl. of Artif. Intel. Conf., July 9-13, 2005, Pittsburgh, PA, pages 340-345
26. Romijn J. Tackling the RPC-Memory Specification Problem with I/O automata. In: Broy M., Merz S., and Spies K. (Eds). Formal Systems Specification - The RPC-Memory Specification Case. Lect. Notes in Comp. Sci. volume 1169 (1996), Springer-Verlag 437-476
27. N. Shankar, S. Owre, J.M. Rushby, and D.W.J. Stringer-Calvert. PVS Prover Guide, Version 2.4. Technical report, Comp. Sci. Lab., SRI Intl., Menlo Park, CA, Nov. 2001
28. Toh Ne Win. Theorem-proving distributed algorithms with dynamic analysis. Master's thesis, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, May 2003