BDD-Based Symbolic Model Checking
From MaRDI portal
Publication:3176366
DOI10.1007/978-3-319-10575-8_8zbMATH Open1392.68239OpenAlexW2803843036MaRDI QIDQ3176366FDOQ3176366
Publication date: 20 July 2018
Published in: Handbook of Model Checking (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-10575-8_8
Data structures (68P05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Graph-Based Algorithms for Boolean Function Manipulation
- Symbolic model checking: \(10^{20}\) states and beyond
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Binary Decision Diagrams
- Zero-suppressed BDDs and their applications
- Interpolants and Symbolic Model Checking
- Linear temporal logic symbolic model checking
- Finiteness is mu-ineffable
Cited In (13)
- Formal verification of a Java component using the RESOLVE framework
- Title not available (Why is that?)
- Automatically finding the right probabilities in Bayesian networks
- Title not available (Why is that?)
- Model Checking Procedural Programs
- Theorem Proving in Higher Order Logics
- Combining Model Checking and Deduction
- Binary Decision Diagrams
- Abstraction and Abstraction Refinement
- Generating BDDs for symbolic model checking in CCS
- Satisfiability Modulo Theories
- Directed Model Checking for B: An Evaluation and New Techniques
- Title not available (Why is that?)
Uses Software
This page was built for publication: BDD-Based Symbolic Model Checking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176366)