Meanings of Model Checking
From MaRDI portal
Publication:5187832
DOI10.1007/978-3-642-11512-7_15zbMath1274.68183OpenAlexW1489544963MaRDI QIDQ5187832
Publication date: 9 March 2010
Published in: Concurrency, Compositionality, and Correctness (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11512-7_15
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Uses Software
Cites Work
- Proceedings of the 7th international workshop on parallel and distributed methods in verification (PDMC 2008), Budapest, Hungary, March 29, 2008.
- The temporal logic of branching time
- Results on the propositional \(\mu\)-calculus
- Program invariants as fixedpoints
- A logic for reasoning about time and reliability
- Modalities for model checking: Branching time logic strikes back
- A lattice-theoretical fixpoint theorem and its applications
- A deterministic subexponential algorithm for solving parity games
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- “Sometimes” and “not never” revisited
- Binary Decision Diagrams
- An axiomatic basis for computer programming
- Tools and Algorithms for the Construction and Analysis of Systems
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Tools and Algorithms for the Construction and Analysis of Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Meanings of Model Checking