Proving pointer programs in higher-order logic

Information and Computation

Volumn 199, Issue 1-2, 2005, Pages 200-227

  Mehta, Farhad ^a   Nipkow, Tobias ^b  

^a ETH ZURICH   (Switzerland)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Higher order logic; Hoare logic; Pointer programs; Schorr Waite algorithm; Verification

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; GRAPH THEORY; MAPPING; THEOREM PROVING;

HIGH-ORDER LOGIC; HOARE LOGIC; POINTER PROGRAMS; SCHORR-WAITE ALGORITHM; VERIFICATION;

FORMAL LOGIC;

EID: 20144375380     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ic.2004.10.007     Document Type: Conference Paper

References (22)

1. J.R. Abrial Event based sequential program development: application to constructing a pointer program K. Araki S. Gnesi D. Mandrioli Formal Methods Europe (FME 2003) Lect. Notes in Comp. Sci. vol. 2805 2003 Springer-Verlag Berlin 51 74
2. J.R. Abrial, and D. Cansell Click'n prove: interactive proofs within set theory D. Basin B. Wolff Theorem Proving in Higher Order Logics, TPHOLs 2003 Lect. Notes in Comp. Sci. vol. 2758 2003 Springer-Verlag Berlin 1 24
3. R. Bornat Proving pointer programs in Hoare Logic R. Backhouse J. Oliveira Mathematics of Program Construction (MPC 2000) Lect. Notes in Comp. Sci. vol. 1837 2000 Springer-Verlag Berlin 102 126
4. R. Bornat, and B. Sufrin Animating formal proofs at the surface: the Jape proof calculator Comput. J. 43 1999 177 192
5. R. Bornat, Proofs of pointer programs in Jape. Available from: 〈 http://www.dcs.qmul.ac.uk/~richard/pointers/〉
6. R. Burstall Some techniques for proving correctness of programs which alter data structures B. Meltzer D. Michie Machine Intelligence 7 1972 Edinburgh University Press 23 50
7. Clearsy, Atelier B. User Manual, Aix-en-Provence (2001)
8. M.J.C. Gordon Mechanizing programming logics in higher order logic Curr. Trends Hardware Verification Automated Theorem Proving 1989 387 439
9. J.L. Jensen, M.E. Joergensen, M.I. Schwartzbach, N. Klarlund, Automatic verification of pointer programs using monadic second-order logic, in: Proceedings of the ACM SIGPLAN 1997 Conference on Programming Language Design and Implementation, ACM Press, 1997, pp. 226-234
10. F. Mehta, T. Nipkow, Proving pointer programs in higher-order logic. Available from: 〈 http://www.in.tum.de/~nipkow/pubs/iandc05.html〉
11. T. Nipkow Structured proofs in Isar/HOL H. Geuvers F. Wiedijk Types for Proofs and Programs (TYPES 2002) Lect. Notes in Comp. Sci. vol. 2646 2003 Springer-Verlag Berlin 259 278
12. T. Nipkow, L. Paulson, M. Wenzel, Isabelle/HOL - A Proof Assistant for Higher-Order Logic, Lect. Notes in Comp. Sci., vol. 2283, Springer-Verlag, Berlin, 2002. Available from: http://www.in.tum.de/~nipkow/LNCS2283/
13. T. Nipkow Winskel is (almost) right: towards a mechanized semantics textbook Formal Asp. Comput. 10 1998 171 186
14. L.C. Paulson Generic automatic proof tools R. Veroff Automated Reasoning and its Applications: Essays in Honor of Larry Wos 1997 MIT Press 23 47
15. L.C. Paulson, A generic tableau prover and its integration with Isabelle, Tech. Rep. 441, University of Cambridge, Computer Laboratory, 1998
16. J.C. Reynolds Intuitionistic reasoning about shared mutable data structures J. Davies B. Roscoe J. Woodcock Millenial Perspectives in Computer Science 2000 Palgrave Houndsmill, Hampshire 303 321
17. J.C. Reynolds, Separation logic: a logic for shared mutable data structures, in: Proc. 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002, pp. 55-74
18. J.C. Reynolds, Class notes for "Specification, Verification, and Refinement of Software", CMU, Spring 2003, Chapter 3, pp. 51-61, avaliable from the author's homepage
19. H. Schorr, and W.M. Waite An efficient machine-independent procedure for garbage collection in various list structures Commun. ACM 10 8 1967 501 506
20. N. Suzuki, Automatic verification of programs with complex data structures, PhD thesis, Stanford University (1976), Garland Publishing (1980)
21. M. Wenzel, Isabelle/isar - a versatile environment for human-readable formal proof documents, PhD thesis, Institut für Informatik, Technische Universität München. Available from: http://tumb1.biblio.tu-muenchen. de/publ/diss/in/2002/wenzel.html (2002)
22. H. Yang, Local reasoning for stateful programs, PhD thesis, University of Illinois, Urbana-Champaign (2001)