1291 search results - page 65 / 259 » Arithmetic program paths |
ISSS
2000
IEEE
14 years 2 months ago
2000
IEEE
Timing and power consumption of embedded systems are state and input data dependent. Formal analysis of such dependencies leads to intervals rather than single values. These inter...
MICRO
1996
IEEE
14 years 1 months ago
1996
IEEE
Much of the previous work on modulo scheduling has targeted numeric programs, in which, often, the majority of the loops are well-behaved loop-counter-based loops without early ex...
IFM
2009
Springer
14 years 4 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
CP
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
DSN
2009
IEEE
14 years 4 months ago
2009
IEEE
Dynamic symbolic execution is a structural testing technique that systematically explores feasible paths of the program under test by running the program with different test input...