Sciweavers

164 search results - page 12 / 33
» Rewriting Extended Regular Expressions
Sort
View
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
15 years 2 months ago
LTL Can Be More Succinct
Abstract. It is well known that modelchecking and satisfiability of Linear Temporal Logic (LTL) are Pspace-complete. Wolper showed that with grammar operators, this result can be e...
Kamal Lodaya, A. V. Sreejith
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
16 years 2 months ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
KES
2007
Springer
15 years 7 months ago
A Rewrite Based Approach for Enforcing Access Constraints for XML
Abstract. Access control for semi-structured data is nontrivial, as witnessed by the number of access control approaches in recent literature. Recently a case has been made for exp...
Sriram Mohan, Arijit Sengupta, Yuqing Wu
IDEAS
2009
IEEE
142views Database» more  IDEAS 2009»
15 years 8 months ago
A magic approach to optimizing incremental relational expressions
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd’s relational algebra which allows for defining derived relatio...
Andreas Behrend
ICTAC
2007
Springer
15 years 7 months ago
On the Expressive Power of QLTL
LTL cannot express the whole class of ω-regular languages and several extensions have been proposed. Among them, Quantified propositional Linear Temporal Logic (QLTL), proposed b...
Zhilin Wu