139 search results - page 16 / 28 » Automated Termination Proofs for Logic Programs by Term Rewr... |
150
click to vote
CTRS
1987
15 years 9 months ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
171
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
The task of designing and implementing a compiler can be a difficult and error-prone process. In this paper, we present proach based on the use of higher-order abstract syntax and...
152
click to vote
DAGSTUHL
2007
15 years 7 months ago
2007
Abstract. Well-founded orders are the most basic, but also most important ingredient to virtually all termination analyses. Numerous fully automated search algorithms for these cla...
144
click to vote
LOPSTR
2004
Springer
15 years 11 months ago
2004
Springer
For use in earlier approaches to automated module interface adaptation, we seek a restricted form of program synthesis. Given some typing assumptions and a desired result type, we ...
159
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...