scientific article; zbMATH DE number 1796153

zbMath0991.68637MaRDI QIDQ4551177

Enrico Giunchiglia, Fady Copty, Gila Kamhi, Ranan Fraer, Limor Fix

Publication date: 4 September 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2102/21020436

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Verification of SpecC using predicate abstraction ⋮ Bounded Synthesis for Petri Games ⋮ SAT-solving in practice, with a tutorial example from supervisory control ⋮ Unnamed Item ⋮ Limitations of Restricted Branching in Clause Learning ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Unnamed Item ⋮ An Automata-Theoretic Approach to Infinite-State Systems ⋮ Limitations of restricted branching in clause learning ⋮ From Philosophical to Industrial Logics ⋮ From Monadic Logic to PSL ⋮ Falsification of LTL Safety Properties in Hybrid Systems ⋮ Computing properties of stable configurations of thermodynamic binding networks ⋮ Hybrid systems: From verification to falsification by combining motion planning and discrete search ⋮ Automated generation of hybrid automata for multi-rigid-body mechanical systems and its application to the falsification of safety properties ⋮ Bounded Model Checking with Parametric Data Structures ⋮ Interpolant Learning and Reuse in SAT-Based Model Checking ⋮ SAT-based planning in complex domains: Concurrency, constraints and nondeterminism

Uses Software

• SATO