ACM DL

Programming Languages and Systems (TOPLAS)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Programming Languages and Systems (TOPLAS), Volume 25 Issue 5, September 2003

The receptive distributed π-calculus
Roberto M. Amadio, Gérard Boudol, Cédric Lhoussaine
Pages: 549-577
DOI: 10.1145/937563.937564
We study an asynchronous distributed π-calculus, with constructs for localities and migration. We show that a static analysis ensures the receptiveness of channel names, which, together with a simple type system, guarantees the message...

Class analyses as abstract interpretations of trace semantics
Fausto Spoto, Thomas Jensen
Pages: 578-630
DOI: 10.1145/937563.937565
We use abstract interpretation to abstract a compositional trace semantics for a simple imperative object-oriented language into its projection over a set of program points called watchpoints. We say that the resulting watchpoint...

Generating LR syntax error messages from examples
Clinton L. Jeffery
Pages: 631-640
DOI: 10.1145/937563.937566
LR parser generators are powerful and well-understood, but the parsers they generate are not suited to provide good error messages. Many compilers incur extensive modifications to the source grammar to produce useful syntax error messages....

Jam---designing a Java extension with mixins
Davide Ancona, Giovanni Lagorio, Elena Zucca
Pages: 641-712
DOI: 10.1145/937563.937567
In this paper we present Jam, an extension of the Java language supporting mixins, that is, parametric heir classes. A mixin declaration in Jam is similar to a Java heir class declaration, except that it does not extend a fixed parent class,...