Proving reachability using FSHELL

Authors:
Andreas Holzer;Daniel Kroening;Christian Schallhart;Michael Tautschnig;Helmut Veith
Affiliations:
Vienna University of Technology, Austria;University of Oxford, United Kingdom;University of Oxford, United Kingdom;University of Oxford, United Kingdom;Vienna University of Technology, Austria
Venue:
TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2012

Citing 4
Cited 1

FShell: Systematic Test Case Generation for Dynamic Analysis and Measurement

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Query-Driven Program Testing

VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
How did you specify your test suite

Proceedings of the IEEE/ACM international conference on Automated software engineering
An introduction to test specification in FQL

HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing

Competition on software verification

TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

FShell is an automated white-box test-input generator for C programs, computing test data with respect to user-specified code coverage criteria. The pillars of FShell are the declarative specification language FQL (FShell Query Language), an efficient back end for computing test data, and a mathematical framework to reason about coverage criteria. To solve the reachability problem posed in SV-COMP we specify coverage of ERROR labels. As back end, FShell uses bounded model checking, building upon components of CBMC and leveraging the power of SAT solvers for efficient enumeration of a full test suite.