4 search results - page 1 / 1 » Unrolling Lists |
LFP
1994
13 years 7 months ago
1994
NFM
2011
13 years 1 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
IEEEPACT
2006
IEEE
14 years 2 days ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
PLDI
1995
ACM
13 years 9 months ago
1995
ACM
Traditional list schedulers order instructions based on an optimistic estimate of the load latency imposed by the hardware and therefore cannot respond to variations in memory lat...