scientific article; zbMATH DE number 2102695
From MaRDI portal
zbMath1046.68578MaRDI QIDQ4817533
Yunshan Zhu, Richard Raimi, Armin Biere, Edmund M. Clarke
Publication date: 24 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Latticed \(k\)-induction with an application to probabilistic programs, Spanning the spectrum from safety to liveness, Evaluating CDCL Variable Scoring Schemes, SAT-solving in practice, with a tutorial example from supervisory control, Simulating circuit-level simplifications on CNF, Unnamed Item, Solving satisfiability problems with preferences, HySAT: An efficient proof engine for bounded model checking of hybrid systems, Optimization Modulo Theories with Linear Rational Costs, Mining definitions in Kissat with Kittens, Generating Extended Resolution Proofs with a BDD-Based SAT Solver, Equivalent literal propagation in the DLL procedure, A satisfiability procedure for quantified Boolean formulae, Towards a notion of unsatisfiable and unrealizable cores for LTL, SAT-solving in CSP trace refinement, An explicit transition system construction approach to LTL satisfiability checking, Formal verification based on Boolean expression diagrams, SAT-LP-IIS joint-directed path-oriented bounded reachability analysis of linear hybrid automata, Model Checking Data Flows in Concurrent Network Updates, Model-based safety assessment of a triple modular generator with xSAP, Solving μ-Calculus Parity Games by Symbolic Planning, SCIP: solving constraint integer programs, Access Nets: Modeling Access to Physical Spaces, Linear Completeness Thresholds for Bounded Model Checking, Bounded Model Checking with Parametric Data Structures, Compressing BMC Encodings with QBF, Implementing Efficient All Solutions SAT Solvers
