Sciweavers

249 search results - page 9 / 50
» Principals in Programming Languages: A Syntactic Proof Techn...
Sort
View
IFM
2010
Springer
183views Formal Methods» more  IFM 2010»
14 years 7 months ago
Certified Absence of Dangling Pointers in a Language with Explicit Deallocation
Safe is a first-order eager functional language with facilities for programmer controlled destruction and copying of data structures. It provides also regions, i.e. disjoint parts...
Javier de Dios, Manuel Montenegro, Ricardo Pe&ntil...
FP
1995
156views Formal Methods» more  FP 1995»
15 years 1 months ago
Type Reconstruction for SCI
We present a type reconstruction algorithm for SCIR 10], a type system for a language with syntactic control of interference. SCIR guarantees that terms of passive type do not cau...
Howard Huang, Uday S. Reddy
SAIG
2000
Springer
15 years 1 months ago
Compiling Embedded Languages
Abstract. Functional languages are particularly well-suited to the implementation of interpreters for domain-specific embedded languages (DSELs). We describe an implemented techniq...
Conal Elliott, Sigbjorn Finne, Oege de Moor
189
Voted
POPL
2004
ACM
15 years 10 months ago
Abstractions from proofs
stractions from Proofs Ranjit Jhala1 Kenneth L. McMillan2 1 UC San Diego 2 Cadence Berkeley Laboratories We present a technique for using infeasible program paths to automatically ...
Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar,...
ESOP
2007
Springer
15 years 3 months ago
Small Witnesses for Abstract Interpretation-Based Proofs
tnesses for Abstract Interpretation-based Proofs Fr´ed´eric Besson, Thomas Jensen, and Tiphaine Turpin IRISA/{Inria, CNRS, Universit´e de Rennes 1} Campus de Beaulieu, F-35042 R...
Frédéric Besson, Thomas P. Jensen, T...