Automating Verification of Loops by Parallelization

Abstract

Loops are a major bottleneck in formal software verification, because they generally require user interaction: typically, induction hypotheses or invariants must be found or modified by hand. This involves expert knowledge of the underlying calculus and proof engine. We show that one can replace interactive proof techniques, such as induction, with… (More)
DOI: 10.1007/11916277_23

Topics

  • Presentations referencing similar topics