Sciweavers

788 search results - page 34 / 158
» Symbolic Equivalence Checking
Sort
View
AAAI
2000
13 years 10 months ago
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Equivalency clauses (Xors or modulo 2 arithmetics) represent a common structure in the SAT-encoding of many hard real-world problems and constitute a major obstacle to DavisPutnam...
Chu Min Li
APLAS
2008
ACM
13 years 10 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
Abstract. Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...
SPIRE
2004
Springer
14 years 2 months ago
Longest Motifs with a Functionally Equivalent Central Block
This paper presents a generalization of the notion of longest repeats with a block of k don’t care symbols introduced by [8] (for k fixed) to longest motifs composed of three pa...
Maxime Crochemore, Raffaele Giancarlo, Marie-Franc...
AMW
2011
13 years 13 days ago
Bag Equivalence of Bounded Symmetry-Degree Conjunctive Queries with Inequalities
Abstract. We consider the problem of checking equivalence of conjunctive queries with inequalities under bag (multiset) semantics. The problem is known to be decidable in pspace an...
Mingmin Chen, Todd J. Green
ENTCS
2006
103views more  ENTCS 2006»
13 years 8 months ago
Static Equivalence is Harder than Knowledge
There are two main ways of defining secrecy of cryptographic protocols. The first version checks if the adversary can learn the value of a secret parameter. In the second version,...
Johannes Borgström