Efficient on-the-fly model checking for CTL
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 818, 388-397
- https://doi.org/10.1109/lics.1995.523273
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- The concurrency workbenchACM Transactions on Programming Languages and Systems, 1993
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- CTL* and ECTL* as fragments of the modal μ-calculusLecture Notes in Computer Science, 1992
- On-line model-checking for finite linear temporal logic specificationsLecture Notes in Computer Science, 1990
- Modalities for model checking: branching time logic strikes backScience of Computer Programming, 1987
- Automatic Verification of Sequential Circuits Using Temporal LogicIEEE Transactions on Computers, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- Checking that finite state concurrent programs satisfy their linear specificationPublished by Association for Computing Machinery (ACM) ,1985
- Deciding full branching time logicInformation and Control, 1984