Logo des Repositoriums
 

A formal correctness proof for code generation from SSA form in Isabelle/HOL

dc.contributor.authorBlech, Jan Olaf
dc.contributor.authorGlesner, Sabine
dc.contributor.editorDadam, Peter
dc.contributor.editorReichert, Manfred
dc.date.accessioned2019-10-11T11:37:51Z
dc.date.available2019-10-11T11:37:51Z
dc.date.issued2004
dc.description.abstractOptimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is necessary to prove their correctness. We develop a formal semantics for static single assignment (SSA) intermediate representations and prove formally within the Isabelle/HOL theorem prover that a relatively simple form of code generation preserves the semantics of the transformed programs in SSA form. This formal correctness proof does not only verify the correctness of a certain class of code generation algorithms but also gives us a sufficient, easily checkable correctness criterion characterizing correct compilation results obtained from implementations (compilers) of these algorithms.en
dc.identifier.isbn3-88579-380-6
dc.identifier.pissn1617-5468
dc.identifier.urihttps://dl.gi.de/handle/20.500.12116/28810
dc.language.isoen
dc.publisherGesellschaft für Informatik e.V.
dc.relation.ispartofInformatik 2004, Informatik verbindet, Band 2, Beiträge der 34. Jahrestagung der Gesellschaft für Informatik e.V. (GI)
dc.relation.ispartofseriesLecture Notes in Informatics (LNI) - Proceedings, Volume P-51
dc.titleA formal correctness proof for code generation from SSA form in Isabelle/HOLen
dc.typeText/Conference Paper
gi.citation.endPage458
gi.citation.publisherPlaceBonn
gi.citation.startPage449
gi.conference.date20.-24. September 2004
gi.conference.locationUlm
gi.conference.sessiontitleRegular Research Papers

Dateien

Originalbündel
1 - 1 von 1
Lade...
Vorschaubild
Name:
GI-Proceedings.51-94.pdf
Größe:
357.05 KB
Format:
Adobe Portable Document Format