POPL 2001
26 papers
- A compiler technique for improving whole-program locality
- A generic type system for the Pi-calculus
- An abstract Monte-Carlo method for the analysis of probabilistic programs
- Avoiding exponential explosion: generating compact verification conditions
- BI as an Assertion Language for Mutable Data Structures
- Colored local type inference
- Combining subsumption and binary methods: an object calculus with views
- Computational flux
- Efficient deductive methods for program analysis
- Extensionality and Intensionality of the Ambient Logics
- Mobile values, new names, and secure communication
- Modules, abstract types, and distributed versioning
- Nomadic pict: correct communication infrastructure for mobile computation
- Oracle-based checking of untrusted software
- Programming language methods in computer security
- Regular expression pattern matching for XML
- Secure safe ambients
- Stratified operational semantics for safety and correctness of the region calculus
- Subtyping arithmetical types
- The size-change principle for program termination
- Type-base flow analysis: from polymorphic subtyping to CFL-reachability
- Type-indexed rows
- Type-preserving garbage collectors
- Typing a multi-language intermediate code
- Verifying safety properties of concurrent Java programs using 3-valued logic
- What packets may come: automata for network monitoring