default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID29th POPL 2002: Portland, OR, USA
- John Launchbury, John C. Mitchell:
Conference Record of POPL 2002: The 29th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Portland, OR, USA, January 16-18, 2002. ACM 2002, ISBN 1-58113-450-9
- Thomas Ball, Sriram K. Rajamani:
The SLAM project: debugging system software via static analysis. 1-3 - Glenn Ammons, Rastislav Bodík, James R. Larus:
Mining specifications. 4-16 - Viktor Kuncak, Patrick Lam, Martin C. Rinard:
Role analysis. 17-32 - Martín Abadi, Bruno Blanchet:
Analyzing security protocols with secrecy types and logic programs. 33-44 - Sagar Chaki, Sriram K. Rajamani, Jakob Rehof:
Types as models: model checking message-passing programs. 45-57 - Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, Grégoire Sutre:
Lazy abstraction. 58-70 - Massimo Merro, Matthew Hennessy:
Bisimulation congruences in safe ambients. 71-80 - Kohei Honda, Nobuko Yoshida
:
A uniform type structure for secure information flow. 81-92 - Hans-Juergen Boehm:
Bounding space usage of conservative garbage collectors. 93-100 - Erez Petrank, Dror Rawitz:
The hardness of cache conscious data placement. 101-112 - Matthai Philipose, Craig Chambers, Susan J. Eggers:
Towards automatic construction of staged compilers. 113-125 - Matthias Felleisen:
From POPL to the classroom and back. 126-127 - George C. Necula, Scott McPeak, Westley Weimer:
CCured: type-safe retrofitting of legacy code. 128-139 - Shai Rubin, Rastislav Bodík, Trishul M. Chilimbi:
An efficient profile-analysis framework for data-layout optimizations. 140-153 - Norman Ramsey, Avi Pfeffer:
Stochastic lambda calculus and monads of probability distributions. 154-165 - Anindya Banerjee, David A. Naumann:
Representation independence, confinement and access control [extended abstract]. 166-177 - Patrick Cousot, Radhia Cousot:
Systematic design of program transformation frameworks by abstract interpretation. 178-190 - Cormac Flanagan, Shaz Qadeer:
Predicate abstraction for software verification. 191-202 - Zhendong Su, Alexander Aiken, Joachim Niehren, Tim Priesnitz, Ralf Treinen:
The first-order theory of subtyping constraints. 203-216 - Zhong Shao, Bratin Saha, Valery Trifonov, Nikolaos Papaspyrou:
A type system for certified binaries. 217-232 - Matthias Neubauer, Peter Thiemann, Martin Gasbichler, Michael Sperber:
Functional logic overloading. 233-244 - Rajit Manohar:
Scalable formal design methods for asynchronous VLSI. 245-246 - Umut A. Acar, Guy E. Blelloch, Robert Harper:
Adaptive functional programming. 247-259 - Martin Hofmann:
The strength of non-size increasing computation. 260-269 - Sorin Lerner, David Grove, Craig Chambers:
Composing dataflow analyses and transformations. 270-282 - David Lacey, Neil D. Jones, Eric Van Wyk, Carl Christian Frederiksen:
Proving correctness of compiler optimizations by temporal logic. 283-294 - Yefim Shuf, Manish Gupta, Rajesh Bordawekar, Jaswinder Pal Singh:
Exploiting prolific types for memory management and optimizations. 295-306 - Cédric Fournet, Andrew D. Gordon:
Stack inspection: theory and variants. 307-318 - François Pottier, Vincent Simonet:
Information flow inference for ML. 319-330 - Atsushi Igarashi, Naoki Kobayashi:
Resource usage analysis. 331-342
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-26 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
