Sciweavers

11740 search results - page 212 / 2348
» More Problems in Rewriting
Sort
View
PVLDB
2008
123views more  PVLDB 2008»
15 years 4 months ago
Dependable cardinality forecasts for XQuery
Though inevitable for effective cost-based query rewriting, the derivation of meaningful cardinality estimates has remained a notoriously hard problem in the context of XQuery. By...
Jens Teubner, Torsten Grust, Sebastian Maneth, She...
JAPLL
2010
104views more  JAPLL 2010»
15 years 3 months ago
Complete axiomatizations for XPath fragments
We provide complete axiomatizations for several fragments of XPath: sets of equivalences from which every other valid equivalence is derivable. Specifically, we axiomatize downwar...
Balder ten Cate, Tadeusz Litak, Maarten Marx
147
Voted
CORR
2011
Springer
175views Education» more  CORR 2011»
14 years 8 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
HICSS
2011
IEEE
183views Biometrics» more  HICSS 2011»
14 years 8 months ago
Optimizing Access across Multiple Hierarchies in Data Warehouses
In enterprise data warehouses, different users in different business units often define their own application specific dimension hierarchies tailor made to their reporting and b...
Lipyeow Lim, Bishwaranjan Bhattacharjee
179
Voted
FORTE
2011
14 years 8 months ago
Analyzing BGP Instances in Maude
Analyzing Border Gateway Protocol (BGP) instances is a crucial step in the design and implementation of safe BGP systems. Today, the analysis is a manual and tedious process. Resea...
Anduo Wang, Carolyn L. Talcott, Limin Jia, Boon Th...