Sciweavers

1312 search results - page 74 / 263
» Formally Optimal Boxing
Sort
View
SAS
2000
Springer
149views Formal Methods» more  SAS 2000»
14 years 22 days ago
FULLDOC: A Full Reporting Debugger for Optimized Code
As compilers increasingly rely on optimizations to achieve high performance, the effectiveness of source level debuggers for optimized code continues to falter. Even if values of s...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa
ASPDAC
2005
ACM
117views Hardware» more  ASPDAC 2005»
14 years 2 months ago
Dynamic symmetry-breaking for improved Boolean optimization
With impressive progress in Boolean Satisfiability (SAT) solving and several extensions to pseudo-Boolean (PB) constraints, many applications that use SAT, such as highperformanc...
Fadi A. Aloul, Arathi Ramani, Igor L. Markov, Kare...
AOSD
2009
ACM
14 years 4 months ago
Dependent advice: a general approach to optimizing history-based aspects
Many aspects for runtime monitoring are history-based: they contain pieces of advice that execute conditionally, based on the observed execution history. History-based aspects are...
Eric Bodden, Feng Chen, Grigore Rosu
SAS
2001
Springer
166views Formal Methods» more  SAS 2001»
14 years 1 months ago
Estimating the Impact of Scalable Pointer Analysis on Optimization
This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimiza...
Manuvir Das, Ben Liblit, Manuel Fähndrich, Ja...
STOC
2001
ACM
123views Algorithms» more  STOC 2001»
14 years 9 months ago
On optimal slicing of parallel programs
Optimal program slicing determines for a statement S in a program whether or not S affects a specified set of statements, given that all conditionals in are interpreted as non-d...
Markus Müller-Olm, Helmut Seidl