Using simulated execution in verifying distributed algorithms

International Journal on Software Tools for Technology Transfer

Volumn 6, Issue 1, 2004, Pages 67-76

  Win, Toh Ne ^a   Ernst, Michael D ^a   Garland, Stephen J ^a   Kirli, Dilsun ^a   Lynch, Nancy A ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Dynamic analysis; Invariant detection; Static analysis; Theorem proving

Indexed keywords

DISTRIBUTED CONSENSUS; DISTRIBUTED SYSTEMS; INVARIANT DETECTION; MACHINE-CHECKED PROOFS; PAXOS ALGORITHMS; SAFETY PROPERTY; THEOREM PROVERS;

DYNAMIC ANALYSIS; OPEN SYSTEMS; STATIC ANALYSIS; THEOREM PROVING;

ALGORITHMS;

EID: 84896694068     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s10009-003-0126-5     Document Type: Article

References (23)

1. Alur R, Henzinger TA, Mang FYC, Qadeer S, Rajamani SK, Tasiran S (1998) Mocha: Exploiting modularity in model checking. In: Proceedings of the 10th international conference on computer-aided verification, Vancouver, BC, Canada, 28 June-2 July 1998. Lecture notes in computer science, vol 1427. Springer, Berlin Heidelberg New York, pp 521-525
2. Bogdanov A (2000) Formal verification of simulations between I/O automata. Master of engineering thesis, Massachusetts Institute of Technology, Cambridge, MA
3. De Prisco R, Lampson B, Lynch N (2000) Fundamental study: revisiting the Paxos algorithm. Theor Comput Sci 243:35-91
4. Ernst MD, Cockrell J, Griswold WG, Notkin D (1999) Dynamically discovering likely program invariants to support program evolution. IEEE Trans Softw Eng 27(2):1-25. A previous version appeared in: Proceedings of the 21st international conference on software engineering (ICSE'99), Los Angeles, 19-21 May 1999, pp 213-224
5. Ernst MD, Czeisler A, Griswold WG, Notkin D (2000) Quickly detecting relevant program invariants. In: Proceedings of the 22nd international conference on software engineering (ICSE 2000), Limerick, Ireland, 7-9 June 2000, pp 449-458
6. Garland S, Guttag J (1991) A guide to LP, the Larch Prover. Technical report, DEC Systems Research Center, Palo Alto, CA, December 31. Updated version available at: http://nms.lcs.mit.edu/Larch/LP
7. Garland SJ, Lynch NA (1998) The IOA language and toolset: support for designing, analyzing, and building distributed systems. Technical Report MIT/LCS/TR-762, Laboratory for Computer Science, Massachusetts Institute of Technol ogy, Cambridge, MA, August 1998. http://theory.lcs.mit. edu/tds/papers/Lynch/IOA-TR-762.ps
8. Gordon MJC (1989) HOL: a proof generating system for higher order logic. In: Birtwistle G, Subrahmanyam PA (eds) Current trends in hardware verification and automated theorem proving. Springer, Berlin Heidelberg New York, pp 73-128
9. Gurevich Y, Schulte W, Veanes M (2001) Toward industrial strength abstract state machines. Technical Report MSR-TR-2001-98, Microsoft Research, 2001. Software available at: http://www.research.microsoft.com/foundations/asml/
10. Guttag JV, Horning JJ, Garland SJ, Jones KD, Modet A, Wing JM (1993) Larch: languages and tools for formal specification. In: Texts and monographs in computer science. Springer, Berlin Heidelberg New York
11. Kirli D, Chefter A, Dean L, Garland SJ, Lynch NA, Ne Win T, Ramirez-Robredo A (2002) The IOA simulator. Technical Report MIT-LCS-TR-843, MIT Laboratory for Computer Science, Cambridge, MA, July 2002
12. Kirli D, Chefter A, Dean L, Garland SJ, Lynch NA, Ne Win T, Ramirez-Robredo A (2002) Simulating nondeterministic systems at multiple levels of abstraction. In: Proceedings of Tools Day 2002, Brno, Czech Republic, August 2002, pp 44-59. Also available as Masaryk University Technical Report FI MU-RS-2002-05
13. Lamport L (1998) The part-time parliament. ACM Trans Comput Sys 16(2):133-169
14. Lamport L, Yu Y (2001) TLC - The TLA+ model checker. Compaq Systems Research Center, Palo Alto, CA, 2001. http://research.microsoft.com/users/lamport/tla/tlc.html
15. Lynch N (1996) Distributed algorithms. Morgan Kaufmann, San Mateo, CA
16. Lynch NA, Tuttle MR (1989) An introduction to Input/Output automata. CWI-Q 2(3):219-246
17. Lynch N, Vaandrager F (1995) Forward and backward simulations: Part I. Untimed systems. Inf Comput 121(2):214-233
18. McMillan KL (1998) The SMV language. Cadence Berkeley Labs, 2001 Addison Street, Berkeley, CA. http://www.cis.ksu.edu/santos/smv-doc/
19. Nimmer JW, Ernst MD (2002) Automatic generation of program specifications. In: Proceedings of the 2002 international symposium on software testing and analysis (ISSTA), Rome, Italy, 22-24 July 2002, pp 232-242
20. Nimmer JW, Ernst MD (2002) Invariant inference for static checking: An empirical evaluation. In: Proceedings of the ACM SIGSOFT 10th international symposium on the foundations of software engineering (FSE 2002), Charleston, SC, 20-22 November 2002, pp 11-20
21. Paulson LC (1993) The Isabelle reference manual. Technical Report 283, Cambridge University, Computer Laboratory, Cambridge, UK
22. Pnueli A, Ruah S, Zuck L (2001) Automatic deductive verification with invisible invariants. In: Proceedings of the conference on tools and algorithms for the analysis and construction of systems (TACAS), Genoa, Italy, 2-6 April 2001. Lecture notes in computer science, vol 2031. Springer, Berlin Heidelberg New York, pp 82-97
23. Rintanen J (2000) An iterative algorithm for synthesizing invariants. In: Proceedings of the 17th national conference on artificial intelligence and the 12th conference on innovative applications of artificial intelligence, Austin, TX, 30 July-3 August 2000, pp 806-811