Results 1  10
of
389
Modular verification of software components in C
 IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
, 2003
"... We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompose the verification of large software systems into subproblems of manageable complexity. The decomposition reflects the mo ..."
Abstract

Cited by 233 (23 self)
 Add to MetaCart
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompose the verification of large software systems into subproblems of manageable complexity. The decomposition reflects
Query Evaluation via TreeDecompositions
 JOURNAL OF THE ACM
, 2001
"... A number of efficient methods for evaluating firstorder and monadicsecond order queries on finite relational structures are based on treedecompositions of structures or queries. We systematically study these methods. In the first part of the paper we consider arbitrary formulas on treelike struc ..."
Abstract

Cited by 105 (16 self)
 Add to MetaCart
like formulas on arbitrary structures. We generalize the notions of acyclicity and bounded treewidth from conjunctive queries to arbitrary firstorder formulas in a straightforward way and analyze the complexity of evaluating formulas of these fragments. Moreover, we show that the acyclic and bounded tree
Reformulation of xml queries and constraints
 In ICDT’03
, 2003
"... Abstract. We state and solve the query reformulation problem for XML publishing in a general setting that allows mixed (XML and relational) storage for the proprietary data and exploits redundancies (materialized views, indexes and caches) to enhance performance. The correspondence between published ..."
Abstract

Cited by 103 (15 self)
 Add to MetaCart
published and proprietary schemas is specified by views in both directions, and the same algorithm performs rewritingwithviews, compositionwithviews, or the combined effect of both, unifying the GlobalAsView and LocalAsView approaches to data integration. We prove a completeness theorem which
Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
 in Proc. of the 19th IEEE Conference on Computational Complexity
, 2004
"... Abstract. We prove a very general lower bound technique for quantum and randomized query complexity that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique generalizes the weighted and unweighted methods of Ambainis ..."
Abstract

Cited by 50 (3 self)
 Add to MetaCart
Abstract. We prove a very general lower bound technique for quantum and randomized query complexity that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique generalizes the weighted and unweighted methods
Approximation Theory of Output Statistics
 IEEE Trans. Inform. Theory
, 1993
"... AbstractGiven a channel and an input process, the minimum randomness of those input processes whose output statistics approximate the original output statistics with arbitrary accuracy is studied. The notion of resolvability of a channel, defined as the number of random bits required per channel us ..."
Abstract

Cited by 171 (11 self)
 Add to MetaCart
of the channel coding theorem. Index Terms Shannon theory, channel output statistics, resolvability, random number generation complexity; channel capacity, noiseless source coding theorem, identification via channels. T
A strong direct product theorem for quantum query complexity.
 In Proceedings of the 27th IEEE Conference on Computational Complexity,
, 2012
"... Abstract. We show that quantum query complexity satisfies a strong direct product theorem. This means that computing k copies of a function with fewer than k times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially small ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Abstract. We show that quantum query complexity satisfies a strong direct product theorem. This means that computing k copies of a function with fewer than k times the quantum queries needed to compute one copy of the function implies that the overall success probability will be exponentially
Kolmogorov Complexity and the Second Incompleteness Theorem
 Arch. Math. Logic
, 1997
"... : We shall prove the second incompleteness theorem via Kolmogorov complexity. 0. Introduction Kolmogorov complexity is a measure of the quantity of information in nite objects. Roughly speaking, the Kolmogorov complexity of a number n, denoted by K(n), is the size of a program which generates n, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
: We shall prove the second incompleteness theorem via Kolmogorov complexity. 0. Introduction Kolmogorov complexity is a measure of the quantity of information in nite objects. Roughly speaking, the Kolmogorov complexity of a number n, denoted by K(n), is the size of a program which generates n
Query Evaluation with Constant Delay
"... I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available for dis ..."
Abstract
 Add to MetaCart
I am grateful to Luc Segoufin who kindly accepted me to be his PhD student. He introduced me to the problem of query enumeration and encouraged me to look for the answers to all the questions that emerged during our collaboration. He was a truly great advisor, always supportive and available
Anonymous Hierarchical IdentityBased Encryption (Without Random Oracles). In: Dwork
 CRYPTO 2006. LNCS,
, 2006
"... Abstract We present an identitybased cryptosystem that features fully anonymous ciphertexts and hierarchical key delegation. We give a proof of security in the standard model, based on the mild Decision Linear complexity assumption in bilinear groups. The system is efficient and practical, with sm ..."
Abstract

Cited by 119 (10 self)
 Add to MetaCart
well formed, and the simulator behaved as in game Γ 1 . If instead Y is independent of z 1 , z 2 , s, s 1 , s 2 , which happens when Z is random, then the simulator responded as in game Γ 2 . Phase 2: The simulator answer the query in the same way as Phase 1. Output: The adversary outputs a bit γ
A Compositional Framework for Complex Queries over Uncertain Data
"... The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confidences is computationally hard, however, and has to be approximated in practice. In a compositional query language, even ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confidences is computationally hard, however, and has to be approximated in practice. In a compositional query language, even
Results 1  10
of
389