APLAS 2000
22 papers
- A Declarative Approach to Concurrency in Java
- A Generalization of Hybrid Let-Polymorphic Type Inference Algorithms
- A New Criterion for Safe Program Transformations
- A Note on Algebraic Structure of Tree Decomposition of Graphs
- A Note on Model Checkers Reuse and Validation
- Abstraction of Link Structures by Regular Expressions and Abstract Model Checking of Concurrent Garbage Collection
- An Efficient Algorithm for Scheduling Instructions with Deadline Constraints on ILP Machines
- An Open Environment for Cooperative Equational Solving
- Automatic Generation of Very Efficient Programs by Generalized Partial Computation
- Berlioz: Compiling Oz to Java Bytecode
- Conditional Analysis and Verification
- Deriving Pre-Conditions for Array Bound Check Elimination
- Generic Validation of Structural Content with Parametric Modules
- Kima - An Automated Error Correction System for Concurrent Logic Programs
- Light Logic and Resource Bounded Computation
- Linearity Analysis of Concurrent Logic Programs
- Logical Analysis of Assembly Language
- Mining Optimized Ranges
- On Building Trees with Minimum Height, Relationally
- Partial CPS Transformation Using Static Annotation
- Principles of Inverse Computation in a Functional Language
- Proving Syntactic Properties of Exceptions in an Ordered Logical Framework