Correct Programs without Proof? On Checker-Based Program Verification

Goerigk, Wolfgang; Gaul, Thilo; Zimmermann, Wolf

doi:10.1007/978-3-7091-6355-9_8

Cited by 16 publications

(3 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Our work shares some motivations with the work described in [8], which proposes to build "checker routines" into the program code of compilers and to verify the correctness of the checker routines rather than the correctness of the original algorithm.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Mechanized result verification: an industrial application

Traverso

Bertoli

2000

STTT

View full text Add to dashboard Cite

We present part of an industrial project where mechanized theorem proving is used for the validation of a translator which generates safety critical software. In this project, the mechanized proof is decomposed in two parts: one is done "online", at each run of the translator, by a custom prover which checks automatically that the result of each translation meets some verification conditions; the other is done "offline", once for all, interactively with a general purpose prover; the offline proof shows that the verification conditions checked by the online prover are sufficient to guarantee the correctness of each translation. The provably correct verification conditions can thus be seen as specifications for the online prover. This approach is called mechanized result verification. This paper describes the project requirements and explains the motivations to formal validation by mechanized result verification, provides an overview of the formalization of the specifications for the online prover and discusses in detail some issues we have addressed in the mechanized offline proof.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Applying a different naming scheme (e.g., using strings) would be immaterial -since a bijection can be established between a variable name and its memory address anyway 8. We use the suffix "-p" within the name of Boolean functions.…”

mentioning

confidence: 99%

Mechanized result verification: an industrial application

Traverso

Bertoli

2000

STTT

View full text Add to dashboard Cite

show abstract

“…4 [25,16]). In der Compiler-Verifikation sind außerdem Techniken der Programmprüfung einsetzbar, die den Beweisaufwand deutlich reduzieren können, [15,33]. Produktivitätssteigerungen sind in der Zukunft vor allem von der Wiederverwendung von Spezifikationen, Beweisen und bereits verifizierten Komponenten zu erwarten.…”

Section: Beweisunterstützungunclassified