Search
Now showing items 1-2 of 2
Satisfiability Modulo Abstraction for Separation Logic with Linked Lists
(University of Wisconsin-Madison Department of Computer Sciences, 2014-07-17)
Separation logic is an expressive logic for reasoning about heap structures in programs. This paper presents a semi-decision procedure for checking unsatisfiability of formulas in a fragment of separation logic that includes ...
Satisfiability Modulo Abstraction for Separation Logic with Linked Lists
(University of Wisconsin-Madison Department of Computer Sciences, 2014-02-13)
Separation logic is an expressive logic for reasoning about heap
structures in programs. This paper presents a semi-decision procedure
for deciding unsatisfiability of formulas in a fragment of separation
logic that ...