TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
Abstract. We introduce the notion of strongly concatenable process as a refinement of concatenable processes [3] which can be expressed axiomatically via a functor Q[ ] from the c...
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
The Pentium computer chip’s division algorithm relies on a table from which five entries were inadvertently omitted, with the result that 1738 single precision dividenddivisor ...
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
Algebraic specifications have been used successfully as a formal basis for software development. This paper discusses how the origin and dynamic dependence relations implicitly de...
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
Abstract. Binding-time analyses based on flow analysis have been presented by Bondorf, Consel, Bondorf and Jørgensen, and Schwartzbach and the present author. The analyses are fo...
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
Starting from the process algebra for Concurrent ML we develop two program analyses that facilitate the intelligent placement of processes on processors. Both analyses are obtaine...
TAPSOFT
1995
Springer
13 years 7 months ago
1995
Springer
We develop an imperative calculus of objects that is both tiny and expressive. Our calculus provides a minimal setting in which to study the operational semantics and the typing r...