Sciweavers

50 search results - page 5 / 10
» Partial Dead Code Elimination
Sort
View
FM
2008
Springer
192views Formal Methods» more  FM 2008»
13 years 9 months ago
CoVaC: Compiler Validation by Program Analysis of the Cross-Product
Abstract. The paper presents a deductive framework for proving program equivalence and its application to automatic verification of transformations performed by optimizing compiler...
Anna Zaks, Amir Pnueli
CGO
2005
IEEE
14 years 1 months ago
A General Compiler Framework for Speculative Optimizations Using Data Speculative Code Motion
Data speculative optimization refers to code transformations that allow load and store instructions to be moved across potentially dependent memory operations. Existing research w...
Xiaoru Dai, Antonia Zhai, Wei-Chung Hsu, Pen-Chung...
SAS
1999
Springer
106views Formal Methods» more  SAS 1999»
13 years 11 months ago
Static Analyses for Eliminating Unnecessary Synchronization from Java Programs
This paper presents and evaluates a set of analyses designed to reduce synchronization overhead in Java programs. Monitor-based synchronization in Java often causes significant ove...
Jonathan Aldrich, Craig Chambers, Emin Gün Si...
PPAM
2007
Springer
14 years 1 months ago
A Supernodal Out-of-Core Sparse Gaussian-Elimination Method
Abstract. We present an out-of-core sparse direct solver for unsymmetric linear systems. The solver factors the coefficient matrix A into A = PLU using Gaussian elimination with pa...
Sivan Toledo, Anatoli Uchitel
LCTRTS
2009
Springer
14 years 2 months ago
Eliminating the call stack to save RAM
Most programming languages support a call stack in the programming model and also in the runtime system. We show that for applications targeting low-power embedded microcontroller...
Xuejun Yang, Nathan Cooprider, John Regehr