CCured: Type-safe retrofitting of legacy code
In this paper we propose a scheme that combines type inference and run-time checking to
make existing C programs type safe. We describe the CCured type system, which extends …
make existing C programs type safe. We describe the CCured type system, which extends …
The software model checker Blast Applications to software engineering
B last is an automatic verification tool for checking temporal safety properties of C programs.
Given a C program and a temporal safety property, B last either statically proves that the …
Given a C program and a temporal safety property, B last either statically proves that the …
CCured: Type-safe retrofitting of legacy software
GC Necula, J Condit, M Harren, S McPeak… - ACM Transactions on …, 2005 - dl.acm.org
This article describes CCured, a program transformation system that adds type safety
guarantees to existing C programs. CCured attempts to verify statically that memory errors …
guarantees to existing C programs. CCured attempts to verify statically that memory errors …
Refinement-based context-sensitive points-to analysis for Java
We present a scalable and precise context-sensitive points-to analysis with three key
properties:(1) filtering out of unrealizable paths,(2) a context-sensitive heap abstraction, and …
properties:(1) filtering out of unrealizable paths,(2) a context-sensitive heap abstraction, and …
CCured in the real world
J Condit, M Harren, S McPeak, GC Necula… - ACM SIGPLAN …, 2003 - dl.acm.org
CCured is a program transformation system that adds memory safety guarantees to C
programs by verifying statically that memory errors cannot occur and by inserting run-time …
programs by verifying statically that memory errors cannot occur and by inserting run-time …
Dynamic ty**: Syntax and proof theory
F Henglein - Science of Computer Programming, 1994 - Elsevier
We present the dynamically typed λ-calculus, an extension of the statically typed λ-calculus
with a special type Dyn and explicit dynamic type coercions corresponding to run-time type …
with a special type Dyn and explicit dynamic type coercions corresponding to run-time type …
Introduction to set constraint-based program analysis
A Aiken - Science of Computer Programming, 1999 - Elsevier
This paper given an introduction to using set constraints to specify program analyses.
Several standard analysis problems are formulated using set constraints, which serves both …
Several standard analysis problems are formulated using set constraints, which serves both …
Better static memory management: Improving region-based analysis of higher-order languages
Static memory management replaces runtime garbage collection with compile-time
annotations that make all memory allocation and deallocation explicit in a program. We …
annotations that make all memory allocation and deallocation explicit in a program. We …
A practical soft type system for Scheme
AK Wright, R Cartwright - ACM Transactions on Programming …, 1997 - dl.acm.org
A soft type system infers types for the procedures and data structures of dynamically typed
programs. Like conventional static types, soft types express program invariants and thereby …
programs. Like conventional static types, soft types express program invariants and thereby …
[PDF][PDF] Compiling with types
JG Morrisett - 1995 - reports-archive.adm.cs.cmu.edu
Compilers for monomorphic languages, such as C and Pascal, take advantage of types to
determine data representations, alignment, calling conventions, and register selection …
determine data representations, alignment, calling conventions, and register selection …