Complete SAT-Based Model Checking for Context-Free Processes
From MaRDI portal
Publication:3510785
DOI10.1007/978-3-540-75596-8_6zbMath1141.68471OpenAlexW1596705621MaRDI QIDQ3510785
Publication date: 3 July 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_6
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- The theory of ends, pushdown automata, and second-order logic
- Pushdown processes: Games and model-checking
- Computer Aided Verification
- Theory and Applications of Satisfiability Testing
- Formal Techniques for Networked and Distributed Systems - FORTE 2005
- Computer Aided Verification
- Reachability analysis of pushdown automata: Application to model-checking
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Complete SAT-Based Model Checking for Context-Free Processes
