Finding real bugs in big programs with incorrectness logic
Incorrectness Logic (IL) has recently been advanced as a logical theory for compositionally
proving the presence of bugs—dual to Hoare Logic, which is used to compositionally prove …
proving the presence of bugs—dual to Hoare Logic, which is used to compositionally prove …
Symbolic execution and recent applications to worst-case execution, load testing, and security analysis
Symbolic execution is a systematic program analysis technique which executes programs
on symbolic inputs, representing multiple concrete inputs, and represents the program …
on symbolic inputs, representing multiple concrete inputs, and represents the program …
[PDF][PDF] Symbolic execution and recent applications to worst-case execution, load testing and security analysis
Symbolic execution is a systematic program analysis technique which executes programs
on symbolic inputs, representing multiple concrete inputs, and represents the program …
on symbolic inputs, representing multiple concrete inputs, and represents the program …
Graph-based seed object synthesis for search-based unit testing
Search-based software testing (SBST) generates tests using search algorithms guided by
measurements gauging how far a test case is away from exercising a coverage goal. The …
measurements gauging how far a test case is away from exercising a coverage goal. The …
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 …
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 …
Testing heap-based programs with Java StarFinder
We present Java StarFinder (JSF), a tool for automated test case generation and error
detection for Java programs having inputs in the form of complex heap-manipulating data …
detection for Java programs having inputs in the form of complex heap-manipulating data …
Concolic testing heap-manipulating programs
Concolic testing is a test generation technique which works effectively by integrating random
testing generation and symbolic execution. Existing concolic testing engines focus on …
testing generation and symbolic execution. Existing concolic testing engines focus on …
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 …
Free objects in constraint-logic object-oriented programming
JC Dageförde, H Winkelmann, H Kuchen - Proceedings of the 23rd …, 2021 - dl.acm.org
Constraint-logic object-oriented programming facilitates the integrated development of
business software that occasionally solves constraint-logic problems or makes other use of …
business software that occasionally solves constraint-logic problems or makes other use of …