315 search results - page 7 / 63 » Loop Termination Prediction |
TCS
2008
13 years 7 months ago
2008
In this paper, we present a fully automatizable approach to detecting loops in standard term rewriting. Our method is based on semi-unification and an unfolding operation which pr...
ENTCS
2008
13 years 7 months ago
2008
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
DATE
2007
IEEE
14 years 1 months ago
2007
IEEE
Loop unrolling is a well-known compiler optimization that can lead to significant performance improvements. When used in High Level Synthesis (HLS) unrolling can affect the contr...
AIPS
2010
13 years 10 months ago
2010
The utility of including loops in plans has been long recognized by the planning community. Loops in a plan help increase both its applicability and the compactness of representat...
CADE
2007
Springer
14 years 8 months ago
2007
Springer
Abstract. Hoare logic is widely used for software specification and verification. Frequently we need to prove the total correctness of a program: to prove that the program not only...