research
∙
10/02/2022
An Efficient Cyclic Entailment Procedure in a Fragment of Separation Logic
An efficient entailment proof system is essential to compositional verif...
share
research
∙
09/19/2022
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. ...
research
∙
06/18/2020
Bi-Abduction for Shapes with Ordered Data
Shape analysis is of great importance for the verification of the correc...
research
∙
08/27/2019
Compositional Verification of Heap-Manipulating Programs through Property-Guided Learning
Analyzing and verifying heap-manipulating programs automatically is chal...
research
∙
07/12/2019
Concolic Testing Heap-Manipulating Programs
Concolic testing is a test generation technique which works effectively ...
research
∙
05/23/2018
Decidable Logics Combining Word Equations, Regular Expressions and Length Constraints
In this work, we consider the satisfiability problem in a logic that com...
research
∙
12/16/2017
Enhancing Symbolic Execution of Heap-based Programs with Separation Logic for Test Input Generation
Symbolic execution is a well established method for test input generatio...
research
∙
10/17/2017