TOOLympics 2019: An overview of competitions in formal methods
Abstract Evaluation of scientific contributions can be done in many different ways. For the
various research communities working on the verification of systems (software, hardware, or …
various research communities working on the verification of systems (software, hardware, or …
Matching μ-logic
X Chen, G Roşu - 2019 34th Annual ACM/IEEE Symposium on …, 2019 - ieeexplore.ieee.org
Matching logic is a logic for specifying and reasoning about structure by means of patterns
and pattern matching. This paper makes two contributions. First, it proposes a sound and …
and pattern matching. This paper makes two contributions. First, it proposes a sound and …
A decision procedure for guarded separation logic complete entailment checking for separation logic with inductive definitions
We develop a doubly exponential decision procedure for the satisfiability problem of
guarded separation logic—a novel fragment of separation logic featuring user-supplied …
guarded separation logic—a novel fragment of separation logic featuring user-supplied …
[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 …
Towards a unified proof framework for automated fixpoint reasoning using matching logic
X Chen, MT Trinh, N Rodrigues, L Peña… - Proceedings of the ACM …, 2020 - dl.acm.org
Automation of fixpoint reasoning has been extensively studied for various mathematical
structures, logical formalisms, and computational domains, resulting in specialized fixpoint …
structures, logical formalisms, and computational domains, resulting in specialized fixpoint …
A Decision Procedure for Guarded Separation Logic: Complete Entailment Checking for Separation Logic with Inductive Definitions
We develop a doubly-exponential decision procedure for the satisfiability problem of
guarded separation logic--a novel fragment of separation logic featuring user-supplied …
guarded separation logic--a novel fragment of separation logic featuring user-supplied …
Compositional satisfiability solving in separation logic
QL Le - … , Model Checking, and Abstract Interpretation: 22nd …, 2021 - Springer
We introduce a novel decision procedure to the satisfiability problem in array separation
logic combined with general inductively defined predicates and arithmetic. Our proposal …
logic combined with general inductively defined predicates and arithmetic. Our proposal …
Model-guided synthesis of inductive lemmas for FOL with least fixpoints
Recursively defined linked data structures embedded in a pointer-based heap and their
properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+ …
properties are naturally expressed in pure first-order logic with least fixpoint definitions (FO+ …
Dynamic separation logic
FS de Boer, HDA Hiep… - Electronic Notes in …, 2023 - entics.episciences.org
This paper introduces a dynamic logic extension of separation logic. The assertion language
of separation logic is extended with modalities for the five types of the basic instructions of …
of separation logic is extended with modalities for the five types of the basic instructions of …
A learning-based approach to synthesizing invariants for incomplete verification engines
We propose a framework for synthesizing inductive invariants for incomplete verification
engines, which soundly reduce logical problems in undecidable theories to decidable …
engines, which soundly reduce logical problems in undecidable theories to decidable …