Tracing the Origins of Verification Conditions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 1996

Tracing the Origins of Verification Conditions


The typical program verification system is a batch tool that accepts as input a program annotated with Floyd-Hoare assertions, performs syntactic and semantic analysis on it, and generates a list of verification conditions that is subsequently submitted to a theorem prover. When a verification condition cannot be proved, this may be due to an error in the program or an inconsistency in the annotations. Unfortunately, it is very difficult to relate a failing proof attempt to a particular piece of code or assertion. We propose a solution to this problem using the technique of origin tracking.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-2840.pdf (159.37 Ko) Télécharger le fichier

Dates and versions

inria-00073850 , version 1 (24-05-2006)


  • HAL Id : inria-00073850 , version 1


Ranan Fraer. Tracing the Origins of Verification Conditions. RR-2840, INRIA. 1996. ⟨inria-00073850⟩
19 View
117 Download


Gmail Facebook Twitter LinkedIn More