Holzer, A., Kroening, D., Schallhart, C., Tautschnig, M., & Veith, H. (2012). Proving Reachability Using FShell. In C. Flanagan & B. König (Eds.), Tools and Algorithms for the Construction and Analysis of Systems (pp. 538–541). Springer. https://doi.org/10.1007/978-3-642-28756-5_43
Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
-
Veranstaltungszeitraum:
24-Mär-2012 - 1-Apr-2012
-
Veranstaltungsort:
Tallinn, Estland, EU
-
Umfang:
4
-
Verlag:
Springer, LNCS 7214
-
Verlag:
Springer, Berlin, Heidelberg
-
Peer Reviewed:
Ja
-
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.
