Counter-example based predicate discovery in predicate abstraction

DOI10.1007/3-540-36126-X_2MaRDI QIDQ4427892zbMATH OpenFDO

Authors Satyaki Das, David L. Dill

Publication date 14 September 2003

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/2517/25170019.htm

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07)

Recommendations

• Counter-example guided predicate abstraction of hybrid systems
• Counterexample-guided predicate abstraction of hybrid systems
• Computer Aided Verification
• Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction
• A symbolic approach to predicate abstraction.

Cited in

(6)

• Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
• Verifying Reference Counting Implementations
• Computer Aided Verification
• Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols
• Formal methods for mobile ad hoc networks: a survey
• Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)

Describes a project that uses

Uses Software

• SLAM
• InVeSt

This page was built for publication: Counter-example based predicate discovery in predicate abstraction

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