Sciweavers

178 search results - page 29 / 36
» A Tool for Optimizing the Build Performance of Large Softwar...
Sort
View
SIGSOFT
2007
ACM
14 years 8 months ago
Measuring empirical computational complexity
The standard language for describing the asymptotic behavior of algorithms is theoretical computational complexity. We propose a method for describing the asymptotic behavior of p...
Simon Goldsmith, Alex Aiken, Daniel Shawcross Wilk...
CODES
2008
IEEE
14 years 2 months ago
Don't forget memories: a case study redesigning a pattern counting ASIC circuit for FPGAs
Modern embedded compute platforms increasingly contain both microprocessors and field-programmable gate arrays (FPGAs). The FPGAs may implement accelerators or other circuits to s...
David Sheldon, Frank Vahid
OOPSLA
2007
Springer
14 years 1 months ago
Ilea: inter-language analysis across java and c
Java bug finders perform static analysis to find implementation mistakes that can lead to exploits and failures; Java compilers perform static analysis for optimization. If Java...
Gang Tan, Greg Morrisett
ADAEUROPE
2007
Springer
14 years 1 months ago
Towards User-Level Extensibility of an Ada Library: An Experiment with Cheddar
In this article, we experiment a way to extend an Ada library called Cheddar. Cheddar provides a domain specific language. Programs written with this domain specific language can...
Frank Singhoff, Alain Plantec
ECOOP
2004
Springer
14 years 27 days ago
Pointer Analysis in the Presence of Dynamic Class Loading
Many compiler optimizations and software engineering tools need precise pointer analyses to be effective. Unfortunately, many Java features, such as dynamic class loading, refle...
Martin Hirzel, Amer Diwan, Michael Hind