Sciweavers

23201 search results - page 80 / 4641
» Rewriting Systems with Data
Sort
View
CIKM
2004
Springer
15 years 10 months ago
QFilter: fine-grained run-time XML access control via NFA-based query rewriting
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...
Bo Luo, Dongwon Lee, Wang-Chien Lee, Peng Liu
PVLDB
2010
119views more  PVLDB 2010»
15 years 3 months ago
Chase Termination: A Constraints Rewriting Approach
Several database areas such as data exchange and integration share the problem of fixing database instance violations with respect to a set of constraints. The chase algorithm so...
Francesca Spezzano, Sergio Greco
RTA
2009
Springer
15 years 11 months ago
VMTL-A Modular Termination Laboratory
Abstract. The automated analysis of termination of term rewriting systems (TRSs) has drawn a lot of attention in the scientific community during the last decades and many differe...
Felix Schernhammer, Bernhard Gramlich
DANCE
2002
IEEE
15 years 10 months ago
Maude as a Wide-Spectrum Framework for Formal Modeling and Analysis of Active Networks
Modeling and formally analyzing active network systems and protocols is quite challenging, due to their highly dynamic nature and the need for new network models. We propose a wid...
José Meseguer, Peter Csaba Ölveczky, M...
RTA
2010
Springer
15 years 9 months ago
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling
Decreasing diagrams technique (van Oostrom, 1994) is a technique that can be widely applied to prove confluence of rewrite systems. To directly apply the decreasing diagrams techn...
Takahito Aoto