Paper Info
Title
Checking Properties Described by State Machines: On Synergy of Instrumentation, Slicing, and Symbolic Execution.
Abstract
We introduce a novel technique for checking properties described by finite state machines. The technique is based on a synergy of three well-known methods: instrumentation, program slicing, and symbolic execution. More precisely, we instrument a given program with a code that tracks runs of state machines representing various properties. Next we slice the program to reduce its size without affecting runs of state machines. And then we symbolically execute the sliced program to find real violations of the checked properties, i.e. real bugs. Depending on the kind of symbolic execution, the technique can be applied as a stand-alone bug finding technique, or to weed out some false positives from an output of another bug-finding tool. We provide several examples demonstrating the practical applicability of our technique.
Year
DOI
Venue
2012
10.1007/978-3-642-32469-7_14
Lecture Notes in Computer Science
Field
DocType
Volume
Program slicing,Instrumentation (computer programming),Programming language,Computer science,Slicing,Real-time computing,Finite-state machine,Symbolic execution,Code (cryptography),False positive paradox,Instrumentation
Conference
7437
ISSN
Citations 
PageRank 
0302-9743
6
0.55
References 
Authors
23
3
Name
Order
Citations
PageRank
Jiri Slaby1204.04
Jan Strejcek29913.83
Marek Trtík3275.06