LTL Satisfiability Checking
Authors:
- 30 August 2007
- book chapter
- Published by Springer Nature
- p. 149-167
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- Tarjan’s Algorithm Makes On-the-Fly LTL Verification More EfficientLecture Notes in Computer Science, 2004
- An Efficiently Checkable, Proof-Based Formulation of Vacuity in Model CheckingLecture Notes in Computer Science, 2004
- Vacuity detection in temporal model checkingInternational Journal on Software Tools for Technology Transfer, 2003
- From bidirectionality to alternationTheoretical Computer Science, 2003
- Simple and Efficient Translation from LTL Formulas to Büchi AutomataElectronic Notes in Theoretical Computer Science, 2002
- NUSMV: a new symbolic model checkerInternational Journal on Software Tools for Technology Transfer, 2000
- The model checker SPINIEEE Transactions on Software Engineering, 1997
- Reasoning about Infinite ComputationsInformation and Computation, 1994
- Memory-efficient algorithms for the verification of temporal propertiesFormal Methods in System Design, 1992
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992