Component-wise incremental LTL model checking
From MaRDI portal
Recommendations
- Saturation-based incremental LTL model checking with inductive proofs
- Tools and Algorithms for the Construction and Analysis of Systems
- An explicit transition system construction approach to LTL satisfiability checking
- Tools and Algorithms for the Construction and Analysis of Systems
- MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Cites work
- scientific article; zbMATH DE number 1670775 (Why is no real title available?)
- scientific article; zbMATH DE number 1701768 (Why is no real title available?)
- scientific article; zbMATH DE number 3714896 (Why is no real title available?)
- scientific article; zbMATH DE number 52331 (Why is no real title available?)
- scientific article; zbMATH DE number 177519 (Why is no real title available?)
- scientific article; zbMATH DE number 1069483 (Why is no real title available?)
- scientific article; zbMATH DE number 1956594 (Why is no real title available?)
- scientific article; zbMATH DE number 1979545 (Why is no real title available?)
- scientific article; zbMATH DE number 1796123 (Why is no real title available?)
- scientific article; zbMATH DE number 1903365 (Why is no real title available?)
- scientific article; zbMATH DE number 3212004 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Automated Technology for Verification and Analysis
- Compositional SCC analysis for language emptiness
- Computer Aided Verification
- Depth-First Search and Linear Graph Algorithms
- Formal Techniques for Networked and Distributed Systems – FORTE 2004
- Graph-Based Algorithms for Boolean Function Manipulation
- Improving Static Variable Orders Via Invariants
- Interpolation and SAT-based model checking.
- Lazy abstraction
- MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
- Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
- Saturation-based incremental LTL model checking with inductive proofs
- Self-Loop Aggregation Product — A New Hybrid Approach to On-the-Fly LTL Model Checking
- Symbolic CTL model checking of asynchronous systems using constrained saturation
- Symbolic model checking: \(10^{20}\) states and beyond
- Tools and Algorithms for the Construction and Analysis of Systems
Cited in
(6)- Saturation-based incremental LTL model checking with inductive proofs
- Bounded rational search for on-the-fly model checking of LTL properties
- Saturation Enhanced with Conditional Locality: Application to Petri Nets
- Compositional model checking with incremental counter-example construction
- Tools and Algorithms for the Construction and Analysis of Systems
- Incremental Language Inclusion Checking for Networks of Timed Automata
This page was built for publication: Component-wise incremental LTL model checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q510894)
