Sciweavers

479 search results - page 6 / 96
» Sound and Complete Type Inference for a Systems Programming ...
Sort
View
102
Voted
ESOP
2007
Springer
15 years 8 months ago
Dependent Types for Low-Level Programming
In this paper, we describe the key principles of a dependent type system for low-level imperative languages. The major contributions of this work are (1) a sound type system that c...
Jeremy Condit, Matthew Harren, Zachary R. Anderson...
129
Voted
PLDI
2003
ACM
15 years 7 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
111
Voted
CORR
2010
Springer
152views Education» more  CORR 2010»
15 years 2 months ago
A Non-Null Annotation Inferencer for Java Bytecode
We present a non-null annotations inferencer for the Java bytecode language. We previously proposed an analysis to infer non-null annotations and proved it soundness and completen...
Laurent Hubert
128
Voted
APLAS
2010
ACM
15 years 2 months ago
A Certified Implementation of ML with Structural Polymorphism
Abstract. The type system of Objective Caml has many unique features, which make ensuring the correctness of its implementation difficult. One of these features is structurally pol...
Jacques Garrigue
115
Voted
ESOP
2006
Springer
15 years 6 months ago
Type-Based Amortised Heap-Space Analysis
Abstract. We present a type system for a compile-time analysis of heapspace requirements of Java style object-oriented programs with explicit deallocation. Our system is based on a...
Martin Hofmann, Steffen Jost