ACM Transactions on Programming Languages & Systems articles

Recent articles from ACM Transactions on Programming Languages & Systems

A schema for interprocedural modification side-effect analysis with pointer aliasing.(Statistical Data Included)
March 1, 2001... 1. INTRODUCTION Accurate compile-time calculation of possible interprocedural side effects is crucial for aggressive compiler optimization [Aho et al. 1986], practical dependence analysis in programs with procedure calls [Banerjee 1988; Polychronopolous 1988; Wolfe 1989], data-flow-based...

Synthesis of current programs for an atomic read/write model of computation.
March 1, 2001... 1. INTRODUCTION Methods for synthesizing (finite state) concurrent programs from temporal logic specifications based on the use of a decision procedure for testing temporal satisfiability have been proposed by Emerson and Clarke [1982] and Manna and Wolper [1984]. An important advantage...

Type elaboration and subtype completion for Java bytecode.
March 1, 2001... 1. INTRODUCTION Type elaboration is a technique for type inference on verifiable Java bytecode. Verification provides type consistency rules that are based upon program flow and safety checking. These are weaker than the rules for static typechecking in Java source, and there are...

Semiring-Based Constraint Logic Programming: Syntax and Semantics.
January 1, 2001... 1. INTRODUCTION Classical constraint satisfaction problems (CSPs) [Tsang 1993; Mackworth 1992] are a very expressive and natural formalism to specify many kinds of real-life problems. However, they also have some limitations, mainly when they are used to represent real-life scenarios...

Using Types to Analyze and Optimize Object-Oriented Programs.
January 1, 2001... 1. INTRODUCTION In object-oriented languages, programmers make extensive use of pointers, type hierarchies, and virtual method invocations to improve code reuse and correctness. These features have a cost. For example, without alias analysis, the compiler must assume all pointer...