POPL 2006
36 papers
- A fixpoint calculus for local and global program flows
- A hierarchical model of data locality
- A logic for information flow in object-oriented programs
- A polymorphic modal type system for lisp-like multi-staged languages
- A verifiable SSA program representation for aggressive compiler optimization
- A virtual class calculus
- Adventures in time and space
- Associating synchronization constraints with data in an object-oriented language
- Autolocker: synchronization inference for atomic sections
- Certified assembly programming with embedded code pointers
- Compiler-directed channel allocation for saving power in on-chip networks
- Decidability and proof systems for language-based noninterference relations
- Engineering with logic: HOL specification and symbolic-evaluation testing for TCP implementations
- Environment analysis via Delta CFA
- Fast and loose reasoning is morally correct
- Formal certification of a compiler back-end or: programming a compiler with a proof assistant
- Frame rules from answer types for code pointers
- Harmless advice
- Hybrid type checking
- Interruptible iterators
- Modular set-based analysis from contracts
- N-synchronous Kahn networks: a relaxed model of synchrony for real-time systems
- On flow-sensitive security types
- Polymorphic regular tree types and patterns
- Protecting representation with effect encapsulation
- Simplifying reductions
- Small bisimulations for reasoning about higher-order imperative programs
- Specifying C++ concepts
- Staged allocation: a compositional technique for specifying and implementing procedure calling conventions
- Stratified type inference for generalized algebraic data types
- The Scala experiment: can we provide better language support for component systems?
- The essence of command injection attacks in web applications
- The next 700 data description languages
- The next mainstream programming language: a game developer's perspective
- Verifying properties of well-founded linked lists
- Why dependent types matter