FAST: acceleration from theory to practice

Sébastien Bardin, Alain Finkel, Jérôme Leroux, Laure Petrucci
2008 International Journal on Software Tools for Technology Transfer (STTT)  
Fast is a tool for the analysis of systems manipulating unbounded integer variables. We check safety properties by computing the reachability set of the system under study. Even if this reachability set is not necessarily recursive, we use innovative techniques, namely symbolic representation, acceleration and circuit selection, to increase convergence. Fast has proved to perform very well on case studies. This paper describes the tool, from the underlying theory to the architecture choices.
more » ... ally, Fast capabilities are compared with those of other tools. A range of case studies from the literature is investigated. ⋆ This paper is mainly based on results presented at CAV 2003, TACAS 2004 and ATVA 2005. The transition relation − → is a binary relation over the set of configurations. A configuration c ′ is reachable from a configuration c if and only if (c, c ′ ) ∈− → * , where − → * denotes the reflexive and transitive closure of − →. The set of configurations reachable from the configuration c 0 is called the reachability set from c 0 . Safety properties are expressed in terms of "safe reachable configurations". They are the most commonly encountered properties in practice, and allow specification of important properties such as the absence of deadlock, capacity overflow and division by zero. The class of counter systems, where variables range over integers, appears to be interesting. From a practical point of view, these systems allow the modeling of, for example, communication protocols [18] , multi-thread programs or programs with pointers [8] . From a theoretical view, many well-known classes appear to be encompassed by counter systems, like Minsky machines, Petri nets extended with reset/ inhibitor/ transfer arcs [32, 39] , reversal-bounded counter machines [47] and broadcast protocols [33, 34] .
doi:10.1007/s10009-008-0064-3 fatcat:3msu4gglojfpbignampzd2fz44