scientific article; zbMATH DE number 1903357
From MaRDI portal
zbMath1010.68509MaRDI QIDQ4804900
Publication date: 1 May 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2404/24040250.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
\(\mathsf{QCTL}\) model-checking with \(\mathsf{QBF}\) solvers, A symbolic decision procedure for symbolic alternating finite automata, Algorithms for Solving Satisfiability Problems with Qualitative Preferences, Propositional SAT Solving, SAT-Based Model Checking, A SAT-based approach to unbounded model checking for alternating-time temporal epistemic logic, Breaking symmetries in graph search with canonizing sets, Computing the Ramsey number \(R(4,3,3)\) using abstraction and symmetry breaking, Solving satisfiability problems with preferences, Optimization techniques for Craig interpolant compaction in unbounded model checking, Improvements to Hybrid Incremental SAT Algorithms, Balanced covering arrays: A classification of covering arrays and packing arrays via exact methods, Bisimulation conversion and verification procedure for goal-based control systems, Disjunctive closures for knowledge compilation, Quantifier elimination by dependency sequents, Automatic symbolic compositional verification by learning assumptions, Property-directed incremental invariant generation, Efficient SAT-based bounded model checking for software verification, SAT and IP based algorithms for magic labeling including a complete search for total magic labelings, How we designed winning algorithms for abstract argumentation and which insight we attained, SAT-Based Model Checking without Unrolling, Linear Completeness Thresholds for Bounded Model Checking, Partitioned PLTL model-checking for refined transition systems, Interpolant Learning and Reuse in SAT-Based Model Checking
Uses Software
