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 15 Issue 4, Sept. 1993

Subtyping recursive types
Roberto M. Amadio, Luca Cardelli
Pages: 575-631
DOI: 10.1145/155183.155231
We investigate the interactions of subtyping and recursive types, in a simply typed &lgr;-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the...

Scheduling time-critical instructions on RISC machines
Krishna V. Palem, Barbara B. Simons
Pages: 632-658
DOI: 10.1145/155183.155190
We present a polynomial time algorithm for constructing a minimum completion time schedule of instructions from a basic block on RISC machines such as the Sun SPARC, the IBM 801, the Berkeley RISC machine, and the HP Precision Architecture. Our...

Analysis of Or-parallel execution models
Gopal Gupta, Bharat Jayaraman
Pages: 659-680
DOI: 10.1145/155183.155220
We discuss fundamental limitations of or-parallel execution models of nondeterministic programming languages. Or-parallelism corresponds to the execution of different nondeterministic computational paths in parallel. A natural way to represent...

A formal definition of priority in CSP
C. J. Fidge
Pages: 681-705
DOI: 10.1145/155183.155221
The process models of Ada and occam are formally based on the CSP process algebra. However, for fine-tuning real-time performance, they include “prioritized” constructs that have no counterparts in CSP. These constructs therefore...

A calculus for access control in distributed systems
Martín Abadi, Michael Burrows, Butler Lampson, Gordon Plotkin
Pages: 706-734
DOI: 10.1145/155183.155225
We study some of the concepts, protocols, and algorithms for access control in distributed systems, from a logical perspective. We account for how a principal may come to believe that another principal is making a request, either on his own or...

An alternative solution to a problem on self-stabilization
Sukumar Ghosh
Pages: 735-742
DOI: 10.1145/155183.155228
Dijkstra [4, 5] introduced the problem of self-stabilization in distributed systems as an interesting exercise for achieving global convergence through local actions. In [4] he presented three solutions to a specific version of the...