Download:
|
by A. Finkel, G. Sutre, Ecole Normale, Suprieure Cachan, Alain Finkel, S. Purushothaman Iyer, S. Purushothaman Iyer
http://www.lsv.ens-cachan.fr/Publis/RAPPORTS_LSV/rr-lsv-2000-6.rr.ps
Add To MetaCart
Abstract:
Formal methods based on symbolic representations have been found to be very effective. In the case of infinite state systems, there has been a great deal of interest in accelerations-- a technique for characterizing the result of iterating an execution sequence an arbitrary number of times, in a sound, but not necessarily complete, way. We propose the use of abstractions as a general framework to design accelerations. We investigate SemiLinear Regular Expressions (SLREs) as symbolic representations for FIFO automata. In particular, we show that (a) SLREs are easy to manipulate, (b) SLREs form the core of known FIFO symbolic representations, and (c) SLREs are sufficient to represent the effect of arbitrary iteration of a loop for FIFO automata with one channel.
Citations
|
1282
|
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
– Cousot, Cousot
- 1977
|
|
373
|
Symbolic model checking: 10 states and beyond
– Burch, Clarke, et al.
- 1992
|
|
357
|
Formal Languages
– Salomaa
- 1973
|
|
156
|
On communicating finite-state machines
– Brand, Zafiropulo
- 1983
|
|
115
|
Well-structured transition systems everywhere
– Schnoebelen
|
|
114
|
Derivatives of regular expressions
– Brzozowski
- 1964
|
|
77
|
Regular model checking
– Bouajjani, Jonsson, et al.
- 2000
|
|
63
|
Multiple counters automata, safety analysis and Presburger arithmetic
– Comon, Jurski
- 1998
|
|
55
|
General decidability theorems for infinite-state systems
– Abdulla, Cerans, et al.
- 1996
|
|
54
|
Symbolic Reachability Analysis of FIFOChannel Systems with Nonregular Sets of Configurations
– Bouajjani, Habermehl
- 1997
|
|
51
|
The power of qdds
– Boigelot, Godefroid, et al.
- 1997
|
|
40
|
On Model Checking for Non-Deterministic Infinite-State Systems
– Emerson, Namjoshi
- 1998
|
|
38
|
Timed Automata and the Theory of Real Numbers
– Comon, Jurski
- 1999
|
|
35
|
Symbolic verification of lossy channel systems: application to the bounded retransmission protocol
– Abdulla, Annichini, et al.
- 1999
|
|
32
|
Protocol Description and Analysis based on a State Transition Model with Channel Expressions
– Pachl
- 1987
|
|
31
|
On the equivalence, containment, and covering problems for the regular and context-free languages
– Hunt, Rosenkrantz, et al.
- 1976
|
|
28
|
A classification of symbolic transition systems
– Henzinger, Majumdar
- 2000
|
|
25
|
Data Flow Analysis of Communicating Finite State Machines
– Peng, Purushothaman
- 1991
|
|
22
|
Reduction and covering of infinite reachability trees
– Finkel
- 1990
|
|
22
|
Testing for unboundedness of fifo channels
– J'eron
- 1993
|
|
21
|
A decompositional approach for computing least fixed-points of Datalog programs with Z-counters
– Fribourg, Olsen
- 1997
|
|
19
|
Decidability of reachability problems for classes of two counters automata. STACS’2000
– Finkel, Sutre
- 2000
|
|
18
|
Flatness is not a weakness
– Comon, Cortier
- 2000
|
|
14
|
A survey on the decidability questions for classes of fifo nets
– Finkel, Rosier
- 1988
|
|
14
|
Proving safety properties of infinite state systems by compilation into Presburger arithmetic
– Fribourg, Olsén
- 1997
|
|
12
|
On deadlock detection in systems of communicating finite state machines
– Gouda, Gurari, et al.
- 1987
|
|
5
|
An introduction to FIFO nets-monogeneous nets: a subclass of FIFO nets
– Memmi, Finkel
- 1985
|
|
2
|
ec e. V erification, analyse et approximations symboliques des automates communicants. Th ese ENS de Cachan
– C
- 1998
|
|
2
|
e. A minimal symbolic coverability graph for infinite-state comunicating automata
– Finkel, Marc
- 1996
|
