Abstract is missing.
- The SLAM project: debugging system software via static analysisThomas Ball, Sriram K. Rajamani. 1-3 [doi]
- Mining specificationsGlenn Ammons, Rastislav Bodík, James R. Larus. 4-16 [doi]
- Role analysisViktor Kuncak, Patrick Lam, Martin C. Rinard. 17-32 [doi]
- Analyzing security protocols with secrecy types and logic programsMartín Abadi, Bruno Blanchet. 33-44 [doi]
- Types as models: model checking message-passing programsSagar Chaki, Sriram K. Rajamani, Jakob Rehof. 45-57 [doi]
- Lazy abstractionThomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre. 58-70 [doi]
- Bisimulation congruences in safe ambients71-80 [doi]
- A uniform type structure for secure information flowKohei Honda, Nobuko Yoshida. 81-92 [doi]
- Bounding space usage of conservative garbage collectorsHans-Juergen Boehm. 93-100 [doi]
- The hardness of cache conscious data placementErez Petrank, Dror Rawitz. 101-112 [doi]
- Towards automatic construction of staged compilersMatthai Philipose, Craig Chambers, Susan J. Eggers. 113-125 [doi]
- From POPL to the classroom and backMatthias Felleisen. 126-127 [doi]
- CCured: type-safe retrofitting of legacy codeGeorge C. Necula, Scott McPeak, Westley Weimer. 128-139 [doi]
- An efficient profile-analysis framework for data-layout optimizationsShai Rubin, Rastislav Bodík, Trishul M. Chilimbi. 140-153 [doi]
- Stochastic lambda calculus and monads of probability distributionsNorman Ramsey, Avi Pfeffer. 154-165 [doi]
- Representation independence, confinement and access control [extended abstract]Anindya Banerjee, David A. Naumann. 166-177 [doi]
- Systematic design of program transformation frameworks by abstract interpretationPatrick Cousot, Radhia Cousot. 178-190 [doi]
- Predicate abstraction for software verificationCormac Flanagan, Shaz Qadeer. 191-202 [doi]
- The first-order theory of subtyping constraintsZhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen. 203-216 [doi]
- A type system for certified binariesZhong Shao, Bratin Saha, Valery Trifonov, Nikolaos Papaspyrou. 217-232 [doi]
- Functional logic overloadingMatthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber. 233-244 [doi]
- Scalable formal design methods for asynchronous VLSIRajit Manohar. 245-246 [doi]
- Adaptive functional programmingUmut A. Acar, Guy E. Blelloch, Robert Harper. 247-259 [doi]
- The strength of non-size increasing computationMartin Hofmann. 260-269 [doi]
- Composing dataflow analyses and transformationsSorin Lerner, David Grove, Craig Chambers. 270-282 [doi]
- Proving correctness of compiler optimizations by temporal logicDavid Lacey, Neil D. Jones, Eric {Van Wyk}, Carl Christian Frederiksen. 283-294 [doi]
- Exploiting prolific types for memory management and optimizationsYefim Shuf, Manish Gupta, Rajesh Bordawekar, Jaswinder Pal Singh. 295-306 [doi]
- Stack inspection: theory and variantsCédric Fournet, Andrew D. Gordon. 307-318 [doi]
- Information flow inference for MLFrançois Pottier, Vincent Simonet. 319-330 [doi]
- Resource usage analysisAtsushi Igarashi, Naoki Kobayashi. 331-342 [doi]