584 search results - page 14 / 117 » Logic Programs as term Rewriting Systems |
106
click to vote
MEMOCODE
2003
IEEE
15 years 2 months ago
2003
IEEE
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
SAS
2009
Springer
15 years 10 months ago
2009
Springer
We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized an...
CADE
2001
Springer
15 years 2 months ago
2001
Springer
The dependency pair method of Arts and Giesl is the most powerful technique for proving termination of term rewrite systems automatically. We show that the method can be improved b...
FLOPS
2008
Springer
14 years 11 months ago
2008
Springer
It is known that the behavior of non-deterministic functions with call-time choice semantics, present in current functional logic languages, is not well described by usual approach...
ICLP
2005
Springer
15 years 3 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...