CC 2006 - PDF Preprint Papers

CC 2006 Creativity and Cognition

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CC-2006 Paper

click to vote

CC
2006
Springer

182views System Software» more CC 2006»

Selective Runtime Memory Disambiguation in a Dynamic Binary Translator

13 years 8 months ago

Download liberty.princeton.edu

Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...

Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...

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	182	Selective Runtime Memory Disambiguation in a Dynamic Binary Translator	claim
2	176	The CGiS Compiler-A Tool Demonstration	claim
3	147	Complexity of Ring Morphism Problems	claim
4	133	The complexity of chromatic strength and chromatic edge strength	claim
5	132	Register Allocation for Programs in SSA-Form	claim
6	129	Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode	claim
7	125	Path-Based Reuse Distance Analysis	claim
8	125	Converting Intermediate Code to Assembly Code Using Declarative Machine Descriptions	claim
9	125	A tight lower bound for restricted pir protocols	claim
10	124	Hybrid Optimizations: Which Optimization Algorithm to Use?	claim
11	124	Polyhedral Code Generation in the Real World	claim
12	123	On the complexity of approximating k-set packing	claim
13	122	Accurately Choosing Execution Runs for Software Fault Localization	claim
14	122	Context-Sensitive Points-to Analysis: Is It Worth It?	claim
15	118	Lightweight Lexical Closures for Legitimate Execution Stack Access	claim
16	108	Efficient Flow-Sensitive Interprocedural Data-Flow Analysis in the Presence of Pointers	claim
17	108	A Fresh Look at PRE as a Maximum Flow Problem	claim
18	108	Languages to diagonalize against advice classes	claim
19	101	SARA: Combining Stack Allocation and Register Allocation	claim
20	101	Inductive Time-Space Lower Bounds for Sat and Related Problems	claim
21	92	Interprocedural Dataflow Analysis in the Presence of Large Libraries	claim
22	91	On the computational power of Boolean decision lists	claim
23	89	Iterative Collective Loop Fusion	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers