Verification by Augmented Abstraction: The Automata–Theoretic View
Open Access
- 1 June 2001
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 62 (4) , 668-690
- https://doi.org/10.1006/jcss.2000.1744
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Symbolic model checking: 1020 States and beyondPublished by Elsevier ,2004
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Property preserving abstractions for the verification of concurrent systemsFormal Methods in System Design, 1995
- Reasoning about Infinite ComputationsInformation and Computation, 1994
- Completing the temporal pictureTheoretical Computer Science, 1991
- The μ-calculus as an assertion-language for fairness argumentsInformation and Computation, 1989
- On verifying that a concurrent program satisfies a nondeterministic specificationInformation Processing Letters, 1989
- Temporal logic can be more expressiveInformation and Control, 1983
- A new solution of Dijkstra's concurrent programming problemCommunications of the ACM, 1974
- Theories of automata on ω-tapes: A simplified approachJournal of Computer and System Sciences, 1974