Auto/Autograph

Abstract

We describe the Auto and Autograph tools for verification and analysis of concurrent systems in their more recent developments. Auto is dedicated to a philosophy of verification by reduction, based on automata morphisms and quotients. Autograph provides a graphical layout on which to display both terms and informations on terms, back and forth to Auto. We stress the openness aspects of both systems and their interface formats to the outside world. We see this as a contribution to the ever growing collaborative trends between similar tools, mostly under the pressure of national or European Esprit projects.

Formal methods

“…In the second approach, the specification is given as an automaton; then the system, also modeled as an automaton, is compared to the specification to determine whether its behavior conforms to that of the specification. Different notions of conformance have been explored, including language inclusion [Har'El and Kurshan 1990;Kurshan 1994a], refinement orderings [Cleaveland et al 1993;Roscoe 1994], and observational equivalence [Cleaveland et al 1993;Fernandez et al 1996;Roy and de Simone 1990]. Vardi and Wolper [1986] showed how the temporal-logic model-checking problem could be recast in terms of automata, thus relating these two approaches.…”

SAT-Based Verification of LTL Formulas

“…Therefore much effort has been put into the research aiming at minimizing models. The methods include application of cone of influence reduction [1], semantic minimization [19], state information compression [10], abstraction techniques [6,13], partial order reductions [21,22], symmetry reductions [9], compositional techniques for splitting verification tasks [8,1], case-based partition techniques [14,23], and BDD based symbolic techniques for compactly representing transition relations and system states [5,4].…”

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

“…Therefore much effort has been put into the research aiming at minimizing models. The methods include semantic minimization [17], abstraction techniques [11], partial order reductions [18], symmetry reductions [8], compositional techniques for splitting verification tasks [3], case-based partition techniques [13,21], and so on.…”