1485 search results - page 39 / 297 » Whole Program Paths |
INFSOF
1998
13 years 8 months ago
1998
We show how to combine program slicing and constraint solving in order to obtain better slice accuracy. The method is used in the VALSOFT slicing system. One particular applicatio...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
ISSS
2000
IEEE
14 years 1 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 29 days 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 3 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...