The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Reasoning about infinite computations
Information and Computation
Testing language containment for &ohgr;-automata using BDDs
Information and Computation
High-density reachability analysis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
Forward model checking techniques oriented to buggy designs
ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Hybrid techniques for fast functional simulation
DAC '98 Proceedings of the 35th annual Design Automation Conference
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Program Verification
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Safety for Branching Time Semantics
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
FoCs: Automatic Generation of Simulation Checkers from Formal Specifications
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits
CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
On-the-Fly Verification with Stubborn Sets
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
On Combining Formal and Informal Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Deadlock Checking Using Net Unfoldings
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Mona & Fido: The Logic-Automaton Connection in Practice
CSL '97 Selected Papers from the11th International Workshop on Computer Science Logic
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Using Partial Orders for the Efficient Verification of Deadlock Freedom and Safety Properties
CAV '91 Proceedings of the 3rd International Workshop on Computer Aided Verification
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Checking formal specifications under simulation
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
STeP: The Stanford Temporal Prover
STeP: The Stanford Temporal Prover
Synthesis of communicating processes from temporal logic specifications
Synthesis of communicating processes from temporal logic specifications
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
omega-Regular Languages Are Testable with a Constant Number of Queries
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Using Canonical Representations of Solutions to Speed Up Infinite-State Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Abstraction refinement by controllability and cooperativeness analysis
Proceedings of the 41st annual Design Automation Conference
From complementation to certification
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Efficient LTL compilation for SAT-based model checking
ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Disjunctive image computation for software verification
ACM Transactions on Design Automation of Electronic Systems (TODAES)
GSTE is partitioned model checking
Formal Methods in System Design
Simulation-based verification using Temporally Attributed Boolean Logic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Falsification of LTL Safety Properties in Hybrid Systems
TACAS '09 Proceedings of the 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009,
A Framework for Inherent Vacuity
HVC '08 Proceedings of the 4th International Haifa Verification Conference on Hardware and Software: Verification and Testing
Prognosis of ω-Languages for the Diagnosis of *-Languages: A Topological Perspective
Discrete Event Dynamic Systems
SAT-based Induction for Temporal Safety Properties
Electronic Notes in Theoretical Computer Science (ENTCS)
Liveness Checking as Safety Checking for Infinite State Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Electronic Notes in Theoretical Computer Science (ENTCS)
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Combining abstraction refinement and SAT-based model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Automatic abstraction without counterexamples
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Multiple-counterexample guided iterative abstraction refinement: an industrial evaluation
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Efficient model checking of safety properties
SPIN'03 Proceedings of the 10th international conference on Model checking software
Boolean abstraction for temporal logic satisfiability
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Integrating verification, testing, and learning for cryptographic protocols
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Deep random search for efficient model checking of timed automata
Proceedings of the 13th Monterey conference on Composition of embedded systems: scientific and industrial issues
Model checking-based genetic programming with an application to mutual exclusion
TACAS'08/ETAPS'08 Proceedings of the Theory and practice of software, 14th international conference on Tools and algorithms for the construction and analysis of systems
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
Proceedings of the IEEE/ACM international conference on Automated software engineering
Alternation removal in büchi automata
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
MCGP: a software synthesis tool based on model checking and genetic programming
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
Optimized temporal monitors for SystemC
RV'10 Proceedings of the First international conference on Runtime verification
Model checking hierarchical probabilistic systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Pessoa 2.0: a controller synthesis tool for cyber-physical systems
Proceedings of the 14th international conference on Hybrid systems: computation and control
Unbeast: symbolic bounded synthesis
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Runtime Verification for LTL and TLTL
ACM Transactions on Software Engineering and Methodology (TOSEM)
Streamable fragments of forward XPath
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
On locally checkable properties
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Monitoring of real-time properties
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Experimental evaluation of classical automata constructions
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Simple is better: efficient bounded model checking for past LTL
VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Deriving implementation-level policies for usage control enforcement
Proceedings of the second ACM conference on Data and Application Security and Privacy
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Incremental and complete bounded model checking for full PLTL
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
An analysis of SAT-based model checking techniques in an industrial environment
CHARME'05 Proceedings of the 13 IFIP WG 10.5 international conference on Correct Hardware Design and Verification Methods
On the construction of fine automata for safety properties
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Deterministic dynamic monitors for linear-time assertions
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Language-guided controller synthesis for discrete-time linear systems
Proceedings of the 15th ACM international conference on Hybrid Systems: Computation and Control
RV'11 Proceedings of the Second international conference on Runtime verification
Tightening the exchange rates between automata
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Optimized temporal monitors for SystemC
Formal Methods in System Design
Specification-guided controller synthesis for linear systems and safe linear-time temporal logic
Proceedings of the 16th international conference on Hybrid systems: computation and control
Temporal logic model predictive control for discrete-time systems
Proceedings of the 16th international conference on Hybrid systems: computation and control
Iterative temporal motion planning for hybrid systems in partially unknown environments
Proceedings of the 16th international conference on Hybrid systems: computation and control
Early nested word automata for XPath query answering on XML streams
CIAA'13 Proceedings of the 18th international conference on Implementation and Application of Automata
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Deterministic compilation of temporal safety properties in explicit state model checking
HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing
Hi-index | 0.00 |
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed region. Proof rules for the verification of safety properties have been developed in the proof-based approach to verification, making verification of safety properties simpler than verification of general properties. In this paper we consider model checking of safety properties. A computation that violates a general linear property reaches a bad cycle, which witnesses the violation of the property. Accordingly, current methods and tools for model checking of linear properties are based on a search for bad cycles. A symbolic implementation of such a search involves the calculation of a nested fixed-point expression over the system's state space, and is often infeasible. Every computation that violates a safety property has a finite prefix along which the property is violated. We use this fact in order to base model checking of safety properties on a search for finite bad prefixes. Such a search can be performed using a simple forward or backward symbolic reachability check. A naive methodology that is based on such a search involves a construction of an automaton (or a tableau) that is doubly exponential in the property. We present an analysis of safety properties that enables us to prevent the doubly-exponential blow up and to use the same automaton used for model checking of general properties, replacing the search for bad cycles by a search for bad prefixes.