Automated verification of szymanski's algorithm

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

Volumn 1384, Issue , 1998, Pages 424-438

  Gribomont, E Pascal ^a   Zenner, Guy ^a  

^a UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AUTOMATED VERIFICATION; INTERACTIVE SESSION; MUTUAL EXCLUSIONS; NON-INTERACTIVE PROOF; THEOREM PROVERS; VERIFICATION METHOD;

ARTIFICIAL INTELLIGENCE;

EID: 84947914894     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0054187     Document Type: Conference Paper

References (30)

1. K.R. Apt and D.C. Kozen, Limits for Automatic Program Verification, Inform. Process. Letters 22 (1986) 307-309.
2. S. Bensalem, Y. Lakhnech and H. Saidi, Powerful techniques for the automatic generation, Led. Notes in Comput. Set. (1996) 323-335.
3. N. Bjorner, A. Browne and Z. Manna, Automatic Generation of Invariants and Intermediate Assertions, Lect. Notes in Comput. Set. 976 (1995) 589-623.
4. J.R. Burch et al., Symbolic Model Checking: 1020 States and Beyond, Proc. 5th. Symp. on Logic in Computer Science (1990) 428-439.
5. E. Clarke, Program invariants as fixed points, Proc. 18th IEEE Symp. on Foundations of Comput. Sci. (1977) 18-29.
6. E. Clarke, E. Emerson and A. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Trans. Programming Languages Syst. 8 (1986) 244-263.
7. K.M. Chandy and J. Misra, Parallel Program Design: A Foundation (Addison-Wesley, Reading, MA, 1988).
8. P. Cousot and N. Halbwachs, Automatic Discovery of Linear Restraints Among Variables of a Program, Proc. 5th ACM Symp. On Principles of Programming Languages (1978) 84-96.
9. D.M. Goldschlag, Mechanically Verifying Concurrent programs with the Boyer-Moore prover, IEEE Trans, On Software Engineering 16 (1990) 1005-1023.
10. S. Graf and H. Saidi, Verifying invariants using theorem proving, Lect. Notes in Comput. Sci. 1102 (1996) 196-207.
11. E.P. Gribomont, Concurrency without toil: a systematic method for parallel program design, Sci. Comput. Programming 21 (1993) 1-56.
12. E.P. Gribomont and D. Rossetto, CAVEAT: technique and tool for Computer Aided VErification And Transformation, Lect. Notes in Comput. Sci. 939 (1995) 70-83.
13. E.P. Gribomont, Preprocessing for invariant validation, Lect. Notes in Comput. Sci. 1101 (1996) 256-270.
14. G. Holtzmann, An improved protocol reachability analysis technique, Software, Practice, and Experience, 18 (1988) (137-161)
15. C.N. Ip and D.L. Dill, Verifying Systems with Replicated Components in Murφ, Lect. Notes in Comput. Sci. 1102 (1996) 147-158.
16. B. Jonsson and L. Kempe, Verifying safety properties of a class of infinite-state distributed algorithms, Lect. Notes in Comput. Sci. 939 (1995) 42-53.
17. R.P. Kurshan and L. Lamport, Verification of a Multiplier: 64 Bits and Beyond, Lect. Notes in Comput. Sci. 697 (1993) 166-179.
18. D. Kapur and M. Subramanian, Mechanically Verifying a Family of Multiplier Circuits, Lect. Notes in Comput. Sci. 1102 (1996) 135-146.
19. L. Lamport, An Assertional Correctness Proof of a Distributed Algorithm, Sci. Comput. Programming 2 (1983) 175-206.
20. K. Larsen, B. Steffen and C. Weise, Fisher's protocol revisited: a simple proof using modal constraints, Proc. 4th DIMACS Workshop on Verification and Control of Hybrid Systems. New Brunswick, New Jersey, 22-24 October, 1995.
21. W. McCune, OTTER 3.0 Reference manual and guide, Argonne National Laboratory, 1994.
22. Z. Manna et al., STeP: the Stanford Temporal Prover (Draft), Report No. STAN-CS-TR-94-1518, Stanford University, June 1994.
23. M. Nagayama and C. Talcott, An NQTHM Mechanization of Szymanski's algorithm, Report No. STAN-CS-91-1370, Stanford University, June 1991.
24. D.M. Russinoff, A Verification System for Concurrent Programs Based on the Boyer-Moore Prover, Formal Aspects of Computing 4 (1992) 597-611.
25. K. McMillan, Symbolic Model Checking, Kluwer Academic Publishers, 1993.
26. A. Parashkevov and J. Yantchev, Space Efficient Reachability Analysis Through Use of Pseudo-root States, Lect. Notes in Comput. Sci. 1217 (1997) 50-64.
27. D.M. Russinoff, A Mechanically Verified Incremental Garbage Collector, Formal Aspects of Computing 6 (1994) 359-390.
28. B. Szymanski, A simple solution to Lamport's concurrent programming problem with linear wait, Proc. 1988 Int. Conf. on Supercomputing Systems (1988) 621-626.
29. P. Wolper and D. Leroy, Reliable Hashing without Collision Detection, Lect. Notes in Comput. Sci. 697 (1993)
30. P. Wolper and V. Lovinfosse, Verifying Properties of large Sets of Processes with Network Invariants, Lect. Notes in Comput. Sci. 407 (1990) 68-80.