Complete SAT-Based Model Checking for Context-Free Processes
From MaRDI portal
Recommendations
Cites work
- A BDD-based model checker for recursive programs
- Bebop: A symbolic model checker for Boolean programs
- Efficient algorithms for model checking pushdown systems
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- scientific article; zbMATH DE number 446840 (Why is no real title available?)
- scientific article; zbMATH DE number 751138 (Why is no real title available?)
- scientific article; zbMATH DE number 1860681 (Why is no real title available?)
- Interpolation and SAT-based model checking.
- On the transition graphs of automata and grammars
- Proving more properties with bounded model checking
- Pushdown processes: Games and model-checking
- Reachability analysis of pushdown automata: Application to model-checking
- The theory of ends, pushdown automata, and second-order logic
- Theory and Applications of Satisfiability Testing
Cited in
(6)- Analyzing Context-Free Grammars Using an Incremental SAT Solver
- COMPLETE SAT-BASED MODEL CHECKING FOR CONTEXT-FREE PROCESSES
- Demand-driven model checking for context-free processes
- Local model checking for context-free processes
- scientific article; zbMATH DE number 751138 (Why is no real title available?)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
This page was built for publication: Complete SAT-Based Model Checking for Context-Free Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510785)