Enhancing approximations for regular reachability analysis

Authors:
Aloïs Dreyfus;Pierre-Cyrille Héam;Olga Kouchnarenko
Affiliations:
FEMTO-ST CNRS 6174, University of Franche-Comté & Inria/CASSIS, France;FEMTO-ST CNRS 6174, University of Franche-Comté & Inria/CASSIS, France;FEMTO-ST CNRS 6174, University of Franche-Comté & Inria/CASSIS, France
Venue:
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
Year:
2013

Citing 15
Cited 0

Transitive Closures of Regular Relations for Verifying Infinite-State Systems

TACAS '00 Proceedings of the 6th International Conference on Tools and Algorithms for Construction and Analysis of Systems: Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS 2000
Symbolic Model Checking with Rich ssertional Languages

CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Regular Model Checking

CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Iterating Transducers

CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Regular Tree Model Checking

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Principles of Model Checking (Representation and Mind Series)

Principles of Model Checking (Representation and Mind Series)
Finer Is Better: Abstraction Refinement for Rewriting Approximations

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
When Does Partial Commutative Closure Preserve Regularity?

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Program specialization for verifying infinite state systems: an experimental evaluation

LOPSTR'10 Proceedings of the 20th international conference on Logic-based program synthesis and transformation
Antichain algorithms for finite automata

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Domain-specific regular acceleration

International Journal on Software Tools for Technology Transfer (STTT) - Regular Model Checking
Widening techniques for regular tree model checking

International Journal on Software Tools for Technology Transfer (STTT) - Regular Model Checking
Extrapolating (omega-)regular model checking

International Journal on Software Tools for Technology Transfer (STTT) - Regular Model Checking
Lattice automata: a representation for languages on infinite alphabets, and some applications to verification

SAS'07 Proceedings of the 14th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata representing reachable sets by merging some of their states with respect to simple syntactic criteria, or a combination of such criteria. The second approximation mechanism consists in manipulating an auxiliary automaton when applying a transducer representing the transition relation to an automaton encoding the initial states. In addition, for the second mechanism we propose a new approach to refine the approximations depending on a property of interest. The proposals are evaluated on examples of mutual exclusion protocols.