213 search results - page 17 / 43 » Automated Termination Analysis for Logic Programs with Cut |
100
click to vote
SIGSOFT
2003
ACM
15 years 5 months ago
2003
ACM
Model checking is an automated technique for verifying that a system satisfies a set of required properties. Such properties are typically expressed as temporal logic formulas, in...
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Pruning operators, such as cut, are important to develop efficient logic programs as they allow programmers to reduce the search space and thus discard unnecessary compu...
96
Voted
SIGSOFT
2010
ACM
14 years 9 months ago
2010
ACM
A replay tool aiming to reproduce a program's execution interposes itself at an appropriate replay interface between the program and the environment. During recording, it log...
101
click to vote
AAECC
2005
Springer
14 years 11 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...
69
Voted
FLOPS
2006
Springer
15 years 3 months ago
2006
Springer
We propose a new method to control memory resources by static analysis. For this, we introduce the notion of sup-interpretation which bounds from above the size of function outputs...