Results 1  10
of
429
The NonApproximability of NonBoolean Predicates
 Trevisan (Eds.), Proceedings of 5th International Workshop on Randomization and Approximation Techniques in Computer Science
, 2001
"... Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactiv ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
Constraint satisfaction programs where each constraint depends on a constant number of variables have the following property: The randomized algorithm that guesses an assignment uniformly at random satisfies an expected constant fraction of the constraints. By combining constructions from interactive proof systems with harmonic analysis over finite groups, Hstad showed that for several constraint satisfaction programs this naive algorithm is essentially the best possible unless P = NP.
Statistical Debugging Using Compound Boolean Predicates
, 2007
"... Statistical debugging uses dynamic instrumentation and machine learning to identify predicates on program state that are strongly predictive of program failure. Prior approaches have only considered simple, atomic predicates such as the directions of branches or the return values of function calls. ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
. We enrich the predicate vocabulary by adding complex Boolean formulae derived from these simple predicates. We draw upon threevalued logic, static program structure, and statistical estimation techniques to efficiently sift through large numbers of candidate Boolean predicate formulae. We present
On the Representation of Boolean Predicates of the DiffieHellman Function
 Proceedings of 20th International Symposium on Theoretical Aspects of Computer Science
, 2003
"... In this work we give a nontrivial upper bound on the spectral norm of various Boolean predicates of the DiffieHellman function. For instance, we consider every individual bit and arbitrary unbiased intervals. Combining the bound with recent results from complexity theory we can rule out the possib ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this work we give a nontrivial upper bound on the spectral norm of various Boolean predicates of the DiffieHellman function. For instance, we consider every individual bit and arbitrary unbiased intervals. Combining the bound with recent results from complexity theory we can rule out
ABSTRACT Statistical Debugging Using Compound Boolean Predicates ∗
"... Statistical debugging uses dynamic instrumentation and machine learning to identify predicates on program state that are strongly predictive of program failure. Prior approaches have only considered simple, atomic predicates such as the directions of branches or the return values of function calls. ..."
Abstract
 Add to MetaCart
. We enrich the predicate vocabulary by adding complex Boolean formulae derived from these simple predicates. We draw upon threevalued logic, static program structure, and statistical estimation techniques to efficiently sift through large numbers of candidate Boolean predicate formulae. We present
Verifying Systems with Integer Constraints and Boolean Predicates: A Composite Approach
 In Proceedings of the 1998 ACM/SIGSOFT International Symposium on Software Testing and Analysis (ISSTA'98
, 1998
"... Symbolic model checking has proved highly successful for large finitestate systems, in which states can be compactly encoded using binary decision diagrams (BDDs) or their variants. The inherent limitation of this approach is that it cannot be applied to systems with an infinite number of states  ..."
Abstract

Cited by 23 (5 self)
 Add to MetaCart
in its treatment of Boolean and (unordered) enumerated types  which possess no natural mapping to the Euclidean coordinate space. In this paper we describe a model checker which combines the strengths of both approaches. We use a composite model, in which a formula's valuations are encoded in a
GPXMatcher: A generic Boolean predicatebased XPath Expression matcher
 EDBT’11
, 2011
"... Contentbased architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Contentbased architectures for XML data dissemination are gaining increasing attention both in academia and industry. These dissemination networks are the building blocks of selective information dissemination applications which have wide applicability such as sharing and integrating information in both scientific and corporate domains. At the heart of these dissemination services is a fast engine for matching of an incoming XML message against stored XPath expressions to determine interested consumers for the message. To achieve the ultralow response time, predominant in financial message processing, the XPath expression matching must be done efficiently. In this paper, we develop and evaluate a novel algorithm based on a unique encoding of XPath expressions and XML messages, unlike dominating automatonbased algorithms, for efficiently solving this matching problem. We demonstrate a matching time in the millisecond range for millions of XPath expressions which significantly outperforms stateoftheart algorithms.
A private interactive test of a Boolean predicate and minimumknowledge publickey cryptosystems (Extended Abstract)
 IN PROC. 26TH FOCS
, 1985
"... We introduce a new twc>party protocol witb tbe rollowinl properties: 1. The protocol giYes a proor or the niue, 0 or I, or a particular Boolean predicate which is (a.s.sumed to be) hard to compute. This extends tbe 'inter&etiu proor systems ' or 171, which are only used to prou th ..."
Abstract

Cited by 32 (1 self)
 Add to MetaCart
We introduce a new twc>party protocol witb tbe rollowinl properties: 1. The protocol giYes a proor or the niue, 0 or I, or a particular Boolean predicate which is (a.s.sumed to be) hard to compute. This extends tbe 'inter&etiu proor systems ' or 171, which are only used to prou
A hardcore predicate for all oneway functions
 In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing
, 1989
"... Abstract rity of f. In fact, for inputs (to f*) of practical size, the pieces effected by f are so small A central tool in constructing pseudorandom that f can be inverted (and the “hardcore” generators, secure encryption functions, and bit computed) by exhaustive search. in other areas are “hardc ..."
Abstract

Cited by 440 (5 self)
 Add to MetaCart
core ” predicates b In this paper we show that every oneof functions (permutations) f, discovered in way function, padded to the form f(p,z) = [Blum Micali $21. Such b ( 5) cannot be effi (P,9(X)), llPl / = 11z//, has bY itself a hardcore ciently guessed (substantially better than SO predicate of the same
Access path selection in a relational database management system
, 1979
"... ABSTRACT: In a high level query and data manipulation language such as SQL, requests are stated nonprocedurally, without reference to access paths. This paper describes how System R chooses access paths for both simple (single relation) and complex queries (such as joins), given a user specificatio ..."
Abstract

Cited by 587 (1 self)
 Add to MetaCart
specification of desired data as a boolean expression of predicates. System R is an experimental database management system developed to carry out research on the relational model of data. System R was designed and built by members of the IBM San Jose Research'Laboratory. 1.
Simplification by cooperating decision procedures
 ACM Transactions on Programming Languages and Systems
, 1979
"... A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean connectiv ..."
Abstract

Cited by 455 (2 self)
 Add to MetaCart
A method for combining decision procedures for several theories into a single decision procedure for their combination is described, and a simplifier based on this method is discussed. The simplifier finds a normal form for any expression formed from individual variables, the usual Boolean
Results 1  10
of
429