Sciweavers

2409 search results - page 6 / 482
» On Extended Regular Expressions
Sort
View
ESOP
2008
Springer
14 years 11 months ago
Regular Expression Subtyping for XML Query and Update Languages
Abstract. XML database query languages such as XQuery employ regular expression types with structural subtyping. Subtyping systems typically have two presentations, which should be...
James Cheney
ATVA
2010
Springer
217views Hardware» more  ATVA 2010»
14 years 10 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
SODA
2010
ACM
213views Algorithms» more  SODA 2010»
15 years 7 months ago
Regular Expression Matching with Multi-Strings
Regular expression matching is a key task (and often computational bottleneck) in a variety of software tools and applications. For instance, the standard grep and sed utilities, ...
Philip Bille, Mikkel Thorup
68
Voted
DBPL
2007
Springer
83views Database» more  DBPL 2007»
15 years 3 months ago
Succinctness of Pattern-Based Schema Languages for XML
Martens et al. defined a pattern-based specification language equivalent in expressive power to the widely adopted XML Schema definitions (XSDs). This language consists of rules...
Wouter Gelade, Frank Neven
ICALP
2000
Springer
15 years 1 months ago
Reasoning about Idealized ALGOL Using Regular Languages
We explain how recent developments in game semantics can be applied to reasoning about equivalence of terms in a non-trivial fragment of Idealized Algol (IA) by expressing sets of ...
Dan R. Ghica, Guy McCusker