882 search results - page 97 / 177 » A Taste of Rewrite Systems |
DAGSTUHL
2007
13 years 10 months ago
2007
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
ENTCS
2006
13 years 8 months ago
2006
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
ENTCS
2006
13 years 8 months ago
2006
Properties such as logging, persistence, debugging, tracing, distribution, performance monitoring and exception handling occur in most programming paradigms and are normally very ...
ENTCS
2006
13 years 8 months ago
2006
We present a prototype implementation of SOS meta-theory in the Maude term rewriting language. The prototype defines the basic concepts of SOS meta-theory (e.g., transition formul...
ENTCS
2006
13 years 8 months ago
2006
We present an operational semantics for a component composition language called Reo. Reo connectors exogenously compose and coordinate the interactions among individual components...