scientific article; zbMATH DE number 5542982
From MaRDI portal
Publication:3620436
Recommendations
- Evaluating and certifying QBFs: a comparison of state-of-the-art tools
- Formal methods for NFA equivalence: QBFs, witness extraction, and encoding verification
- QMaude: quantitative specification and verification in rewriting logic
- A First Step Towards a Unified Proof Checker for QBF
- \(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers
- Verification of partial designs using incremental QBF
- Validating QBF Validity in HOL4
- Verification of SMT systems with quantifiers
Cited in
(37)- Understanding cutting planes for QBFs
- Lower bound techniques for QBF expansion
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- Building strategies into QBF proofs
- Solution validation and extraction for QBF preprocessing
- Long-distance Q-resolution with dependency schemes
- A game characterisation of tree-like Q-resolution size
- Unified QBF certification and its applications
- A QBF-based formalization of abstract argumentation semantics
- Solving QBF with counterexample guided refinement
- A game characterisation of tree-like Q-resolution size
- Q-resolution with generalized axioms
- 2QBF: challenges and solutions
- Long distance Q-resolution with dependency schemes
- Advances in Quantitative Verification for Ubiquitous Computing
- The QBF Gallery: behind the scenes
- Compressing BMC encodings with QBF
- Validating QBF Validity in HOL4
- Proving Valid Quantified Boolean Formulas in HOL Light
- scientific article; zbMATH DE number 7228403 (Why is no real title available?)
- Feasible interpolation for QBF resolution calculi
- Bounded synthesis for Petri games
- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API
- A Unified Framework for Certificate and Compilation for QBF
- Fault Localization and Correction with QBF
- A Compact Representation for Syntactic Dependencies in QBFs
- Verification of partial designs using incremental QBF
- Efficient reduction of nondeterministic automata with application to language inclusion testing
- scientific article; zbMATH DE number 7029312 (Why is no real title available?)
- Size, cost and capacity: a semantic technique for hard random QBFs
- CAQE and QuAbS: Abstraction Based QBF Solvers
- Building strategies into QBF proofs
- scientific article; zbMATH DE number 7278086 (Why is no real title available?)
- Efficiently representing existential dependency sets for expansion-based QBF solvers
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Solving Quantified Boolean Formulas with Circuit Observability Don’t Cares
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3620436)
