CC 2007 - PDF Preprint Papers

CC 2007 Creativity and Cognition

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CC-2007 Paper

click to vote

CC
2007
Springer

208views System Software» more CC 2007»

A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees

14 years 5 months ago

Download www.auto.tuwien.ac.at

Abstract. We introduce a new framework for elimination-based data ﬂow analysis. We present a simple algorithm and a delayed algorithm that exhibit a worstcase complexity of O(n2 ...

Bernhard Scholz, Johann Blieberger

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	208	A New Elimination-Based Data Flow Analysis Framework Using Annotated Decomposition Trees	claim
2	158	The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers	claim
3	157	New Algorithms for SIMD Alignment	claim
4	143	Accurate Garbage Collection in Uncooperative Environments with Lazy Pointer Stacks	claim
5	139	Using Prefetching to Improve Reference-Counting Garbage Collectors	claim
6	129	Extended Linear Scan: An Alternate Foundation for Global Register Allocation	claim
7	126	An Array Allocation Scheme for Energy Reduction in Partitioned Memory Architectures	claim
8	123	An Improved Analysis of Linear Mergers	claim
9	121	If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances	claim
10	118	A Practical Escape and Effect Analysis for Building Lightweight Method Summaries	claim
11	109	Layout Transformations for Heap Objects Using Static Access Patterns	claim
12	108	Communication vs. Computation	claim
13	107	A Fast Cutting-Plane Algorithm for Optimal Coalescing	claim
14	96	A Declarative Framework for Analysis and Optimization	claim
15	96	Correcting the Dynamic Call Graph Using Control-Flow Constraints	claim
16	94	Program Refactoring, Program Synthesis, and Model-Driven Development	claim
17	94	Pseudorandomness and Average-Case Complexity Via Uniform Reductions	claim
18	92	Obfuscating Java: The Most Pain for the Least Gain	claim
19	85	The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs	claim
20	80	Preprocessing Strategy for Effective Modulo Scheduling on Multi-issue Digital Signal Processors	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers