Explaining Counterexamples with Giant-Step Assertion Checking

Identifying the cause of a proof failure during deductive verification of programs is hard: it may be due to an incorrectness in the program, an incompleteness in the program annotations, or an incompleteness of the prover. The changes needed to resolve a proof failure depend on its category, but th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2021-08
Hauptverfasser:	Becker, Benedikt, Cláudio Belo Lourenço, Marché, Claude
Format:	Artikel
Sprache:	eng
Schlagworte:	Annotations Computer programming Computer Science - Logic in Computer Science Computer Science - Programming Languages Failure Program verification (computers) Semantics Solvers
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!