882 search results - page 68 / 177 » A Taste of Rewrite Systems |
ENTCS
2008
13 years 9 months ago
2008
We define transactional graph transformation systems (t-gtss), a mild extension of the ordinary framework for the double-pushout approach to graph transformation, which allows to ...
ICDE
2007
IEEE
14 years 10 months ago
2007
IEEE
We study the problem of answering queries posed on virtual views of XML documents, a problem commonly encountered when enforcing XML access control and integrating data. We approa...
ESOP
2007
Springer
14 years 3 months ago
2007
Springer
When students first learn programming, they often rely on a simple operational model of a program’s behavior to explain how particular features work. Because such models build o...
RTA
2007
Springer
14 years 3 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...
MST
2006
13 years 8 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...