Low-level bi-abduction
L Holík, P Peringer, A Rogalewicz, V Šoková… - arXiv preprint arXiv …, 2022 - arxiv.org
The paper proposes a new static analysis designed to handle open programs, ie, fragments
of programs, with dynamic pointer-linked data structures-in particular, various kinds of lists …
of programs, with dynamic pointer-linked data structures-in particular, various kinds of lists …
[PDF][PDF] An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic.
An efficient entailment proof system is essential to compositional verification using
separation logic. Unfortunately, existing decision procedures are either inexpressive or …
separation logic. Unfortunately, existing decision procedures are either inexpressive or …
Generically Automating Separation Logic by Functors, Homomorphisms, and Modules
Foundational verification considers the functional correctness of programming languages
with formalized semantics and uses proof assistants (eg, Coq, Isabelle) to certify proofs. The …
with formalized semantics and uses proof assistants (eg, Coq, Isabelle) to certify proofs. The …
Deciding Boolean Separation Logic via Small Models
We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary
nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded …
nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded …
S2TD: A separation logic verifier that supports reasoning of the absence and presence of bugs
Heap-manipulating programs are known to be challenging to reason about. We present a
novel verifier for heap-manipulating programs called S2TD, which encodes programs …
novel verifier for heap-manipulating programs called S2TD, which encodes programs …
Deciding Boolean Separation Logic via Small Models (Technical Report)
We present a novel decision procedure for a fragment of separation logic (SL) with arbitrary
nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded …
nesting of separating conjunctions with boolean conjunctions, disjunctions, and guarded …
Testing the Satisfiability of Formulas in Separation Logic with Permissions
N Peltier - … Conference on Automated Reasoning with Analytic …, 2023 - Springer
We investigate the satisfiability problem for a fragment of Separation Logic (SL) with
inductively defined spatial predicates and permissions. We show that the problem is …
inductively defined spatial predicates and permissions. We show that the problem is …
Two Results on Separation Logic With Theory Reasoning
M Echenim, N Peltier - arXiv preprint arXiv:2206.09389, 2022 - arxiv.org
Two results are presented concerning the entailment problem in Separation Logic with
inductively defined predicate symbols and theory reasoning. First, we show that the …
inductively defined predicate symbols and theory reasoning. First, we show that the …
Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
W Su, Z Wu, M Sighireanu - arXiv preprint arXiv:2403.01867, 2024 - arxiv.org
Pointer arithmetic is widely used in low-level programs, eg memory allocators. The
specification of such programs usually requires using pointer arithmetic inside inductive …
specification of such programs usually requires using pointer arithmetic inside inductive …
A Proof Procedure For Separation Logic With Inductive Definitions and Theory Reasoning
M Echenim, N Peltier - arXiv preprint arXiv:2201.13227, 2022 - arxiv.org
A proof procedure, in the spirit of the sequent calculus, is proposed to check the validity of
entailments between Separation Logic formulas combining inductively defined predicates …
entailments between Separation Logic formulas combining inductively defined predicates …