Sciweavers

CC
2007
Springer
208views System Software» more  CC 2007»
15 years 6 months ago
A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees
Abstract. We introduce a new framework for elimination-based data flow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...
Bernhard Scholz, Johann Blieberger
CC
2007
Springer
158views System Software» more  CC 2007»
15 years 19 hour ago
The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...
Pierre McKenzie, Klaus W. Wagner
CC
2007
Springer
157views System Software» more  CC 2007»
15 years 6 months ago
New Algorithms for SIMD Alignment
Optimizing programs for modern multiprocessor or vector platforms is a major important challenge for compilers today. In this work, we focus on one challenging aspect: the SIMD ALI...
Liza Fireman, Erez Petrank, Ayal Zaks
CC
2007
Springer
143views System Software» more  CC 2007»
15 years 6 months ago
Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacks
Implementing a new programming language by the means of a translator to an existing language is attractive as it provides portability over all platforms supported by the host langu...
Jason Baker, Antonio Cunei, Filip Pizlo, Jan Vitek
88
Voted
CC
2007
Springer
139views System Software» more  CC 2007»
15 years 6 months ago
Using Prefetching to Improve Reference-Counting Garbage Collectors
Reference counting is a classical garbage collection method. Recently, a series of papers have extended the basic method to drastically reduce its notorious overhead and extend the...
Harel Paz, Erez Petrank
System Software
Top of PageReset Settings