Instrumenting a weakest precondition calculus for counterexample generation

• Published in: Journal of logical and algebraic methods in programming Vol. 99; pp. 97 - 113
• Main Authors: Dailler, Sylvain, Hauzar, David, Marché, Claude, Moy, Yannick
• Format: Journal Article
• Language: English
• Published: Elsevier 01.10.2018
• Subjects: Computer Science; Logic in Computer Science; Software Engineering; Deductive Program Verification; Satisfiability Modulo Theories; Counterexamples; Weakest Precondition Calculus

A major issue in the activity of deductive program verification is to understand why automated provers fail to discharge a proof obligation. To help the user understand the problem and decide what needs to be fixed in the code or the specification, it is essential to provide means to investigate suc...