Download:
|
by Rob Gerth, Orna Grumberg
In: Proc. WAVe’00. (2000) 1–8
http://www.cs.technion.ac.il/users/orna/WAVE00-ranking-function.ps
Add To MetaCart
Abstract:
The duality between invariance and progress is fundamental in proof techniques for the verication of programs. Proving invariance requires the construction of invariants, while progress proofs hinge on the identication of appropriate ranking functions. With the recent interest in automated verication techniques, the topic of automatic generation of invariants is facing a revival of interest. In [14] it has been shown that temporal properties of reactive systems can be proven via nitary abstractions if those abstractions comprise a notion of acceptance conditions, like!-automata. Based on this, that paper concludes that there is a strong need for devising eective heuristics for generating such conditions. In this note, we address this issue. We suggest a simple heuristic in the spirit of, and combining well with, the popular predicate abstraction approach to the automatic generation and renement of invariants. The presentation is non-technical and guided by examples. 1
Citations
|
1371
|
The Temporal Logic of Reactive and Concurrent Systems
– Manna, Pnueli
- 1992
|
|
923
|
E.A.: Temporal and modal logic
– Emerson
- 1990
|
|
558
|
Model checking and abstraction
– Clarke, Grumberg, et al.
- 1994
|
|
428
|
Construction of abstract state graphs with PVS
– Graf, Saidi
- 1997
|
|
255
|
Abstract interpretation and application to logic programs
– Cousot, Cousot
- 1992
|
|
94
|
Powerful Techniques for the Automatic Generation of Invariants
– Bensalem, Lakhnech, et al.
- 1996
|
|
78
|
Automatic veri of concurrent systems using temporal logic speci
– Clarke, Emerson, et al.
- 1986
|
|
59
|
Automatic generation of invariants and intermediate assertions. Theoretical Computer Science
– Browne, Manna
- 1997
|
|
24
|
Counterexample-guided abstraction re
– Clarke, Grumberg, et al.
- 2000
|
|
24
|
Temporal model checking under generalized fairness constraints
– Emerson, Lei
- 1985
|
|
19
|
Computer-Aided Veri of Coordinating Processes
– Kurshan
- 1994
|
|
16
|
Abstract Interpretation and Partition Re for Model Checking
– Dams
- 1996
|
|
9
|
Cousot and Radhia Cousot. Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation
– Patrick
- 1992
|
|
5
|
InVeSt: A tool for the veri of invariants
– Bensalem, Lakhnech, et al.
- 1998
|
|
3
|
Veri by augmented abstraction
– Kesten, Pnueli
- 2000
|
|
1
|
Orna Grumberg. Generation of reduced models for checking fragments of CTL
– Dams, Gerth
- 1993
|
