Sciweavers

POPL
1994
ACM
13 years 8 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
POPL
1994
ACM
13 years 8 months ago
Memory Subsystem Performance of Programs Using Copying Garbage Collection
Heap allocation with copying garbage collection is believed to have poormemory subsystem performance. We conducted a studyofthememory subsystem performance of heap allocation for ...
Amer Diwan, David Tarditi, J. Eliot B. Moss
POPL
1994
ACM
13 years 8 months ago
Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages
This paper discusses call forwarding, a simple interprocedural optimization technique for dynamically typed languages. The basic idea behind the optimization is straightforward: n...
Koenraad De Bosschere, Saumya K. Debray, David Gud...
POPL
1994
ACM
13 years 8 months ago
A Needed Narrowing Strategy
Abstract: The narrowing relation over terms constitutes the basis of the most important operational semantics of languages that integrate functional and logic programming paradigms...
Sergio Antoy, Rachid Echahed, Michael Hanus
POPL
1994
ACM
13 years 8 months ago
Dominators, Super Blocks, and Program Coverage
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...
Hiralal Agrawal
POPL
1994
ACM
13 years 8 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald