122 search results - page 8 / 25 » Abductive Logic Programming by Nonground Rewrite Systems |
CC
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
ECEASST
2008
13 years 8 months ago
2008
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
MEMOCODE
2003
IEEE
14 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...
ENTCS
2007
13 years 8 months ago
2007
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
SAS
2009
Springer
14 years 9 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...