TOPLAS 2004
28 papers
- A fast and accurate framework to analyze and optimize cache memory behavior
- A fast, memory-efficient register allocation framework for embedded systems
- A framework for the integration of partial evaluation and abstract interpretation of logic programs
- A semantics for advice and dynamic join points in aspect-oriented programming
- A tail-recursive machine with stack inspection
- Access control for mobile agents: The calculus of boxed ambients
- An interval constraint system for lattice domains
- An unfold/fold transformation framework for definite logic programs
- Automatic tiling of iterative stencil loops
- Extensible objects without labels
- First-class monadic schedules
- Guest editorial
- Hancock: A language for analyzing transactional data streams
- JR: Flexible distributed programming in an extended Java
- Logic of global synchrony
- Modern concurrency abstractions for C#
- Modular refinement of hierarchic reactive machines
- Modular typechecking for hierarchically extensible datatypes and functions
- Natural semantics as a static program analysis framework
- Offline partial evaluation can be as accurate as online partial evaluation
- On exponential-time completeness of the circularity problem for attribute grammars
- Optimistic register coalescing
- Polymorphic specialization for ML
- Send-receive considered harmful: Myths and realities of message passing
- Symmetry and reduced symmetry in model checking
- Synthesis of fault-tolerant concurrent programs
- The pattern calculus
- Traversals of object structures: Specification and Efficient Implementation