Theory and Applications of Satisfiability Testing

DOI10.1007/B95238zbMATH Open1204.68129DBLPconf/sat/2003OpenAlexW2494235144MaRDI QIDQ5325852FDOQ5325852

Authors: Muralidhar Talupur, Helmut Veith, Dong Wang, Edmund Clarke 

Publication date: 24 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95238

Recommendations

• scientific article; zbMATH DE number 1670775
• A symbolic approach to predicate abstraction.
• A satisfiability-based approach to abstraction refinement in model checking
• scientific article; zbMATH DE number 1979542
• Counterexample-guided abstraction refinement for symbolic model checking

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Specification and verification (program logics, model checking, etc.) (68Q60)

Cited In (11)

• Automated Technology for Verification and Analysis
• Extracting unsatisfiable cores for LTL via temporal resolution
• Towards a notion of unsatisfiable and unrealizable cores for LTL
• Enhancing unsatisfiable cores for LTL with information on temporal relevance
• An abstraction algorithm for the verification of level-sensitive latch-based netlists
• Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction
• Temporalization of Probabilistic Propositional Logic
• Partial predicate abstraction and counter-example guided refinement
• Verification of SpecC using predicate abstraction
• \textsf{SATGraf}: visualizing the evolution of SAT formula structure in solvers
• Accelerating predicate abstraction by minimum unsatisfiable cores extraction

Uses Software

• Chaff

This page was built for publication: Theory and Applications of Satisfiability Testing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5325852)