Satisfiability modulo heap-based programs

Satisfiability modulo heap-based programs

In this work, we present a semi-decision procedure for a fragment of separation logic with user-defined predicates and Presburger arithmetic. To check the satisfiability of a formula, our procedure iteratively unfolds the formula and examines the derived disjuncts. In each iteration, it searches for...

Full description

Saved in:
Bibliographic Details
Main Authors: LE, Quang Loc, SUN, Jun, CHIN, Wei-Ngan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2016
Subjects:
Decision procedures
Satisfiability
Separation logic
Inductive predicates
Cyclic proofs
Programming Languages and Compilers
Software Engineering
Online Access:https://ink.library.smu.edu.sg/sis_research/4937
https://ink.library.smu.edu.sg/context/sis_research/article/5940/viewcontent/Satisfiability.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/4937
https://ink.library.smu.edu.sg/context/sis_research/article/5940/viewcontent/Satisfiability.pdf

Similar Items