172 search results - page 11 / 35 » Automatic Termination Analysis of Logic Programs |
89
Voted
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
80
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
The classical technique for proving termination of a generic sequential computer program involves the synthesis of a ranking function for each loop of the program. Linear ranking ...
CORR
2010
Springer
14 years 6 months ago
2010
Springer
The paradigm of Tabled Logic Programming (TLP) is now supported by a number of Prolog systems, including XSB, YAP Prolog, B-Prolog, Mercury, ALS, and Ciao. The reasons for this ar...
CONCUR
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
AAECC
2005
Springer
14 years 9 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...