Sciweavers

1485 search results - page 24 / 297
» Whole Program Paths
Sort
View
MICRO
1998
IEEE
139views Hardware» more  MICRO 1998»
15 years 6 months ago
Better Global Scheduling Using Path Profiles
Path profiles record the frequencies of execution paths through a program. Until now, the best global instruction schedulers have relied upon profile-gathered frequencies of condi...
Cliff Young, Michael D. Smith
ECAI
2004
Springer
15 years 6 months ago
Yet More Efficient EM Learning for Parameterized Logic Programs by Inter-Goal Sharing
Abstract. In previous research, we presented a dynamicprogramming-based EM (expectation-maximization) algorithm for parameterized logic programs, which is based on the structure sh...
Yoshitaka Kameya, Taisuke Sato, Neng-Fa Zhou
122
Voted
WORDS
2002
IEEE
15 years 7 months ago
Writing Temporally Predictable Code
The Worst-Case Execution-Time Analysis (WCET Analysis) of program code that is to be executed on modern processors is a highly complex task. First, it involves path analysis, to i...
Peter P. Puschner, Alan Burns
CORR
2002
Springer
133views Education» more  CORR 2002»
15 years 2 months ago
Declarative program development in Prolog with GUPU
Abstract. We present GUPU, a side-effect free environment specialized for programming courses. It seamlessly guides and supports students during all phases of program development, ...
Ulrich Neumerkel, Stefan Kral
ICSE
2007
IEEE-ACM
16 years 2 months ago
Path-Sensitive Inference of Function Precedence Protocols
Function precedence protocols define ordering relations among function calls in a program. In some instances, precedence protocols are well-understood (e.g., a call to pthread mut...
Murali Krishna Ramanathan, Ananth Grama, Suresh Ja...