Sciweavers

Share
JSC
2010
102views more  JSC 2010»
8 years 1 months ago
Equational approximations for tree automata completion
In this paper we deal with the verification of safety properties of infinite-state systems modeled by term-rewriting systems. An over-approximation of the set of reachable terms...
Thomas Genet, Vlad Rusu
TCS
1998
8 years 2 months ago
Bubbles in Modularity
We provide a global technique, called neatening, for the study of modularity of left-linear Term Rewriting Systems. Objects called bubbles are identi ed as the responsibles of mos...
Massimo Marchiori
ENTCS
2002
76views more  ENTCS 2002»
8 years 3 months ago
Four equivalent equivalences of reductions
Two co-initial reductions in a term rewriting system are said to be equivalent if they perform the same steps, albeit maybe in a different order. We present four characterisations...
Vincent van Oostrom, Roel C. de Vrijer
ENTCS
2007
85views more  ENTCS 2007»
8 years 3 months ago
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
We present a technique for inducing functional programs from few, well chosen input/output-examples (I/Oexamples). Potential applications for automatic program or algorithm induct...
Emanuel Kitzelmann, Ute Schmid
CORR
2007
Springer
80views Education» more  CORR 2007»
8 years 3 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud
CORR
2006
Springer
120views Education» more  CORR 2006»
8 years 3 months ago
Termination orders for 3-dimensional rewriting
Abstract: This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource ma...
Yves Guiraud
ENTCS
2008
85views more  ENTCS 2008»
8 years 3 months ago
Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
Yi and Sakai [9] showed that the termination problem is a decidable property for the class of semi-constructor term rewriting systems, which is a superclass of the class of right ...
Keita Uchiyama, Masahiko Sakai, Toshiki Sakabe
ECEASST
2008
82views more  ECEASST 2008»
8 years 3 months ago
Interaction nets: programming language design and implementation
: This paper presents a compiler for interaction nets, which, just like term rewriting systems, are user-definable rewrite systems which offer the ability to specify and program. I...
Abubakar Hassan, Ian Mackie, Shinya Sato
CORR
2010
Springer
126views Education» more  CORR 2010»
8 years 3 months ago
Well-definedness of Streams by Transformation and Termination
Streams are infinite sequences over a given data type. A stream specification is a set of equations intended to define a stream. We propose a transformation from such a stream spec...
Hans Zantema
CATS
2006
8 years 4 months ago
Learnability of Term Rewrite Systems from Positive Examples
Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewri...
M. R. K. Krishna Rao
books