Characteristic formulae for the verification of imperative programs

Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Volumn , Issue , 2011, Pages 418-430

  Charguéraud, Arthur ^a  

^a MAX PLANCK INSTITUTE FOR SOFTWARE SYSTEMS   (Germany)

Author keywords

Verification

Indexed keywords

CHARACTERISTIC FORMULA; COQ PROOF ASSISTANT; HIGHER ORDER; HIGHER ORDER LOGIC; IMPERATIVE ALGORITHM; IMPERATIVE PROGRAMMING LANGUAGES; IMPERATIVE PROGRAMS; INTERACTIVE PROOF ASSISTANTS; ITERATORS; LOCAL REASONING; PROGRAM VERIFICATION; SEPARATION LOGIC; SOURCE CODES;

COMPUTER PROGRAMMING LANGUAGES; FUNCTIONAL PROGRAMMING; SEMANTICS; SPECIFICATIONS; USER INTERFACES;

FORMAL LOGIC;

EID: 80054081712     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2034773.2034828     Document Type: Conference Paper

References (42)

1. Andrew W. Appel. Tactics for separation logic. Unpublished draft, http://www.cs.princeton.edu/appel/papers/septacs.pdf, 2006.
2. Mike Barnett, Rob DeLine, Manuel Fähndrich, K. Rustan M. Leino, and Wolfram Schulte. Verification of object-oriented programs with invariants. Journal of Object Technology, 3(6), 2004.
3. Bruno Barras and Bruno Bernardo. The implicit calculus of constructions as a programming language with dependent types. In FoSSaCS, volume 4962 of LNCS, pages 365-379. Springer, 2008.
4. Bernhard Beckert, Reiner Hähnle, and Peter H. Schmitt. Verification of Object-Oriented Software: The KeY Approach, volume 4334 of LNCS. Springer-Verlag, Berlin, 2007.
5. Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In International Symposium on Formal Methods for Components and Objects, volume 4111 of LNCS, pages 115-137. Springer, 2005.
6. Martin Berger, Kohei Honda, and Nobuko Yoshida. A logical analysis of aliasing in imperative higher-order functions. In ICFP, pages 280- 293, 2005.
7. Arthur Charguéraud. Verification of call-by-value functional programs through a deep embedding. 2009. Unpublished. http://arthur.chargueraud. org/research/2009/deep/.
8. Arthur Charguéraud. Characteristic Formulae for Mechanized Program Verification. PhD thesis, Université Paris-Diderot, 2010.
9. Arthur Charguéraud. Program verification through characteristic formulae. In ICFP, pages 321-332. ACM, 2010.
10. Adam Chlipala, Gregory Malecha, Greg Morrisett, Avraham Shinnar, and Ryan Wisnesky. Effective interactive proofs for higher-order imperative programs. In ICFP, 2009.
11. The Coq Development Team. The Coq Proof Assistant Reference Manual, Version 8.2, 2009.
12. Jean-Christophe Fillître. Verification of non-functional programs using interpretations in type theory. Journal of Functional Programming, 13(4):709-745, 2003.
13. Cormac Flanagan, Amr Sabry, Bruce F. Duba, and Matthias Felleisen. The essence of compiling with continuations. In PLDI, pages 237- 247, 1993.
14. Susanne Graf and Joseph Sifakis. A modal characterization of observational congruence on finite terms of CCS. Information and Control, 68(1-3):125-145, 1986.
15. David Harel, Dexter Kozen, and Jerzy Tiuryn. Dynamic Logic. The MIT Press, Cambridge, Massachusetts, 2000.
16. Matthew Hennessy and Robin Milner. On observing nondeterminism and concurrency. In ICALP, volume 85 of LNCS, pages 299-309. Springer-Verlag, 1980.
17. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 583, 1969.
18. Kohei Honda, Martin Berger, and Nobuko Yoshida. Descriptive and relative completeness of logics for higher-order functions. In ICALP, volume 4052 of LNCS. Springer, 2006.
19. Bart Jacobs and Erik Poll. Java program verification at nijmegen: Developments and perspective. In ISSS, volume 3233 of LNCS, pages 134-153. Springer, 2003.
20. Johannes Kanig and Jean-Christophe Fillître. Who: a verifier for effectful higher-order programs. In ML'09: Proceedings of the 2009 ACM SIGPLAN workshop on ML, pages 39-48. ACM, 2009.
21. Gerwin Klein, Philip Derrin, and Kevin Elphinstone. Experience report: seL4: formally verifying a high-performance microkernel. In ICFP, pages 91-96. ACM, 2009.
22. Gerwin Klein, Kevin Elphinstone, Gernot Heiser, June Andronick, David Cock, Philip Derrin, Dhammika Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, and Simon Winwood. seL4: Formal verification of an OS kernel. In Proceedings of the 22nd Symposium on Operating Systems Principles (SOSP), Operating Systems Review (OSR), pages 207-220, Big Sky, MT, 2009. ACM SIGOPS.
23. Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In POPL, pages 42-54, 2006.
24. Xavier Leroy, Damien Doligez, Jacques Garrigue, Didier Rémy, and Jérôme Vouillon. The Objective Caml system, 2005.
25. Pierre Letouzey. Programmation fonctionnelle certifiée - l'extraction de programmes dans l'assistant Coq. PhD thesis, Université Paris 11, 2004.
26. Nicolas Marti, Reynald Affeldt, and Akinori Yonezawa. Towards formal verification of memory properties using separation logic, 2005.
27. Andrew McCreight. Practical tactics for separation logic. In TPHOLs, volume 5674 of LNCS, pages 343-358. Springer, 2009.
28. Farhad Mehta and Tobias Nipkow. Proving pointer programs in higher-order logic. Information and Computation, 199(1-2), 2005.
29. Magnus O. Myreen. Formal Verification of Machine-Code Programs. PhD thesis, University of Cambridge, 2008.
30. Magnus O. Myreen. Separation logic adapted for proofs by rewriting. In Interactive Theorem Proving (ITP), volume 6172 of LNCS, pages 485-489. Springer, 2010.
31. Magnus O. Myreen and Michael J. C. Gordon. Verified LISP implementations on ARM, x86 and powerPC. In TPHOLs, volume 5674 of LNCS, pages 359-374. Springer, 2009.
32. Aleksandar Nanevski and Greg Morrisett. Dependent type theory of stateful higher-order functions. Technical Report TR-24-05, Harvard University, 2005.
33. Aleksandar Nanevski, J. Gregory Morrisett, and Lars Birkedal. Hoare type theory, polymorphism and separation. Journal of Functional Programming, 18(5-6):865-911, 2008.
34. Aleksandar Nanevski, Viktor Vafeiadis, and Josh Berdine. Structuring the verification of heap-manipulating programs. In POPL, pages 261- 274. ACM, 2010.
35. Zhaozhong Ni and Zhong Shao. Certified assembly programming with embedded code pointers. In POPL, 2006.
36. Peter O'Hearn, John Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In CSL, volume 2142 of LNCS, pages 1-19, Berlin, 2001. Springer-Verlag.
37. Chris Okasaki. Purely Functional Data Structures. Cambridge University Press, 1999.
38. Yann Régis-Gianas and François Pottier. A Hoare logic for call-byvalue functional programs. In MPC, 2008.
39. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74, 2002.
40. Hayo Thielecke. Frame rules from answer types for code pointers. In POPL, pages 309-319, 2006.
41. Thomas Tuerk. Local reasoning about while-loops. In VSTTE LNCS, 2010.
42. Karen Zee, Viktor Kuncak, and Martin C. Rinard. An integrated proof language for imperative programs. In PLDI, pages 338-351. ACM, 2009.