700 search results - page 35 / 140 » On Termination of Constraint Logic Programs |
102
click to vote
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. In an automated setting, termination tools are concerned with parametric polynomi...
111
click to vote
CC
1998
Springer
15 years 3 months ago
1998
Springer
Abstract. Flow logic offers a compact and versatile notation for expressing the acceptability of solutions to program analysis problems. In contrast to previous logical formulation...
106
click to vote
AGP
1995
IEEE
15 years 2 months ago
1995
IEEE
Pattern analysis consists in determining the shape of the set of solutions of the constraint store at some program points. Our basic claim is that pattern analyses can all be desc...
105
click to vote
SCP
1998
14 years 11 months ago
1998
Many interesting analyses for constraint logic-based languages are aimed at the detection of monotonic properties, that is to say, properties that are preserved as the computation...
100
click to vote
GECCO
2008
Springer
15 years 11 days 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...