Towards mechanized program verification with separation logic

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

Volumn 3210, Issue , 2004, Pages 250-264

  Weber, Tjark ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

Formal program verification; Interactive theorem proving; Separation logic

Indexed keywords

FORMAL LOGIC; RECONFIGURABLE HARDWARE; SEPARATION; THEOREM PROVING;

FORMAL PROGRAM VERIFICATION; FORMAL PROOFS; HOARE LOGIC; INTERACTIVE THEOREM PROVING; PROGRAM VERIFICATION; SEPARATION LOGIC; SOUNDNESS AND RELATIVE COMPLETENESS; THEOREM PROVERS;

COMPUTER CIRCUITS;

EID: 26844582848     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30124-0_21     Document Type: Article

References (19)

1. Krzysztof R. Apt. Ten years of Hoare's logic: A survey - part I. ACM Transactions on Programming Languages and Systems, 3(4):431-483, October 1981.
2. Krzysztof R. Apt. Ten years of Hoare's logic: A survey - part II: Nondeterminism. Theoretical Computer Science, 28:83-109, 1984.
3. Clark W. Barrett, David L. Dill, and Jeremy R. Levitt. Validity checking for combinations of theories with equality. In Mandayam K. Srivas and Albert J. Camilleri, editors, Formal Methods in Computer-Aided Design, volume 1166 of Lecture Notes in Computer Science, pages 187-201. Springer, November 1996.
4. Lars Birkedal, Noah Torp-Smith, and John C. Reynolds. Local reasoning about a copying garbage collector. In Proceedings of the 31-st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 220-231. ACM Press, January 2004.
5. Richard Bornat. Proving pointer programs in Hoare logic. In Mathematics of Program Construction, pages 102-126, 2000.
6. Rodney M. Burstall. Some techniques for proving correctness of programs which alter data structures. In Bernard Meltzer and Donald Michie, editors, Machine Intelligence, volume 7, pages 23-50. Edinburgh University Press, Edinburgh, Scotland, 1972.
7. Cristiano Calcagno, Hongseok Yang, and Peter W. O'Hearn. Computability and complexity results for a spatial assertion language for data structures. In Ramesh Hariharan, Madhavan Mukund, and V. Vinay, editors, FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, volume 2245 of Lecture Notes in Computer Science, pages 108-119. Springer, 2001.
8. E. Dijkstra. Guarded commands, non-determinacy and formal derivation of programs. Communications of the ACM, 18:453-457, 1975.
9. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, October 1969.
10. Brian W. Kernighan and Dennis M. Ritchie. The C Programming Language. Prentice Hall, Inc., second edition, 1988.
11. Farhad Mehta and Tobias Nipkow. Proving pointer programs in higher-order logic. In Franz Baader, editor, Automated Deduction - CADE-19, volume 2741 of Lecture Notes in Artificial Intelligence, pages 121-135. Springer, 2003.
12. Tobias Nipkow. Winskel is (almost) right: Towards a mechanized semantics text-book. Formal Aspects of Computing, 10(2):171-186, 1998.
13. Tobias Nipkow. Hoare logics in Isabelle/HOL. In H. Schwichtenberg and R. Steinbrüggen, editors, Proof and System-Reliability, pages 341-367. Kluwer, 2002.
14. Tobias Nipkow, Lawrence C. Paulson, and Markus Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of Lecture Notes in Computer Science. Springer, 2002.
15. Peter W. O'Hearn, John Reynolds, and Hongseok Yang. Local reasoning about programs that alter data structures. In Laurent Fribourg, editor, Computer Science Logic, volume 2142 of Lecture Notes in Computer Science, pages 1-19. Springer, 2001.
16. John C. Reynolds. Separation logic: A logic for shared mutable data structures. In Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), pages 55-74, 2002.
17. Martin Wildmoser and Tobias Nipkow. Certifying machine code safety: shallow versus deep embedding. Accepted to the 17th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2004).
18. Hongseok Yang. Local Reasoning for Stateful Programs. PhD thesis, University of Illinois, Urbana-Champaign, 2001.
19. Hongseok Yang and Peter W. O'Hearn. A semantic basis for local reasoning. In Foundations of Software Science and Computation Structure, pages 402-416, 2002.