Sciweavers

23201 search results - page 37 / 4641
» Rewriting Systems with Data
Sort
View
WFLP
2000
Springer
82views Algorithms» more  WFLP 2000»
13 years 11 months ago
Strong and NV-sequentiality of constructor systems
Constructor Systems (CSs) are an important subclass of Term Rewriting Systems (TRSs) which can be used stract model of some programming languages. While normalizing strategies are...
Salvador Lucas
VLDB
2011
ACM
245views Database» more  VLDB 2011»
13 years 2 months ago
Normalization and optimization of schema mappings
Schema mappings are high-level specifications that describe the relationship between two database schemas. They are an important tool in several areas of database research, notab...
Georg Gottlob, Reinhard Pichler, Vadim Savenkov
SOFSEM
2010
Springer
14 years 4 months ago
Improved Matrix Interpretation
We present a new technique to prove termination of Term Rewriting Systems, with full automation. A crucial task in this context is to find suitable well-founded orderings. A popul...
Pierre Courtieu, Gladys Gbedo, Olivier Pons
AMAST
2008
Springer
13 years 9 months ago
Towards an Efficient Implementation of Tree Automata Completion
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...
Emilie Balland, Yohan Boichut, Thomas Genet, Pierr...
SIGPLAN
2002
13 years 7 months ago
Pattern-matching and rewriting rules for group indexed data structures
In this paper, we present a new framework for the definition of various data structures (including trees and arrays) together with a generic language of filters enabling a rule-ba...
Jean-Louis Giavitto, Olivier Michel, Julien Cohen