Sciweavers

93 search results - page 3 / 19
» A Hierarchy of Semantics for Non-deterministic Term Rewritin...
Sort
View
FOSSACS
2007
Springer
14 years 4 months ago
The Rewriting Calculus as a Combinatory Reduction System
The last few years have seen the development of the rewriting calculus (also called rho-calculus or ρ-calculus) that uniformly integrates first-order term rewriting and λ-calcul...
Clara Bertolissi, Claude Kirchner
CSL
2007
Springer
14 years 2 months ago
Comparing the Expressive Power of Well-Structured Transition Systems
We compare the expressive power of a class of well-structured transition systems that includes relational automata, Petri nets, lossy channel systems, and constrained multiset rewr...
Parosh Aziz Abdulla, Giorgio Delzanno, Laurent Van...
ENTCS
2008
85views more  ENTCS 2008»
13 years 10 months ago
Innermost Termination of Rewrite Systems by Labeling
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
René Thiemann, Aart Middeldorp
CADE
2006
Springer
14 years 11 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
IAJIT
2010
166views more  IAJIT 2010»
13 years 9 months ago
Specification and Prototyping of Reactive Distributed Systems with Algebraic Term Nets
: The specification of the dynamic behaviour of reactive distributed systems must exhibit the structures of control and has to imply explicitly the relevant aspects of the distribu...
Faiza Bouchoul, Mohamed Mostefai