scientific article; zbMATH DE number 1798189
From MaRDI portal
Publication:4553262
zbMATH Open0996.68578MaRDI QIDQ4553262FDOQ4553262
Recommendations
- scientific article; zbMATH DE number 2087634
- Bounded model checking using satisfiability solving
- scientific article; zbMATH DE number 1629965
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- scientific article; zbMATH DE number 5605058
Cited in
(19)- Unrestricted vs restricted cut in a tableau method for Boolean circuits
- Backdoors to satisfaction
- The state of SAT
- A taxonomy of exact methods for partial Max-SAT
- 3-Valued Circuit SAT for STE with Automatic Refinement
- Quantifier reordering for QBF
- An automata-theoretic approach to infinite-state systems
- Complete Boolean satisfiability solving algorithms based on local search
- SAT-solving in practice, with a tutorial example from supervisory control
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- A transformation-based approach to implication of GSTE assertion graphs
- Scalable error detection using Boolean satisfiability
- Soundness of \(\mathcal{Q}\)-resolution with dependency schemes
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- A semantic condition for data independence and applications in hardware verification
- SCIP: solving constraint integer programs
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- Backdoors to q-Horn
- Benchmarking a model checker for algorithmic improvements and tuning for performance
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 Q4553262)
