882 search results - page 110 / 177 » A Taste of Rewrite Systems |
SOFSEM
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. The dependency pair method is a powerful method for automatically proving termination of rewrite systems. When used with traditional simplification orders like LPO and K...
LPAR
2005
Springer
14 years 2 months ago
2005
Springer
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingre...
RTA
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity, IP-monotonicity for short. This p...
COOPIS
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper we propose a mediator architecture for the querying and integration of Web-accessible XML data sources. Our contributions are (i) the definition of a simple but expr...
ICALP
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. We prove a new congruence result for the π-calculus: bisimilarity is a congruence in the sub-calculus that does not include restriction nor sum, and features top-level r...