SAT-based counterexample guided abstraction refinement

DOI10.1007/3-540-46017-9_1MaRDI QIDQ4738460zbMATH OpenFDO

Authors Edmund Clarke

Publication date 11 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2318/23180001.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• SAT based abstraction-refinement using ILP and machine learning techniques
• Computer Aided Verification
• A satisfiability-based approach to abstraction refinement in model checking
• Counterexample-guided abstraction refinement
• Counterexample-guided abstraction refinement for symbolic model checking

Cited in

(8)

• Efficient strategies for CEGAR-based model checking
• A novel approach to verifying context free properties of programs
• A satisfiability-based approach to abstraction refinement in model checking
• Counterexample-guided abstraction refinement for symbolic model checking
• A Probabilistic Learning Approach for Counterexample Guided Abstraction Refinement
• SAT based abstraction-refinement using ILP and machine learning techniques
• Computer Aided Verification
• Tools and Algorithms for the Construction and Analysis of Systems

Describes a project that uses

Uses Software

• lpSolve
• Chaff
• NuSMV

This page was built for publication: SAT-based counterexample guided abstraction refinement

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