1458 search results - page 19 / 292 » Extended Term Rewriting Systems |
118
Voted
UPP
2004
Springer
15 years 5 months ago
2004
Springer
The chemical reaction metaphor describes computation in terms of a chemical solution in which molecules interact freely according to reaction rules. Chemical solutions are represen...
102
Voted
IANDC
2007
15 years 13 days ago
2007
The Tyrolean Termination Tool (TTT for short) is a powerful tool for automatically proving termination of rewrite systems. It incorporates several new refinements of the dependen...
122
Voted
AMAST
2010
Springer
14 years 7 months ago
2010
Springer
mu-term is a tool which can be used to verify a number of termination properties of (variants of) Term Rewriting Systems (TRSs): termination of rewriting, termination of innermost ...
138
Voted
RTA
2011
Springer
14 years 3 months ago
2011
Springer
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient compl...
104
click to vote
SIGMOD
2004
ACM
16 years 19 days ago
2004
ACM
Current day database applications, with large numbers of users, require fine-grained access control mechanisms, at the level of individual tuples, not just entire relations/views,...