TOPLAS 1999
32 papers
- 'C and tcc: A Language and Compiler for Dynamic Code Generation
- A Provably Time-Efficient Parallel Implementation of Full Speculation
- A Type System for Java Bytecode Subroutines
- A global communication optimization technique based on data-flow analysis and linear algebra
- Cache miss equations: a compiler framework for analyzing and tuning memory behavior
- Compile-time memory reuse in logic programming languages through update in place
- Componential Set-Based Analysis
- Constraint-based termination analysis of logic programs
- Dependency analysis for Standard ML
- Dynamic Typing for Distributed Programming in Polymorphic Languages
- Effectivness of Abstract Interpretation in Automatic Parallelization: A Case Study in Logic Programming
- Efficient logic variables for distributed computing
- From system F to typed assembly language
- Hierarchical modularity
- Identifying Loops in Almost Linear Time
- Interprocedural pointer alias analysis
- Linear scan register allocation
- Linearity and the pi-calculus
- Model-checking concurrent systems with unbounded integer variables: symbolic representations, approximations, and experimental results
- On Failure of the Pruning Technique in "Error Repair in Shift-Reduce Parsers"
- Partial redundancy elimination in SSA form
- Procedure placement using temporal-ordering information
- Reasoning about Grover's quantum search algorithm using probabilistic wp
- Sharing and groundness dependencies in logic programs
- Should your specification language be typed
- Space-Efficient Scheduling of Nested Parallelism
- Specification and Verification of Fault-Tolerance, Timing, and Scheduling
- Specification and dialogue control of visual interaction through visual rewriting systems
- Specificational functions
- Static correlated branch prediction
- Techniques for the Translation of MATLAB Programs into Fortran 90
- The type system for object initializatiion in the Jave bytecode language