Sciweavers

9 search results - page 1 / 2
» A Formal Correctness Proof for Code Generation from SSA Form...
Sort
View
GI
2004
Springer
13 years 10 months ago
A Formal Correctness Proof for Code Generation from SSA Form in Isabelle/HOL
Abstract: Optimizations in compilers are the most error-prone phases in the compilation process. Since correct compilers are a vital precondition for software correctness, it is ne...
Jan Olaf Blech, Sabine Glesner
TPHOL
2008
IEEE
13 years 11 months ago
Imperative Functional Programming with Isabelle/HOL
We introduce a lightweight approach for reasoning about programs involving imperative data structures using the proof assistant Isabelle/HOL. It is based on shallow embedding of pr...
Lukas Bulwahn, Alexander Krauss, Florian Haftmann,...
ITP
2010
179views Mathematics» more  ITP 2010»
13 years 8 months ago
The Isabelle Collections Framework
The Isabelle Collections Framework (ICF) provides a unified framework for using verified collection data structures in Isabelle/HOL formalizations and generating efficient functi...
Peter Lammich, Andreas Lochbihler
ESOP
2010
Springer
14 years 1 months ago
Verifying a Compiler for Java Threads
Abstract. A verified compiler is an integral part of every security infrastructure. Previous work has come up with formal semantics for sequential and concurrent variants of Java a...
Andreas Lochbihler
ESOP
2005
Springer
13 years 10 months ago
Asserting Bytecode Safety
Abstract. We instantiate an Isabelle/HOL framework for proof carrying code to Jinja bytecode, a downsized variant of Java bytecode featuring objects, inheritance, method calls and ...
Martin Wildmoser, Tobias Nipkow