A Coq Library for Verification of Concurrent Programs

Electronic Notes in Theoretical Computer Science

Volumn 199, Issue , 2008, Pages 17-32

  Affeldt, Reynald ^a   Kobayashi, Naoki ^b  

^a NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

concurrent programs; Coq; pi calculus; Proof assistant

Indexed keywords

ABSTRACTING; COMPUTER PROGRAMMING LANGUAGES; CONCURRENT ENGINEERING; ENCODING (SYMBOLS); VERIFICATION;

ABSTRACT SYSTEMS; CONCURRENT PROGRAMS; PI-CALCULUS; PROOF ASSISTANT;

DIGITAL LIBRARIES;

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

References (32)

1. Abadi, Martín, and Cédric Fournet, Mobile values, new names, and secure communication, in 28th ACM Symposium on Principles of Programming Languages (POPL 2001), p. 104-115, ACM Press
2. Affeldt R., and Kobayashi N. Formalization and verification of a mail server in Coq. International Symposium on Software Security. Lecture Notes in Computer Science volume 2609 (Feb. 2003), Springer-Verlag 217-233
3. Affeldt R., and Kobayashi N. A Coq Library for Verification of Concurrent Programs. http://staff.aist.go.jp/reynald.affeldt/applpi Coq scripts
4. Affeldt R., and Kobayashi N. Partial Order Reduction for Verification of Spatial Properties of Pi-Calculus Processes. 11th International Workshop on Expressiveness in Concurrency. (EXPRESS 2004). Electronic Notes in Theoretical Computer Science 128 2 (2005) 151-168 Elsevier
5. Black, Paul E., "Axiomatic Semantics Verification of a Secure Web Server," Ph.D. thesis, Department of Computer Science, Brigham Young University, 1998
6. Boulton, Richard, Andrew Gordon, Mike Gordon, John Harrison, John Herbert, and John Van Tassel, Experience with embedding hardware description languages in HOL, in IFIP TC10/WG 10.2 International Conference on Theorem Provers in Circuit Design: Theory, Practice and Experience, volume A-10 of IFIP Transactions, p. 129-156, Elsevier, 1992
7. Cardelli, Luca, and Andrew D. Gordon, Anytime, anywhere: modal logics for mobile ambients, in 27th ACM Symposium on Principles of Programming Languages (POPL 2000), p. 365-377, ACM Press
8. Cervesato, Iliano, Frank Pfenning, David Walker, and Kevin Watkins, A concurrent logical framework II: Examples and applications, Technical Report CMU-CS-02-102, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
9. Coupet-Grimal S. An axiomatization of linear temporal logic in the calculus of inductive constructions. Journal of Logic and Computation 13 6 (2003) 801-813
10. Coupet-Grimal S., and Nouvet C. Formal verification of an incremental garbage collector. Journal of Logic and Computation 13 6 (2003) 815-833
11. Dam M. Proof Systems for the pi-calculus Logics. Logic for Concurrency and Synchronisation. Trends in Logic, Logica Library (2003), Kluwer
12. Despeyroux J., Felty A., and Hirschowitz A. Higher-Order Abstract Syntax in Coq. 2nd International Conference on Typed Lambda Calculi and Applications. (TLCA 1995). Lecture Notes in Computer Science volume 905 (Apr. 1995), Springer-Verlag 124-138
13. Despeyroux J. A higher-order specification of the π-calculus. IFIP Conference on Theoretical Computer Science 2000. Lecture Notes in Computer Science volume 1872 (Aug. 2000), Springer-Verlag 425-439
14. Filliâtre, Jean-Christophe, Why: a multi-language multi-prover verification tool, Research Report 1366, LRI, Université Paris Sud, Mar. 2003
15. Gay S.J. A framework for the formalisation of pi calculus type systems in Isabelle/HOL. Theorem Proving in Higher Order Logics. (TPHOLs 2001). Lecture Notes in Computer Science volume 2152 (Sep. 2001), Springer-Verlag 217-232
16. Heyd B., and Crégut P. A modular coding of UNITY in Coq. Theorem Proving in Higher Order Logics. (TPHOLs 1996). Lecture Notes in Computer Science volume 1125 (Aug. 1996), Springer-Verlag 251-266
17. Hirschkoff, Daniel, "Mise en œuvre de preuves de bisimulation," Ph.D. thesis, École Nationale des Ponts et Chaussées, 1999
18. Honsell F., Miculan M., and Scagnetto I. π-calculus in (co)inductive type theory. Theoretical Computer Science 253 2 (Feb. 2001) 239-285
19. Kobayashi N. A type system for lock-free processes. Information and Computation 177 2 (Sep. 2002) 122-159
20. Kobayashi N. Type systems for concurrent programs. Tutorial. UNU/IIST 10th Anniversary Colloquium. March 2002, Lisbon, Portugal (2002), Springer-Verlag
21. Kobayashi, Naoki, Benjamin C. Pierce, and David N. Turner, Linearity and the Pi-Calculus, in 23rd ACM Symposium on Principles of Programming Languages (POPL 1996), p. 358-371, ACM Press.
22. Manolios, Panagiotis, "Mechanical Verification of Reactive Systems," Ph.D. thesis, The University of Texas at Austin, Department of Computer Sciences, Austin, TX, 2001
23. Melham T.F. A Mechanized Theory of the π-calculus in HOL. Nordic Journal of Computing 1 1 (1995) 50-76
24. Milner R., Parrow J., and Walker D. A calculus of mobile processes, parts I and II. Information and Computation 100 1 (1992) 1-77
25. Paulson L.C. Mechanizing a theory of program composition for UNITY. ACM Transactions on Programming Languages and Systems 23 5 (2001) 626-656
26. Pierce B.C., and Turner D.N. Pict: A programming language based on the pi-calculus. Proof, Language and Interaction: Essays in Honour of Robin Milner (2000), MIT Press
27. Pierce, Benjamin C., and Jérôme Vouillon, Specifying a file synchronizer, Draft, Mar. 2002
28. Röckl C., Hirschkoff D., and Berghofer S. Higher-order abstract syntax with induction in Isabelle/HOL: Formalizing the pi-calculus and mechanizing the theory of contexts. Foundations of Software Science and Computation Structures. (FOSSACS 2001). Lecture Notes in Computer Science number 2030 (Apr. 2001), Springer-Verlag
29. Scagnetto I., and Miculan M. Ambient calculus and its logic in the calculus of inductive constructions. 3rd International Workshop on Logical Frameworks and Meta-Languages. (LFM 2002). Electronic Notes in Theoretical Computer Science 70 2 (2002) Elsevier
30. The Coq Development Team, "The Coq Proof Assistant Reference Manual," INRIA, 2004
31. Watkins, Kevin, Iliano Cervesato, Frank Pfenning, and David Walker, A concurrent logical framework I: Judgments and properties, Technical Report CMU-CS-02-101, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 2003
32. Yu, Shen-Wei, "Formal Verification of Concurrent Programs Based on Type Theory," Ph.D. thesis, Department of Computer Science, University of Durham, 1998