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...
Saved in:
Main Authors: | LE, Quang Loc, SUN, Jun, CHIN, Wei-Ngan |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2016
|
Subjects: | |
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 |
Similar Items
-
A decidable fragment in separation logic with inductive predicates and arithmetic
by: LE, Quang Loc, et al.
Published: (2017) -
Constraint-based program reasoning with heaps and separation
by: Duck, G.J., et al.
Published: (2014) -
Automated verification of shape, size and bag properties via user-defined predicates in separation logic
by: Chin, W.-N., et al.
Published: (2013) -
Counting for satisfiability by inverting resolution
by: Andrei, S.
Published: (2014) -
Automatically refining partial specifications for heap-manipulating programs
by: Qin, S., et al.
Published: (2014)