Mechanical verification of recursive procedures manipulating pointers using separation logic

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

Volumn 4085 LNCS, Issue , 2006, Pages 508-523

  Preoteasa, Viorel ^a  

^a ÅBO AKADEMI UNIVERSITY   (Finland)

Author keywords

Mechanical Verification of Programs; Pointer Programs; Predicate Transformers Semantics; Recursive Procedures; Separation Logic

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; RECURSIVE FUNCTIONS; SEMANTICS; THEOREM PROVING;

MECHANICAL VERIFICATION OF PROGRAMS; POINTER PROGRAMS; PREDICATE TRANSFORMERS SEMANTICS; RECURSIVE PROCEDURES; SEPARATION LOGICS;

COMPUTER PERIPHERAL EQUIPMENT;

EID: 33749424421     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11813040_34     Document Type: Conference Paper

References (14)

1. R.J. Back and V. Preoteasa. An algebraic treatment of procedure refinement to support mechanical verification. Formal Aspects of Computing, 17:69-90, May 2005.
2. R.J. Back and J. von Wright. Refinement Calculus. A systematic Introduction. Springer, 1998.
3. A. Church. A formulation of the simple theory of types. J. Symbolic logic, 5:56-68, 1940.
4. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576-580, 1969.
5. S.S. Ishtiaq and P.W. O'Hearn. Bi as an assertion language for mutable data structures. In POPL '01: Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 14-26, New York, NY, USA, 2001. ACM Press.
6. T. Nipkow, L.C. Paulson, and M. Wenzel. Isabelle/HOL - A Proof Assistant for Higher-Order Logic, volume 2283 of LNCS. Springer, 2002.
7. P.W. O'Hearn, J.C. Reynolds, and H. Yang. Local reasoning about programs that alter data structures. In CSL '01: Proceedings of the 15th International Workshop on Computer Science Logic., volume 2142 of Lecture Notes In Computer Science, pages 1-19, London, UK, 2001. Springer-Verlag.
8. S. Owre, N. Shankar, J.M. Rushby, and D.W.J. Stringer-Clavert. PVS language reference. Technical report, Computer Science Laboratory, SRI Internationa], dec 2001.
9. V. Preoteasa. Mechanical verification of mutually recursive procedures for parsing expressions using separation logic. Technical Report 771, TUCS - Turku Centre for Computer Science, May 2006.
10. J. Reynolds. Intuitionistic reasoning about shared mutable data structure. In Millenial Perspectives in Computer Science, 2000.
11. J. Reynolds. Separation logic: A logic for shared mutable data structures. In 17th Annual IEEE Symposium on Logic in Computer Science. IEEE, July 2002.
12. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math., 5:285-309, 1955.
13. Tjark Weber. Towards mechanized program verification with separation logic. In Jerzy Marcinkowski and Andrzej Tarlecki, editors, Computer Science Logic - 18th International Workshop, CSL 2004, 13th Annual Conference of the EACSL, Karpacz, Poland, September 2004, Proceedings, volume 3210 of Lecture Notes in Computer Science, pages 250-264. Springer, September 2004.
14. H. Yang and P.W. O'Hearn. A semantic basis for local reasoning. In FoSSaCS '02: Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, volume 2303 of Lecture Notes In Computer Science, pages 402-416, London, UK, 2002. Springer-Verlag.