192 search results - page 8 / 39 » Using Call Exit Analysis for Logic Program Transformation |
ICLP
2005
Springer
14 years 1 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
ICLP
2007
Springer
13 years 11 months ago
2007
Springer
We present a static analysis that infers both upper and lower bounds on the usage that a logic program makes of a set of user-definable resources. The inferred bounds will in gener...
WCRE
1993
IEEE
13 years 11 months ago
1993
IEEE
Program transformation systems provide one means of formally deriving a program from its speci cation. The main advantage of this development method is that the executable program...
LPNMR
2001
Springer
14 years 2 days ago
2001
Springer
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Graphs and graph transformation systems are a frequently used modelling technique for a wide range of different domains, covering areas as diverse as refactorings, network topolog...