367 search results - page 10 / 74 » A Rewriting Logic Sampler |
149
Voted
TCS
2002
15 years 3 months ago
2002
This paper explores the application of rewriting logic to the executable formal modeling of real-time and hybrid systems. We give general techniques by which such systems can be s...
111
click to vote
CADE
1992
Springer
15 years 7 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...
132
click to vote
CADE
2008
Springer
15 years 5 months ago
2008
Springer
Recent studies have provided many characterisations of the class of polynomial time computable functions through term rewriting techniques. In this paper we describe a (fully autom...
124
Voted
WOODPECKER
2001
15 years 4 months ago
2001
Maude is an executable rewriting logic language specially well suited for the specification of object-oriented open and distributed systems. In this paper we explore the possibilit...
111
Voted
CADE
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...