POPL 2004
29 papers
- A bisimulation for dynamic sealing
- A logic you can count on
- A semantics for web services authentication
- A type system for well-founded recursion
- Abstract non-interference: parameterizing non-interference by abstract interpretation
- Abstractions from proofs
- An abstract interpretation-based framework for software watermarking
- Asynchronous and deterministic objects
- Atomizer: a dynamic atomicity checker for multithreaded programs
- Channel dependent types for higher-order mobile processes
- Extensional normalisation and type-directed partial evaluation for typed lambda calculus with sums
- Formalization of generics for the .NET common language runtime
- Free theorems in the presence of seq
- Global value numbering using random interpretation
- Incremental execution of transformation specifications
- Isomorphisms of generic recursive polynomial types
- Local reasoning about a copying garbage collector
- Non-linear loop invariant generation using Gröbner bases
- Parsing expression grammars: a recognition-based syntactic foundation
- Polymorphic typed defunctionalization
- Precise interprocedural analysis through linear algebra
- Principal typings for Java-like languages
- Semantic types: a fresh look at the ideal model for types
- Separation and information hiding
- Simple relational correctness proofs for static analyses and program transformations
- Summarizing procedures in concurrent programs
- Symbolic transfer function-based approaches to certified compilation
- The space cost of lazy reference counting
- Tridirectional typechecking