172 search results - page 9 / 35 » Automatic Termination Analysis of Logic Programs |
149
click to vote
POPL
2005
ACM
15 years 9 months ago
2005
ACM
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
SAS
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We specify an information flow analysis for a simple imperative language, using a Hoare-like logic. The logic facilitates static checking of a larger class of programs t...
189
click to vote
POPL
2009
ACM
15 years 10 months ago
2009
ACM
ibe an abstract interpretation based framework for proving relationships between sizes of memory partitions. Instances of this framework can prove traditional properties such as m...
110
Voted
POPL
2011
ACM
14 years 8 days ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. In this PhD project, we deal with the issue of code duplication in logic programs. In particular semantical duplication or redundancy is generally viewed as a possible se...