Concolic testing heap-manipulating programs
From MaRDI portal
Publication:6535965
DOI10.1007/978-3-030-30942-8_27zbMATH Open1539.68072MaRDI QIDQ6535965
Jun Sun, Long H. Pham, Quoc-Sang Phan, Quang Loc Le
Publication date: 14 March 2024
Logic in computer science (03B70) Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Automated verification of shape, size and bag properties via user-defined predicates in separation logic
- A decidable fragment in separation logic with inductive predicates and arithmetic
- Frame inference for inductive entailment proofs in separation logic
- Exact Heap Summaries for Symbolic Execution
- Symbolic execution and program testing
- Satisfiability Modulo Heap-Based Programs
- BI as an assertion language for mutable data structures
- Compositional Shape Analysis by Means of Bi-Abduction
This page was built for publication: Concolic testing heap-manipulating programs