Sciweavers

500 search results - page 42 / 100
» ACD Term Rewriting
Sort
View
ICDT
2011
ACM
270views Database» more  ICDT 2011»
14 years 1 months ago
On the equivalence of distributed systems with queries and communication
Distributed data management systems consist of peers that store, exchange and process data in order to collaboratively achieve a common goal, such as evaluate some query. We study...
Serge Abiteboul, Balder ten Cate, Yannis Katsis
CADE
2004
Springer
15 years 10 months ago
Model Checking Using Tabled Rewriting
LRR [3] is a rewriting system developed at the Computer Science Department of University of Houston. LRR has two subsystems: Smaran (for tabled rewriting), and TGR (for untabled re...
Zhiyao Liang
CTRS
1987
15 years 1 months ago
Confluence of Conditional Rewrite Systems
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
Nachum Dershowitz, Mitsuhiro Okada, G. Sivakumar
CADE
2008
Springer
15 years 10 months ago
Automated Complexity Analysis Based on the Dependency Pair Method
In this paper, we present a variant of the dependency pair method for analysing runtime complexities of term rewrite systems automatically. This method is easy to implement, but si...
Nao Hirokawa, Georg Moser
CADE
2003
Springer
15 years 10 months ago
Automating the Dependency Pair Method
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
Nao Hirokawa, Aart Middeldorp