Sciweavers

1291 search results - page 43 / 259
» Arithmetic program paths
Sort
View
115
Voted
ICSE
2009
IEEE-ACM
15 years 9 months ago
Guided path exploration for regression test generation
Regression test generation aims at generating a test suite that can detect behavioral differences between the original and the modified versions of a program. Regression test gen...
Kunal Taneja, Tao Xie, Nikolai Tillmann, Jonathan ...
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
116
Voted
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
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
125
Voted
AADEBUG
1997
Springer
15 years 6 months ago
Backwards-Compatible Bounds Checking for Arrays and Pointers in C Programs
This paper presents a new approach to enforcing array bounds and pointer checking in the C language. Checking is rigorous in the sense that the result of pointer arithmetic must r...
Richard W. M. Jones, Paul H. J. Kelly