TOPLAS 1997
35 papers
- A Note on "On the Conversion of Indirect to Direct Recursion"
- A Practical Framework for Demand-Driven Interprocedural Data Flow Analysis
- A Practical Soft Type System for Scheme
- A Refinement Calculus for the Synthesis of Verified Hardware Descriptions in VHDL
- A Reflection on Call-by-Value
- Abstract Interpretation of Reactive Systems
- An Approach for Exploring Code-Improving Transformations
- Combinatory Formaulations of Concurrent Languages
- Commutativity Analysis: A New Analysis Technique for Parallelizing Compilers
- Complementation in Abstract Interpretation
- Disjunctive Program Analysis for Algebraic Data Types
- Evidence-Based Static Branch Prediction Using Machine Learning
- Formal Derivation of Efficient Parallel Programs by Construction of List Homomorphisms
- Formally Based Profiling for Higher-Order Functional Languages
- Implementing Signatures for C++
- Incremental Computation of Dominator Trees
- Interprocedural Control Flow Analysis of First-Order Programs with Tail-Call Optimization
- Kleene Algebra with Tests
- Lightweight Closure Conversion
- Making Graphs Reducible with Controlled Node Splitting
- Mobile Objects in Distributed Oz
- Nesting of Reducible and Irreducible Loops
- On the Use of Regular Expressions for Searching Text
- Optimal Control Dependence Computation and the Roman Chariots Problem
- Parallelizing Nonnumerical Code with Selective Scheduling and Software Pipelining
- Precise Flow-Insensitive May-Alias Analysis is NP-Hard
- Protocol Specifications and Component Adaptors
- Proving Concurrent Constraint Programs Correct
- Pure Versus Impure Lisp
- Slicing Real-Time Programs for Enhanced Schedulability
- Specifying Representations of Machine Instructions
- Symboloc Model Checking for Event-Driven Real-Time Systems
- Toward a Complete Transformational Toolkit for Compilers
- Utilizing Symmetry when Model-Checking under Fairness Assumptions: An Automata-Theoretic Approach
- Verifying Parameterized Networks