scientific article; zbMATH DE number 1798189
From MaRDI portal
zbMath0996.68578MaRDI QIDQ4553262
Per Bjesse, Abdel Mokkedem, Tim Leonard
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computing methodologies and applications (68U99) Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical problems of computer architecture (68M07)
Related Items
Quantifier reordering for QBF, SAT-solving in practice, with a tutorial example from supervisory control, Backdoors to Satisfaction, The state of SAT, Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005), A transformation-based approach to implication of GSTE assertion graphs, Soundness of \(\mathcal{Q}\)-resolution with dependency schemes, 3-Valued Circuit SAT for STE with Automatic Refinement, A taxonomy of exact methods for partial Max-SAT, Complete Boolean satisfiability solving algorithms based on local search, Benchmarking a model checker for algorithmic improvements and tuning for performance, Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors., An Automata-Theoretic Approach to Infinite-State Systems, A formal methods approach to predicting new features of the eukaryotic vesicle traffic system, SCIP: solving constraint integer programs, A Semantic Condition for Data Independence and Applications in Hardware Verification, Unrestricted vs restricted cut in a tableau method for Boolean circuits, Backdoors to q-Horn
Uses Software
