Test Data Generation for Programs with Quantified First-Order Logic Specifications

Abstract : We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic execution, theorem proving, satisfiability solving, and usage of specifications and program annotations such as loop invariants. These techniques are suitable for testing of small programs, such as, e.g., implementations of algorithms, that have to be tested extremely well. In such scenarios test data is generated from test data constraints which are first-order logic formulas. These constraints are constructed from path conditions, specifications, and program annotation describing program paths that are hard to be tested randomly. A challenge is, however, to solve quantified formulas. The presented algorithm is capable of solving quantified formulas that state-of-the-art satisfiability modulo theory (SMT) solvers cannot solve. The algorithm is integrated in the formal verification and test generation tool KeY .
Document type :
Conference papers
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-01055252
Contributor : Hal Ifip <>
Submitted on : Tuesday, August 12, 2014 - 9:11:35 AM
Last modification on : Friday, November 17, 2017 - 11:56:01 AM
Long-term archiving on : Wednesday, November 26, 2014 - 10:42:06 PM

File

paper_TML2L.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Citation

Christoph D. Gladisch. Test Data Generation for Programs with Quantified First-Order Logic Specifications. 22nd IFIP WG 6.1 International Conference on Testing Software and Systems (ICTSS), Nov 2010, Natal, Brazil. pp.158-173, ⟨10.1007/978-3-642-16573-3_12⟩. ⟨hal-01055252⟩

Share

Metrics

Record views

125

Files downloads

124