23201 search results - page 87 / 4641 » Rewriting Systems with Data |
171
Voted
RTA
2007
Springer
15 years 11 months ago
2007
Springer
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
189
Voted
MST
2006
15 years 5 months ago
2006
We consider the transition graphs of regular ground tree (or term) rewriting systems. The vertex set of such a graph is a (possibly infinite) set of trees. Thus, with a finite tree...
160
click to vote
AAECC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract In [24], a new size-change principle was proposed to verify termination of functional programs automatically. We extend this principle in order to prove termination and in...
258
click to vote
ICDE
1997
IEEE
16 years 6 months ago
1997
IEEE
Transaction delegation, as introduced in ACTA, allows a transaction to transfer responsibility for the operations that it has performed on an object to another transaction. Delega...
119
click to vote
RTA
2007
Springer
15 years 11 months ago
2007
Springer
We investigate garbage collection of unreachable parts of rooted graphs from a categorical point of view. First, we define this task as the right adjoint of an inclusion functor. ...