TOPLAS 2002
21 papers
- An assume-guarantee rule for checking simulation
- Automatic data and computation decomposition on distributed memory parallel computers
- Automatic derivation of compiler machine descriptions
- Compiling language definitions: the ASF+SDF compiler
- Data abstraction and information hiding
- Efficient and effective branch reordering using profile data
- Efficient and precise array access analysis
- Guest editorial
- Handling irreducible loops: optimized node splitting versus DJ-graphs
- Information flow vs. resource access in the asynchronous pi-calculus
- More dynamic object reclassification: Fickle||
- On loops, dominators, and dominance frontiers
- On the usefulness of type and liveness accuracy for garbage collection and leak detection
- Parametric shape analysis via 3-valued logic
- Practical extraction techniques for Java
- Register tiling in nonrectangular iteration spaces
- Repairing syntax errors in LR parsers
- The apprentice challenge
- The undecidability of associativity and commutativity analysis
- Type-Safe linking with recursive DLLs and shared libraries
- Type-preserving compilation of Featherweight Java