Sciweavers

164 search results - page 25 / 33
» Rewriting Extended Regular Expressions
Sort
View
DOCENG
2009
ACM
14 years 3 months ago
On the analysis of queries with counting constraints
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
Everardo Bárcenas, Pierre Genevès, N...
DLT
2006
13 years 10 months ago
Closure of Language Classes Under Bounded Duplication
Duplication is an operation generating a language from a single word by iterated application of rewriting rules u uu on factors. We extend this operation to entire languages and i...
Masami Ito, Peter Leupold, Kayoko Shikishima-Tsuji
CSL
2006
Springer
14 years 9 days ago
Game Quantification on Automatic Structures and Hierarchical Model Checking Games
Game quantification is an expressive concept and has been studied in model theory and descriptive set theory, especially in relation to infinitary logics. Automatic structures on t...
Lukasz Kaiser
LPNMR
2001
Springer
14 years 1 months ago
plp: A Generic Compiler for Ordered Logic Programs
Abstract This paper describes a generic compiler, called plp, for translating ordered logic programs into standard logic programs under the answer set semantics. In an ordered logi...
James P. Delgrande, Torsten Schaub, Hans Tompits
LPAR
2007
Springer
14 years 2 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...