QBF Encoding of Temporal Properties and QBF-Based Verification
From MaRDI portal
Publication:3192192
Recommendations
- QBF-Based Symbolic Model Checking for Knowledge and Time
- Publication:4945224
- scientific article; zbMATH DE number 1512710
- On the expressivity and complexity of quantitative branching-time temporal logics
- Verifying quantitative temporal properties of procedural programs
- Theoretical Aspects of Computing – ICTAC 2005
- scientific article; zbMATH DE number 2084388
- Temporal logics for reasoning about quantum systems
- scientific article; zbMATH DE number 2087443
Cited in
(7)- CAQE and QuAbS: Abstraction Based QBF Solvers
- QBF-Based Symbolic Model Checking for Knowledge and Time
- Linear templates of ACTL formulas with an application to SAT-based verification
- First order Büchi automata and their application to verification of LTL specifications
- Compressing BMC encodings with QBF
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
- CTL model checking in deduction modulo
This page was built for publication: QBF Encoding of Temporal Properties and QBF-Based Verification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3192192)