Structuring the verification of heap-manipulating programs

DOI10.1145/1706299.1706331MaRDI QIDQ5255079zbMATH OpenOpenAlexFDO

Authors Aleksandar Nanevski, Viktor Vafeiadis, Josh Berdine

Publication date 11 June 2015

Published in Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1706299.1706331

zbMATH Keywords

monadstype theoryHoare logicseparation logic

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Computer Science Logic
• A proof system for separation logic with magic wand
• Modular reasoning about heap paths via effectively propositional formulas
• Practical Tactics for Separation Logic
• Satisfiability modulo heap-based programs

Cited in

(10)

• Deductive synthesis of programs with pointers: techniques, challenges, opportunities (invited paper)
• On the adequacy of dependence-based representations for programs with heaps
• Quantified Heap Invariants for Object-Oriented Programs
• scientific article; zbMATH DE number 6712238 (Why is no real title available?)
• Verified heap theorem prover by paramodulation
• Mechanized verification with sharing
• Partiality, state and dependent types
• Mtac: a monad for typed tactic programming in Coq
• Heap-bounded assembly language
• A machine-checked framework for relational separation logic

Describes a project that uses

Uses Software

• Ynot
• Coq

This page was built for publication: Structuring the verification of heap-manipulating programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5255079)