1385 search results - page 44 / 277 » Natural Rewriting for General Term Rewriting Systems |
159
click to vote
PODS
2003
ACM
16 years 6 months ago
2003
ACM
In this paper we consider general path constraints for semistructured databases. Our general constraints do not suffer from the limitations of the path constraints previously stud...
123
click to vote
FUIN
2006
15 years 6 months ago
2006
In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain ...
189
click to vote
IASTEDSEA
2004
15 years 7 months ago
2004
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
155
click to vote
ICTAC
2005
Springer
15 years 11 months ago
2005
Springer
Rewriting logic is a simple computational logic very well suited as a semantic framework within which many different models of computation, systems and languages can be naturally ...
147
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we combine rewriting techniques with verification issues. More precisely, we show how techniques for proving relative termination of term rewrite systems (...