POPL
1994
ACM
13 years 12 months ago
1994
ACM
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
POPL
1994
ACM
13 years 12 months ago
1994
ACM
Heap allocation with copying garbage collection is believed to have poormemory subsystem performance. We conducted a studyofthememory subsystem performance of heap allocation for ...
POPL
1994
ACM
13 years 12 months ago
1994
ACM
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
POPL
1994
ACM
13 years 12 months ago
1994
ACM
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
POPL
1994
ACM
13 years 12 months ago
1994
ACM
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
POPL
1994
ACM
13 years 12 months ago
1994
ACM
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
ICALP
1992
Springer
13 years 12 months ago
1992
Springer
ICALP
1992
Springer
13 years 12 months ago
1992
Springer
ICALP
1992
Springer
13 years 12 months ago
1992
Springer
The "nearest neighbor" relation, or more generally the "k nearest neighbors" relation, defined for a set of points in a metric space, has found many uses in co...
ICALP
1992
Springer
13 years 12 months ago
1992
Springer
This paper defines a probabilistic barbed congruence which turns out to coincide with observational equivalence in a probabilistic extension of CCS. Based on this coincidence resu...