POPL 2002
30 papers
- A type system for certified binaries
- A uniform type structure for secure information flow
- Adaptive functional programming
- An efficient profile-analysis framework for data-layout optimizations
- Analyzing security protocols with secrecy types and logic programs
- Bisimulation congruences in safe ambients
- Bounding space usage of conservative garbage collectors
- CCured: type-safe retrofitting of legacy code
- Composing dataflow analyses and transformations
- Exploiting prolific types for memory management and optimizations
- From POPL to the classroom and back
- Functional logic overloading
- Information flow inference for ML
- Lazy abstraction
- Mining specifications
- Predicate abstraction for software verification
- Proving correctness of compiler optimizations by temporal logic
- Representation independence, confinement and access control [extended abstract]
- Resource usage analysis
- Role analysis
- Scalable formal design methods for asynchronous VLSI
- Stack inspection: theory and variants
- Stochastic lambda calculus and monads of probability distributions
- Systematic design of program transformation frameworks by abstract interpretation
- The SLAM project: debugging system software via static analysis
- The first-order theory of subtyping constraints
- The hardness of cache conscious data placement
- The strength of non-size increasing computation
- Towards automatic construction of staged compilers
- Types as models: model checking message-passing programs