Satisfiability Modulo Heap-Based Programs

DOI10.1007/978-3-319-41528-4_21zbMath1411.68028OpenAlexW2502150621MaRDI QIDQ4633544

Wei-Ngan Chin, Quang Loc Le, Jun Sun

Publication date: 3 May 2019

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://ink.library.smu.edu.sg/sis_research/4937

zbMATH Keywords

satisfiabilityseparation logicdecision procedurescyclic proofsinductive predicates

Mathematics Subject Classification ID

Logic in computer science (03B70) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (5)

Compositional entailment checking for a fragment of separation logic ⋮ An efficient cyclic entailment procedure in a fragment of separation logic ⋮ Enhancing Symbolic Execution of Heap-Based Programs with Separation Logic for Test Input Generation ⋮ Compositional satisfiability solving in separation logic ⋮ Unnamed Item

This page was built for publication: Satisfiability Modulo Heap-Based Programs