Sciweavers

56 search results - page 4 / 12
» Formalizing and verifying semantic type soundness of a simpl...
Sort
View
POPL
2004
ACM
14 years 6 months ago
Simple relational correctness proofs for static analyses and program transformations
We show how some classical static analyses for imperative programs, and the optimizing transformations which they enable, may be expressed and proved correct using elementary logi...
Nick Benton
AOSD
2007
ACM
13 years 10 months ago
Tribe: a simple virtual class calculus
Beginning with BETA, a range of programming language mechanisms such as virtual classes (class-valued attributes of objects) have been developed to allow inheritance in the presen...
Dave Clarke, Sophia Drossopoulou, James Noble, Tob...
GI
2004
Springer
13 years 11 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
POPL
2004
ACM
14 years 6 months ago
Principal typings for Java-like languages
The contribution of the paper is twofold. First, we define a general notion of type system equipped with an entailment relation between type environments; this generalisation serv...
Davide Ancona, Elena Zucca
ESOP
2006
Springer
13 years 9 months ago
Coinductive Big-Step Operational Semantics
Using a call-by-value functional language as an example, this article illustrates the use of coinductive definitions and proofs in big-step operational semantics, enabling it to d...
Xavier Leroy