The Rapid Software Verification Framework

We present the Rapid framework for automatic software verification by applying first-order reasoning in trace logic. Rapid establishes partial correctness of programs with loops and arrays by inferring invariants necessary to prove program correctness using a saturation-based automated theorem prover. Rapid can heuristically generate trace lemmas, common program properties that guide inductive invariant reasoning. Alternatively, Rapid can exploit nascent support for induction in modern provers to fully automate inductive reasoning without the use of trace lemmas. In addition, Rapid can be used as an invariant generation engine, supplying other verification tools with quantified loop invariants necessary for proving partial program correctness.