Sciweavers

POPL
2002
ACM
14 years 11 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
POPL
2002
ACM
14 years 11 months ago
Role analysis
We present a new role system in which the type (or role) of each object depends on its referencing relationships with other objects, with the role changing as these relationships ...
Viktor Kuncak, Patrick Lam, Martin C. Rinard
POPL
2002
ACM
14 years 11 months ago
Resource usage analysis
It is an important criterion of program correctness that a program accesses resources in a valid manner. For example, a memory region that has been allocated should be eventually ...
Atsushi Igarashi, Naoki Kobayashi
POPL
2002
ACM
14 years 11 months ago
Lazy abstraction
Grégoire Sutre, Ranjit Jhala, Rupak Majumda...
POPL
2002
ACM
14 years 11 months ago
Stack inspection: theory and variants
Cédric Fournet, Andrew D. Gordon
POPL
2002
ACM
14 years 11 months ago
Predicate abstraction for software verification
e Abstraction for Software Verification Cormac Flanagan Shaz Qadeer Compaq Systems Research Center 130 Lytton Ave, Palo Alto, CA 94301 Software verification is an important and di...
Cormac Flanagan, Shaz Qadeer
POPL
2002
ACM
14 years 11 months ago
Types as models: model checking message-passing programs
Sagar Chaki, Sriram K. Rajamani, Jakob Rehof
POPL
2002
ACM
14 years 11 months ago
Mining specifications
Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally...
Glenn Ammons, James R. Larus, Rastislav Bodí...