Verified heap theorem prover by paramodulation

DOI10.1145/2364527.2364531zbMath1291.68371OpenAlexW2170471756MaRDI QIDQ5168877

Gordon Stewart, Andrew W. Appel, Lennart Beringer

Publication date: 21 July 2014

Published in: Proceedings of the 17th ACM SIGPLAN international conference on Functional programming (Search for Journal in Brave)

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

zbMATH Keywords

theorem provingseparation logicparamodulation

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18)

Related Items (2)

Verified abstract interpretation techniques for disassembling low-level self-modifying code ⋮ Automated Theorem Proving for Assertions in Separation Logic with All Connectives

Uses Software

• Coq
• VeriStar
• SLAyer
• Smallfoot
• VeriSmall
• jStar
• Gallina

This page was built for publication: Verified heap theorem prover by paramodulation