Counterexample-guided focus

Andreas Podelski, Thomas Wies

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The automated inference of quantified invariants is considered one of the next challenges in software verification. The question of the right precision-efficiency tradeoff for the corresponding program analyses here boils down to the question of the right treatment of disjunction below and above the universal quantifier. In the closely related setting of shape analysis one uses the focus operator in order to adapt the treatment of disjunction (and thus the efficiency-precision tradeoff) to the individual program statement. One promising research direction is to design parameterized versions of the focus operator which allow the user to fine-tune the focus operator not only to the individual program statements but also to the specific verification task. We carry this research direction one step further. We fine-tune the focus operator to each individual step of the analysis (for a specific verification task). This fine-tuning must be done automatically. Our idea is to use counterexamples for this purpose. We realize this idea in a tool that automatically infers quantified invariants for the verification of a variety of heap-manipulating programs.

Original languageEnglish (US)
Title of host publicationPOPL'10 - Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Pages249-260
Number of pages12
DOIs
StatePublished - Apr 20 2010
Event37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'10 - Madrid, Spain
Duration: Jan 17 2010Jan 23 2010

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Other

Other37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL'10
CountrySpain
CityMadrid
Period1/17/101/23/10

Keywords

  • Abstraction refinement
  • Data structures
  • Predicate abstraction
  • Quantified invariants
  • Shape analysis

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Counterexample-guided focus'. Together they form a unique fingerprint.

  • Cite this

    Podelski, A., & Wies, T. (2010). Counterexample-guided focus. In POPL'10 - Proceedings of the 37th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (pp. 249-260). (Conference Record of the Annual ACM Symposium on Principles of Programming Languages). https://doi.org/10.1145/1706299.1706330