Higher-Order Separation Logic in Isabelle/HOLCF

Electronic Notes in Theoretical Computer Science

Volumn 218, Issue C, 2008, Pages 371-389

  Varming, Carsten ^a,b   Birkedal, Lars ^a,b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IT UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Copying Garbage Collection; Isabelle HOL; Reliability; Separation Logic; Verification

Indexed keywords

ASSERTION LANGUAGES; COPYING GARBAGE COLLECTORS; DATA ABSTRACTIONS; DENOTATIONAL SEMANTICS; ENCODING; FIRST-ORDER; FIXED POINTS; GARBAGE COLLECTIONS; HOL SYSTEMS; HOL THEOREM PROVERS; IMPERATIVE LANGUAGES; INTERNATIONAL WORKSHOPS; ISABELLE/HOL; LOCAL REASONINGS; LOCAL VARIABLES; MARKING ALGORITHMS; PROGRAMMING LANGUAGES; RECURSION; REYNOLDS; SEPARATION LOGIC; SEPARATION LOGICS;

ABSTRACTING; BOOLEAN FUNCTIONS; COBOL (PROGRAMMING LANGUAGE); COMPUTER SOFTWARE; COMPUTERS; COPYING; FORMAL LOGIC; INFORMATION THEORY; ISOMERS; LINGUISTICS; MIXED CONVECTION; PROGRAMMING THEORY; QUERY LANGUAGES; REFUSE COLLECTION; REFUSE DISPOSAL; SEMANTICS; SEPARATION; THEOREM PROVING; WASTE DISPOSAL;

COMPUTER PROGRAMMING LANGUAGES;

EID: 54149105034     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.10.022     Document Type: Article

References (20)

1. Biering B., Birkedal L., and Torp-Smith N. BI-hyperdoctrines, higher-order separation logic, and abstraction. ACM Trans. Program. Lang. Syst. 29 (2007)
2. Birkedal, L., N.T. Smith and J.C. Reynolds, Local reasoning about a copying garbage collector, in: Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (2004), pp. 220-231
3. Brookes S. A semantics for concurrent separation logic. Theoretical Computer Science 375 (2007) 227-270
4. Cheney C.J. A nonrecursive list compacting algorithm. Commun. ACM 13 (1970) 677-678
5. Church A. A formulation of the simple theory of types. The Journal of Symbolic Logic 5 (1940) 56-68
6. Gordon, M., Introduction to the HOL system, in: HOL Theorem Proving System and Its Applications, 1991., International Workshop on the, 1991, pp. 2-3
7. Krishnaswami, N., J. Aldrich and L. Birkedal, Modular verification of the Subject-Observer pattern via higher-order separation logic, in: 9th Workshop on Formal Techniques for Java-like Programs (FTfJP 2007), 2007
8. Lin, C., A. Mccreight, Z. Shao, Y. Chen and Y. Guo, Foundational typed assembly language with certified garbage collection, in: TASE '07: Proceedings of the First Joint IEEE/IFIP Symposium on Theoretical Aspects of Software Engineering (2007), pp. 326-338
9. McCreight A., Shao Z., Lin C., and Li L. A general framework for certifying garbage collectors and their mutators. SIGPLAN Not. 42 (2007) 468-479
10. Müller O., Nipkow T., Von Oheimb D., and Slotosch O. HOLCF = HOL + LCF. J. Funct. Program. 9 (1999) 191-223
11. Nanevski A., Ahmed A., Morrisett G., and Birkedal L. Abstract Predicates and Mutable ADTs in Hoare Type Theory. Proceedings of ESOP'07. LNCS 4421 (2007) 189-204
12. O'Hearn P. Resources, concurrency, and local reasoning. Theoretical Computer Science 375 (2007)
13. O'Hearn, P.W., 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 (2001), pp. 1-19
14. Parkinson, M., When separation logic met Java, in: FTfJP'06, 2006
15. Parkinson, M. and G. Biermann, Separation logic, abstraction and inheritance, in: Proc. 35th POPL, 2008
16. Paulson, L.C., Isabelle: The next seven hundred theorem provers, in: Proceedings of the 9th International Conference on Automated Deduction (1988), pp. 772-773
17. Preoteasa, V., Mechanical verification of recursive procedures manipulating pointers using separation logic, in: 14th International Symposium on Formal Methods, 2006, pp. 508-523
18. Reynolds J.C. Separation logic: A logic for shared mutable data structures (2002)
19. Weber T. Towards mechanized program verification with separation logic. Proceedings of CSL'04. LNCS 3210 (2004) 250-264
20. Yang H. An example of local reasoning in BI pointer logic: the Schorr-Waite graph marking algorithm (2002)