POPL 2002 - PDF Preprint Papers

POPL 2002 Annual Symposium on Principles of Programming Languages

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed POPL-2002 Paper

click to vote

POPL
2002
ACM

173views Programming Languages» more POPL 2002»

CCured: type-safe retrofitting of legacy code

14 years 5 months ago

Download hal.cs.berkeley.edu

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 that ...

George C. Necula, Scott McPeak, Westley Weimer

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	173	CCured: type-safe retrofitting of legacy code	claim
2	169	Functional logic overloading	claim
3	162	Composing dataflow analyses and transformations	claim
4	161	Stochastic lambda calculus and monads of probability distributions	claim
5	154	Predicate abstraction for software verification	claim
6	143	Towards automatic construction of staged compilers	claim
7	141	Adaptive functional programming	claim
8	135	Systematic design of program transformation frameworks by abstract interpretation	claim
9	129	Resource usage analysis	claim
10	127	A type system for certified binaries	claim
11	124	Proving correctness of compiler optimizations by temporal logic	claim
12	123	Analyzing security protocols with secrecy types and logic programs	claim
13	117	An efficient profile-analysis framework for data-layout optimizations	claim
14	116	Mining specifications	claim
15	114	Bounding space usage of conservative garbage collectors	claim
16	109	Stack inspection: theory and variants	claim
17	108	The first-order theory of subtyping constraints	claim
18	103	Lazy abstraction	claim
19	102	The strength of non-size increasing computation	claim
20	102	Information flow inference for ML	claim
21	101	Types as models: model checking message-passing programs	claim
22	95	Role analysis	claim
23	92	Exploiting prolific types for memory management and optimizations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers