Skip to Main content Skip to Navigation
New interface
Conference papers

Tactic Program-based Testing and Bounded Verification in Isabelle/HOL

Abstract : Program-based test-generation methods (also called "white-box" tests) are conventionally described in terms of a control flow graph and the generation of path conditions along the paths in this graph. In this paper, we present an alternative formalization based on state-exception monads that allows for direct derivations of path conditions from program presentations in them; the approach lends itself both for program-based testing procedures-designed to meet classical coverage criteria-and bounded verification. Our formalization is implemented in the Isabelle/HOL interactive theorem prover, where symbolic execution can be processed through tactics implementing test-generation strategies for various coverage criteria. The resulting environment is a major step towards testing support for the development of invariants and post-conditions in C verification environments similar to Isabelle/AutoCorres.
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download
Contributor : Chantal Keller Connect in order to contact the contributor
Submitted on : Monday, October 1, 2018 - 3:01:16 PM
Last modification on : Monday, October 17, 2022 - 1:39:33 PM
Long-term archiving on: : Wednesday, January 2, 2019 - 2:48:07 PM


Files produced by the author(s)


  • HAL Id : hal-01884960, version 1


Chantal Keller. Tactic Program-based Testing and Bounded Verification in Isabelle/HOL. Tests and Proofs, Jun 2018, Toulouse, France. ⟨hal-01884960⟩



Record views


Files downloads