Concolic testing heap-manipulating programs

DOI10.1007/978-3-030-30942-8_27zbMATH Open1539.68072MaRDI QIDQ6535965FDOQ6535965

Authors: Long H. Pham, Quang Loc Le, Quoc-Sang Phan, Jun Sun 

Publication date: 14 March 2024

Recommendations

• An SMT-based concolic testing tool for logic programs
• Abstraction-driven concolic testing
• Concolic testing in CLP
• A CLP heap solver for test case generation
• Enhancing symbolic execution of heap-based programs with separation logic for test input generation

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Logic in computer science (03B70)

Cites Work

• BI as an assertion language for mutable data structures
• Symbolic execution and program testing
• Automated verification of shape, size and bag properties via user-defined predicates in separation logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Compositional shape analysis by means of bi-abduction
• Satisfiability modulo heap-based programs
• 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

This page was built for publication: Concolic testing heap-manipulating programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535965)