Making predicate abstraction efficient: how to eliminate redundant predicates

DOI10.1007/B11831MaRDI QIDQ5900674zbMATH OpenOpenAlexFDO

Authors Edmund Clarke, Orna Grumberg, Muralidhar Talupur, Dong Wang

Publication date 20 April 2010

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

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

Mathematics Subject Classification ID

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

Recommendations

• Predicate abstraction with minimum predicates
• Using Counterexample Analysis to Minimize the Number of Predicates for Predicate Abstraction
• Tools and Algorithms for the Construction and Analysis of Systems
• Predicate abstraction of ANSI-C programs using SAT
• A symbolic approach to predicate abstraction.

Cited in

(2)

• Partial predicate abstraction and counter-example guided refinement
• Combining Predicate Abstraction with Fixpoint Approximations

This page was built for publication: Making predicate abstraction efficient: how to eliminate redundant predicates

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