Sciweavers

315 search results - page 36 / 63
» Loop Termination Prediction
Sort
View
ATVA
2005
Springer
132views Hardware» more  ATVA 2005»
14 years 1 months ago
Flat Counter Automata Almost Everywhere!
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
Jérôme Leroux, Grégoire Sutre
PLILP
1993
Springer
13 years 11 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...
IJPP
2011
107views more  IJPP 2011»
13 years 2 months ago
Parallel Iterator for Parallelizing Object-Oriented Applications
With the advent of multi-core processors, desktop application developers must finally face parallel computing and its challenges. A large portion of the computational load in a p...
Nasser Giacaman, Oliver Sinnen
RTAS
2005
IEEE
14 years 1 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
HPCA
2007
IEEE
14 years 8 months ago
Exploiting Postdominance for Speculative Parallelization
Task-selection policies are critical to the performance of any architecture that uses speculation to extract parallel tasks from a sequential thread. This paper demonstrates that ...
Mayank Agarwal, Kshitiz Malik, Kevin M. Woley, Sam...