Effective interactive proofs for higher-order imperative programs

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

Volumn , Issue , 2009, Pages 79-90

  Chlipala, Adam ^a   Malecha, Gregory ^a   Morrisett, Greg ^a   Shinnar, Avraham ^a   Wisnesky, Ryan ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

Dependent types; Interactive proof assistants; Keywords functional programming; Separation logic

Indexed keywords

COQ PROOF ASSISTANT; CORRECTNESS PROOFS; DECISION PROCEDURE; DEPENDENT TYPES; DOMAIN SPECIFIC; FIRST-PRINCIPLES; HASH TABLE; HIGHER ORDER; IMPERATIVE PROGRAMS; INTERACTIVE PROOF ASSISTANTS; INTERACTIVE PROOFS; ITERATORS; LANGUAGE DESIGN; NEW APPROACHES; NEW SYSTEM; NUMBER OF DATUM; ORDER OF MAGNITUDE; ORIGINAL SYSTEMS; PROGRAM LOGIC; PROGRAM VERIFICATION; PROOF ASSISTANT; PROOF OF CONCEPT; SEPARATION LOGIC; SIMPLIFICATION RULES; SOURCE FILES; TYPE THEORY;

DATA STRUCTURES; FORMAL LOGIC; FUNCTIONAL PROGRAMMING; SEPARATION;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 70450181615     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1596550.1596565     Document Type: Conference Paper

References (25)

1. Mike Barnett, K. Rustan M. Leino, and Wolfram Schulte. The Spec# programming system: An overview. In Proc. CASSIS, 2004.
2. Bruno Barras and Bruno Bernardo. The Implicit Calculus of Constructions as a programming language with dependent types. In Proc. FoSSaCS, 2008.
3. Josh Berdine, Cristiano Calcagno, and Peter W. O'Hearn. Smallfoot: Modular automatic assertion checking with separation logic. In Proc. FMCO, 2005.
4. Yves Bertot and Pierre Castéran. Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. Springer Verlag, 2004.
5. Lukas Bulwahn, Alexander Krauss, Florian Haftmann, Levent Erkök, and John Matthews. Imperative functional programming with Isabelle/HOL. In Proc. TPHOLs, 2008.
6. Bor-Yuh Evan Chang and Xavier Rival. Relational inductive shape analysis. In Proc. POPL, 2008.
7. Arthur Charguéraud and François Pottier. Functional translation of a calculus of capabilities. In Proc. ICFP, 2008.
8. Chiyan Chen and Hongwei Xi. Combining programming with theorem proving. In Proc. ICFP, 2005.
9. David Delahaye. A tactic language for the system Coq. In Proc. LPAR, 2000.
10. Cormac Flanagan, K. Rustan M. Leino, Mark Lillibridge, Greg Nelson, James B. Saxe, and Raymie Stata. Extended static checking for Java. In Proc. PLDI, 2002.
11. Bryan Ford. Parsing expression grammars: A recognition-based syntactic foundation. In Proc. POPL, 2004.
12. Jessica Gronski, Kenneth Knowles, Aaron Tomb, Stephen N. Freund, and Cormac Flanagan. Sage: Hybrid checking for flexible specifications. In Proc. Scheme Workshop, 2006.
13. Matt Kaufmann and J. S. Moore. An industrial strength theorem prover for a logic based on Common Lisp. IEEE Trans. Softw. Eng., 23(4), 1997.
14. Xavier Leroy. Formal certification of a compiler back-end or: programming a compiler with a proof assistant. In Proc. POPL, 2006.
15. Barbara Liskov and Stephen N. Zilles. Specification techniques for data abstractions. IEEE Trans. Software Eng., 1(1): 7-19, 1975.
16. Conor McBride and James McKinna. The view from the left. J. Functional Programming, 14(1): 69-111, 2004.
17. Aleksandar Nanevski, Greg Morrisett, and Lars Birkedal. Polymorphism and separation in Hoare Type Theory. Proc. ICFP, 2006.
18. Aleksandar Nanevski, GregMorrisett, Avraham Shinnar, Paul Govereau, and Lars Birkedal. Ynot: Reasoning with the awkward squad. In Proc. ICFP, 2008.
19. Ulf Norell. Towards a practical programming language based on dependent type theory. PhD thesis, Chalmers University of Technology, 2007.
20. Emir Pasalic, Jeremy Siek, Walid Taha, and Seth Fogarty. Concoqtion: Indexed types now! In Proc. PEPM, 2007.
21. Rasmus L. Petersen, Lars Birkedal, Aleksandar Nanevski, and Greg Morrisett. A realizability model for impredicative Hoare Type Theory. In Proc. ESOP, 2008.
22. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proc. LICS, 2002.
23. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24, 2002.
24. Wouter Swierstra and Thorsten Altenkirch. Beauty in the beast: A functional semantics for the awkward squad. In Proc. Haskell Workshop, 2007.
25. Karen Zee, Viktor Kuncak, and Martin Rinard. Full functional verification of linked data structures. In Proc. PLDI, 2008.