882 search results - page 50 / 177 » A Taste of Rewrite Systems |
118
Voted
RTA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. In this paper we present some new refinements of the dependency pair method for automatically proving the termination of term rewrite systems. These refinements are ver...
90
Voted
CADE
1992
Springer
15 years 4 months ago
1992
Springer
The ability to use a polynomial iterpretation to prove termination of a rewrite system naturally prompts the question as to what restriction on complexity this imposes. The main r...
ALP
1994
Springer
15 years 4 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
155
Voted
ISSE
2011
14 years 7 months ago
2011
Application developers utilizing event-based middleware have sought to leverage domain-specific modeling for the advantages of intuitive specification, code synthesis, and suppo...
122
Voted
ASE
2005
15 years 13 days ago
2005
Techniques for efficiently evaluating future time Linear Temporal Logic (abbreviated LTL) formulae on finite execution traces are presented. While the standard models of LTL are i...