A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking
Abstract elided by the publisher.
Related papers
- Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions CAV 2001
- Dynamic Programming for Symbolic Boolean Realizability and Synthesis CAV 2024
- Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking CAV 2000
- Deciding Boolean Separation Logic via Small Models TACAS 2024
- ZDD Boolean Synthesis TACAS 2022
- Unbounded, Fully Symbolic Model Checking of Timed Automata using Boolean Methods CAV 2003
- Symbolic Simulation, Model Checking and Abstraction with Partially Ordered Boolean Functional Vectors CAV 2004
- Symbolic Model Checking without BDDs TACAS 1999