Sciweavers

281 search results - page 34 / 57
» Querying the Guarded Fragment
Sort
View
CIKM
2008
Springer
15 years 4 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
POPL
2003
ACM
16 years 2 months ago
Discovering affine equalities using random interpretation
We present a new polynomial-time randomized algorithm for discovering affine equalities involving variables in a program. The key idea of the algorithm is to execute a code fragme...
Sumit Gulwani, George C. Necula
ACNS
2007
Springer
112views Cryptology» more  ACNS 2007»
15 years 8 months ago
A New Protocol for Conditional Disclosure of Secrets and Its Applications
Many protocols that are based on homomorphic encryption are private only if a client submits inputs from a limited range S. Conditional disclosure of secrets (CDS) helps to overcom...
Sven Laur, Helger Lipmaa
CONCUR
2006
Springer
15 years 3 months ago
Inference of Event-Recording Automata Using Timed Decision Trees
In regular inference, the problem is to infer a regular language, typically represented by a deterministic finite automaton (DFA) from answers to a finite set of membership querie...
Olga Grinchtein, Bengt Jonsson, Paul Pettersson
CSE
2009
IEEE
14 years 11 months ago
Verifying the Interplay of Authorization Policies and Workflow in Service-Oriented Architectures
Abstract--A widespread design approach in distributed applications based on the service-oriented paradigm, such as web-services, consists of clearly separating the enforcement of a...
Michele Barletta, Silvio Ranise, Luca Viganò...