Combining symmetry reduction and under-approximation for symbolic model checking
From MaRDI portal
Publication:816210
DOI10.1007/s10703-005-2246-xzbMath1085.68086OpenAlexW2040904498MaRDI QIDQ816210
Publication date: 20 February 2006
Published in: Formal Methods in System Design (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10703-005-2246-x
Related Items (2)
Context-aware counter abstraction ⋮ Efficient approximate verification of B and Z models via symmetry markers
Uses Software
Cites Work
- Characterizing finite Kripke structures in propositional temporal logic
- Symbolic model checking: \(10^{20}\) states and beyond
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Graph-Based Algorithms for Boolean Function Manipulation
- “Sometimes” and “not never” revisited
- Verifying temporal properties without temporal logic
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combining symmetry reduction and under-approximation for symbolic model checking