Formal verification of concurrent program in LP and in COQ: A comparative analysis

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

Volumn 1275, Issue , 1997, Pages 69-85

  Chetali, Boutheina ^a   Heyd, Barbara ^a  

^a INRIA   (France)

Author keywords

Computer checked proof; Coq; Formal verification; Larch prover; Theorem prover methodology; Unity

Indexed keywords

CALCULATIONS; FORMAL LOGIC; FORMAL VERIFICATION;

CALCULUS OF INDUCTIVE CONSTRUCTIONS; COMPARATIVE ANALYSIS; CONCURRENT PROGRAM; LARCH PROVER; PRACTICAL EXPERIENCE; PROGRAM PROPERTIES; THEOREM PROVERS; UNITY;

THEOREM PROVING;

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

References (29)

1. F. Andersen. A theorem Prover for UNITY in Higher Order Logic. PhD thesis, Technical University of Denmark, 1992.
2. F. Andersen, K.D. Petersen, and J.S. Pettersson. Program verification using HOL-Unity. In J. J. Joyce and C.H. Seger, editors, Proceedings sixth International Workshop on Higher Order Logic theorem proving and its applications, volume 780 of Lecture Notes in Computer Science, pages 1-15, Vancouver, Canada, August 1993. Springer-Verlag.
3. D Bolignano. Towards a Mechanization of Cryptographic Protocol Verification. In Conference On Computer-Aided Verification, Haifa, Israël, Jun 1997. Springer-Verlag.
4. N. Brown and D. Mery. A proof environment for concurrent programs. In In Proceedings FME’93 Symposium, volume 670 of Lecture Notes in Computer Science. Springer-Verlag, 1993.
5. K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison-Wesley, 1988. ISBN 0-201-05866-9.
6. B. Chetali. Vérification Formelle des Systèmes Parallèles décrits en UNITY à l’aide d’un outil de Démonstration Automatique. PhD thesis, Université Henri Poincaré, Nancy I, May 1996.
7. B. Chetali and P. Lescanne. An exercise in LP: The proof of the non restoring division circuit. In U. Martin and J.M. Wing, editors, Proceedings First International Workshop on Larch, volume 780 of Workshops in Computing, pages 55-68, Dedham, Boston, August 1992. Springer-Verlag.
8. B. Chetali and P. Lescanne. Formal verification of a protocol for communications over faulty channels. In Proc. of the 8th International Conference on Formal Description Techniques for Distributed Systems and Communications Protocols (FORTE’95), Montréal, Quebec, Canada, October 1995. IFIP.
9. Projet Coq. The coq proof assistant (version 6.1), Reference Manual, 1996.
10. S Coupet-Grimal and L Jakubiec. Coq and Hardward Verification: A Case Study. In J von Wright, J Grundy, and J Harrison, editors, Theorem Proving In Higher Order Logics, volume 1125 of Lecture Notes in Computer Science, pages 125-139, Turku, Finland, August 1996. Springer-Verlag.
11. P Crégut. Omega: A solver of quantifier-free problems in presburger arithmetic. Supplied in the contrib directory of Coq V6.1, 1996.
12. E. W. Dijkstra and C. S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, 1989.
13. D. Doligez and G. Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In POPL '94. ACM, 1994.
14. S. V. Garland and J. V. Guttag. A guide to LP, the Larch prover. Technical Report 82, Digital Systems Research Center, 130 Lytton Ave., Palo Alto, CA 94301, USA., 1991.
15. E. Giménez. A Calculus of Infinite Constructions and its application to the verification of communicating systems. PhD thesis, Ecole Normale Supérieure de Lyon, 1996.
16. D. M. Goldschlag. Mechanically verifying concurrent programs with the Boyer-Moore Prover. IEEE Transactions on Software Engineering, 16(9):1005-1022, September 1990.
17. J. V. Guttag, J.J. Homing, S.J. Garland, K.D. Jones, A. Modet, and J. M. Wing. Larch: Languages and Tools for Formal Specification. Springer-Verlag, 1993.
18. B Heyd and P. Crégut. A modular coding of Unity in Coq. In J von Wright, J Grundy, and J Harrison, editors, Theorem Proving in Higher Order Logic, volume 1125 of Lecture Notes in Computer Science, pages 251-266, Turku, Finland, August 1996. Springer-Verlag.
19. L. Lamport. Proving the correctness of multiprocess programs. IEEE Transactions on Software Engineering, 3(2): 125-143, 1977.
20. L. Lamport and S. Owicki. The temporal logic of actions. ACM Transactions on Programming Languages and Systems, 16(3):872-923, may 1994.
21. Victor Luchangco, Ekrem Sôylemez, Stephen Garland, and Nancy Lynch. Verifying timing properties of concurrent algorithms. In FORTE’94: Seventh International Conference on Formal Description Techniques, Beme, Switzerland, October 4-7 1994. Chapman and Hall.
22. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, Specification. Springer-Verlag, 1991.
23. N. Mellergaard and J. Staunstrup. Generating proof obligations for circuits. In Ursula Martin and Jeannette M. Wing, editors, First International Workshop on Larch, pages 185-199. Springer-Verlag, July 1992.
24. J. Misra. A logic for concurrent programming, unpublished manuscripts, 1994.
25. S. Owre, J. Rushby, N. Shankar, and F. von Henke. Formal verification for faulttolerant architectures: Prolegomena to the design of PVS. IEEE Transactions on Software Engineering, 21(2), February 1995.
26. C Paulin-Mohring. Circuits as Streams in Coq: Verification of a Sequential Multiplier. Basic Research Actions "Types", 1995.
27. I.S.W.B. Prasetya. Error in the UNITY Substitution Rule for Subscripted Operators(Short Communication). 6(4):466-470, 1994.
28. B. A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3:189-205, 1991.
29. B Wemer. Une théorie des constructions inductives. PhD thesis, Université Paris 7, 1994.