Predicate Abstraction of ANSI-C Programs Using SAT

@article{Clarke2004PredicateAO,
  title={Predicate Abstraction of ANSI-C Programs Using SAT},
  author={Edmund M. Clarke and Daniel Kroening and Natasha Sharygina and Karen Yorav},
  journal={Formal Methods in System Design},
  year={2004},
  volume={25},
  pages={105-127}
}
Predicate abstraction is a major method for verification of software. However, the generation of the abstract Boolean program from the set of predicates and the original program suffers from an exponential number of theorem prover calls as well as from soundness issues. This paper presents a novel technique that uses an efficient SAT solver for generating the abstract transition relation of ANSI-C programs. The SATbased approach computes a more precise and safe abstraction compared to existing… CONTINUE READING
Highly Cited
This paper has 207 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 136 extracted citations

208 Citations

0102030'06'09'12'15'18
Citations per Year
Semantic Scholar estimates that this publication has 208 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

A satisfiability tester for quantified boolean formulae

  • Y. Zhu
  • Journal of Discrete Applied Mathematics ( DAM )
  • 2003

A satisfiability tester for quantified boolean formulae.Journal of Discrete Applied Mathematics (DAM

  • D. Plaisted, A. Biere, Y. Zhu
  • 2003
1 Excerpt

Similar Papers

Loading similar papers…