50 search results - page 4 / 10 » Partial Dead Code Elimination |
POPL
2002
ACM
14 years 7 months ago
2002
ACM
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
IEEECIT
2010
IEEE
13 years 6 months ago
2010
IEEE
—Superblocks represent regions in a program code that consist of multiple basic blocks. Compilers benefit from this structure since it enables optimization across block boundari...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In this paper, we present type systems for flow-sensitive pointer analysis, live stack-heap (variables) analysis, and program optimization. The type system for live stack-heap ana...
SPAA
1998
ACM
13 years 11 months ago
1998
ACM
Sparse LU factorization with partial pivoting is important for many scienti c applications and delivering high performance for this problem is di cult on distributed memory machin...
LCPC
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We have designed and implemented an interprocedural algorithm to analyze symbolic value ranges that can be assumed by variables at any given point in a program. Our algor...