(Enter summary)
Abstract: A method combining data abstraction, model checking and theorem proving is presented. It provides a semi-automatic, formal framework for proving arbitrary linear time temporal logic properties of infinite state reactive systems. The paper contains a complete case study to prove safety and liveness of an implementation of a scheduler for the readers/writers problem which uses unbounded queues and sets. We argue that the proposed framework could be automated to a very large extent making this... (Update)
Context of citations to this paper: More
.... Verification by means of abstract transition systems can also be applied when the concrete system is infinite state, as shown in [DF95,Gra99,MN95,HS96] However, in all these approaches the verifier has either to fully provide the abstract system, and only the check...
.... Furthermore, some nontrivial case studies have been performed concerning the verification of abstractions in theorem provers [DF95, HS96] Interestingly, the experiences from these studies are quite different. In [HS96] the soundness proof of the abstraction required...
Cited by: More
Model Checking Concurrent Systems with Unbounded Integer.. - Bultan, Gerber, Pugh (1998)
(Correct)
Predicate Abstraction - Das (2003)
(Correct)
Model Checking for Open Systems: A Compositional Approach to.. - Andrade-Gomez (2001)
(Correct)
Active bibliography (related documents): More All
0.5: Multiway Decision Graphs for Automated Hardware.. - Corella, Zhou, Song.. (1996)
(Correct)
0.5: Formal Methods: State of the Art and Future Directions - Clarke, Wing (1996)
(Correct)
0.1: A Verification Environment for I/O Automata - Müller (1998)
(Correct)
Similar documents based on text: More All
0.2: Modular Verification for Shared-Variable Concurrent Programs - Dingel (1996)
(Correct)
0.1: Symbolic Verification of Sequential Circuits Synthesized.. - Filkorn, Payer, Warkentin (1992)
(Correct)
0.1: Symbolic Model Checking of Infinite State Systems Using.. - Bultan, Gerber, Pugh
(Correct)
Related documents from co-citation: More All
14: Abstract interpretation: a unified lattice model for static analysis of programs.. (context) - Cousot, Cousot - 1977
14: Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic S.. (context) - Clarke, Emerson et al. - 1986
13: Property preserving abstractions for the verification of concurrent systems
- Loiseaux, Graf et al. - 1995
BibTeX entry: (Update)
J. Dingel and T. Filkorn. Model checking for infinite state systems using data abstraction, assumption-commitment style reasoning and theorem proving. Technical Report ZFE BT SE 1-?, Siemens AG, Corporate Research and Development, Munich, 1994. Draft. http://citeseer.ist.psu.edu/dingel95model.html More
@inproceedings{ dingel95model,
author = "{J. Dingel} and {T. Filkorn}",
title = "Model checking for infinite state systems using data abstraction, Assumption-commitment Style Reasoning and Theorem Proving",
booktitle = "Proceedings of the 7th International Conference On Computer Aided Verification",
volume = "939",
publisher = "Springer Verlag",
address = "Liege, Belgium",
editor = "{P. Wolper}",
pages = "54--69",
year = "1995",
url = "citeseer.ist.psu.edu/dingel95model.html" }
Citations (may not include all citations):
1933
Communication and Concurrency (context) - Milner - 1989
1097
Automatic verification of finite-state concurrent systems us.. (context) - Clarke, Emerson et al. - 1986
779
Symbolic model checking: 10 20 states and beyond
- Burch, Clarke et al. - 1992
231
Model checking and abstraction
- Clarke, Grumberg et al. - 1992
122
Synthesis of synchronization skeletons for branching time te.. (context) - Clarke, Emerson - 1981
63
Elf: A meta-language for deductive systems (context) - Pfenning - 1994
40
A tool for symbolic program verification and abstraction
- Graf, Loiseaux - 1993
39
Model checking for infinite state systems using data abstrac..
- Dingel, Filkorn - 1994
38
and Compositional Verification (context) - Long, Abstraction - 1993
33
Verification of a distributed cache memory by using abstract.. (context) - Graf - 1994
19
Combining model checking and theorem proving to verify paral.. (context) - Hungar - 1993
2
Symbolic verification of sequential circuits synthesized wit..
- Filkorn, Payer et al. - 1992
2
Technical Report ZFE BT SE 1-SVE (context) - Filkorn, Schneider et al. - 1994
1
Synthesis of synchronization skeletons for branching time te.. (context) - Quielle, Sifakis - 1981
1
A Guide to Seduct (context) - Stroetmann, Nielsen - 1994
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.cmu.edu/People/jurgend/cv.html): More
Modular Verification for Shared-Variable Concurrent Programs - Dingel (1996)
(Correct)
Reasoning About Implicit Invocation - Dingel, Garlan, Jha, Notkin (1998)
(Correct)
Modal Characterization of Weak Bisimulation for Higher-order .. - Baldamus, Dingel (1996)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC