POPL 2003
25 papers
- A generic approach to the static analysis of concurrent programs with procedures
- A real-time garbage collector with low overhead and consistent utilization
- A type system for higher-order modules
- A type theory for memory allocation and data layout
- Bigraphs and transitions
- Bitwidth aware global register allocation
- Coercive subtyping for the calculus of constructions
- Destructors, finalizers, and synchronization
- Discovering affine equalities using random interpretation
- Efficient algorithms for isomorphisms of simple types
- Environment classifiers
- Folklore confirmed: reducible flow graphs are exponentially larger
- From control effects to typed continuation passing
- From symptom to cause: localizing errors in counterexample traces
- Guarded recursive datatype constructors
- Incremental algorithms for dispatching in dynamically typed languages
- Interprocedural compatibility analysis for static object preallocation
- New results on the computability and complexity of points - to analysis
- Ownership types for object encapsulation
- Pure patterns type systems
- Selective memoization
- Static prediction of heap space usage for first-order functional programs
- The essence of XML
- The m-calculus: a higher-order distributed process calculus
- Toward a foundational typed assembly language