Fairness Modulo Theory: A New Approach to LTL Software Model Checking [chapter]

Daniel Dietsch, Matthias Heizmann, Vincent Langenfeld, Andreas Podelski
2015 Lecture Notes in Computer Science  
The construction of a proof for unsatisfiability is less costly than the construction of a ranking function. We present a new approach to LTL software model checking (i.e., to statically analyze a program and verify a temporal property from the full class of LTL including general liveness properties) which aims at exploiting this fact. The idea is to select finite prefixes of a path and check these for infeasibility before considering the full infinite path. We have implemented a tool which
more » ... nstrates the practical potential of the approach. In particular, the tool can verify several benchmark programs for a liveness property just with finite prefixes (and thus without the construction of a single ranking function).
doi:10.1007/978-3-319-21690-4_4 fatcat:fbisyn7olve6rj76nbcfdtgjzu