Mechanical translation of i/o automaton specifications into first-order logic

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

Volumn 2529 LNCS, Issue , 2002, Pages 364-368

  Bogdanov, Andrej ^a   Garland, Stephen J ^b   Lynch, Nancy A ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INFORMATION MANAGEMENT; THEOREM PROVING; TRANSLATION (LANGUAGES);

ABSTRACT SYSTEMS; EXAMPLE BASED; FIRST ORDER LOGIC; INTERACTIVE PROOF ASSISTANTS; MECHANICAL; NON DETERMINISM; SAFETY PROPERTY; SHARED LANGUAGE; SYSTEM DESCRIPTION; THEOREM PROVERS;

FORMAL LOGIC;

EID: 33745442233     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36135-9_24     Document Type: Conference Paper

References (10)

1. Andrej Bogdanov. Formal verification of simulations between I/O automata. Master of engineering thesis, Massachusetts Institute of Technology, 2001. http://theory.lcs.mit.edu/˜adib/thesis.
2. Marco Devillers. Translating I/O automata to PVS. Preliminary report, Computing Science Institute, University of Nijmengen, 1999.
3. Stephen J. Garland and Nancy A. Lynch. Using I/O automata for developing distributed systems. In Gary T. Leavens and Murali Sitaraman, editors, Foundations of Component-Based Systems, pages 285–312. Cambridge University Press, 2000.
4. Stephen J. Garland, Nancy A. Lynch, and Mandana Vaziri. IOA: a language for specifying, programming, and validating distributed systems. MIT Laboratory for Computer Science, 1997 (revised January, 2001).
5. David Gries. The Science of Programming. Springer-Verlag, 1981.
6. Leslie A. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558–565, July 1978.
7. Chris Luhrs. Distributed spanning tree algorithms coded in IOA: Challenge problems for software analysis and synthesis methods. Technical Note, 2001.
8. Nancy A. Lynch. Distributed Algorithms. Morgan Kaufman Pubishers Inc., 1996.
9. Nancy A. Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. Technical Report MIT/LCS/TR-387, MIT Laboratory for Computer Science, 1987.
10. Nancy A. Lynch and Frits Vaandrager. Forward and backward simulations – part I: Untimed systems. Information and Computation, 121(2):214–233, September 1995.