Results 1  10
of
2,626,082
An Efficient Decision Procedure . . . Constraints
, 2005
"... A unit two variable per inequality (UTVPI) constraint is of the form a.x+b.y ≤ d where x and y are integer variables, the coefficients a, b ∈ {−1, 0, 1} and the bound d is an integer constant. This paper presents an efficient decision procedure for UTVPI constraints. Given m such constraints over ..."
Abstract
 Add to MetaCart
A unit two variable per inequality (UTVPI) constraint is of the form a.x+b.y ≤ d where x and y are integer variables, the coefficients a, b ∈ {−1, 0, 1} and the bound d is an integer constant. This paper presents an efficient decision procedure for UTVPI constraints. Given m such constraints over
Efficient Decision Procedures for Heaps using
"... Abstract. The Strand [10] logic allows expressing structural properties of heaps combined with the data stored in the nodes of the heap. A semantic fragment of Strand as well as a syntactically defined subfragment of it are known to be decidable [10]. The known decision procedure works by combining ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The Strand [10] logic allows expressing structural properties of heaps combined with the data stored in the nodes of the heap. A semantic fragment of Strand as well as a syntactically defined subfragment of it are known to be decidable [10]. The known decision procedure works by combining
Design and Implementation of Efficient Decision Procedures
"... Strengthening the Heart of an SMTSolver ..."
FAST: An Efficient Decision Procedure for Deduction and Static Equivalence
"... Message deducibility and static equivalence are central problems in symbolic security protocol analysis. We present Fast, an efficient decision procedure for these problems under subtermconvergent equational theories. Fast is a C++ implementation of an improved version of the algorithm presented in ..."
Abstract
 Add to MetaCart
Message deducibility and static equivalence are central problems in symbolic security protocol analysis. We present Fast, an efficient decision procedure for these problems under subtermconvergent equational theories. Fast is a C++ implementation of an improved version of the algorithm presented
An Efficient Decision Procedure for Imperative Tree Data Structures ⋆
"... Abstract. We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is cl ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
Abstract. We present a new decidable logic called TREX for expressing constraints about imperative tree data structures. In particular, TREX supports a transitive closure operator that can express reachability constraints, which often appear in data structure invariants. We show that our logic is closed under weakest precondition computation, which enables its use for automated software verification. We further show that satisfiability of formulas in TREX is decidable in NP. The low complexity makes it an attractive alternative to more expensive logics such as monadic secondorder logic (MSOL) over trees, which have been traditionally used for reasoning about tree data structures. 1
Efficient Decision Procedures for Query Containment and Related Problems
 XXIV SIMPÓSIO BRASILEIRO DE BANCO DE DADOS
"... The subsumption problem in Description Logics (DL) refers to the question of deciding if a concept description always denotes a subset of the set denoted by another concept description. This paper explores reductions of query containment and other problems to the subsumption problem in DL. It first ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
. It first selects a DL dialect that is expressive enough to cover familiar classes of integrity constraints and query expressions. Then, it describes how to modify the tableau decision procedure for the subsumption problem to account for the classes of integrity constraints considered. Finally
An Efficient Decision Procedure for S1S
"... Decision procedures for arithmetics are useful for the verification of digital systems, since these methods can be used for the verification of temporal properties as well as for proving lemmata about data paths in arithmetic circuits. For the specification of temporal properties, the monadic seco ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
second order arithmetic of one successor (S1S) is of particular interest. Büchi already developed a decision procedure for S1S that is based on a translation of S1S to nondeterministic !automata. However, he was only interested in the decidability of S1S and did not worry about the efficiency of his
An Efficient Decision Procedure for S1S1
"... Abstract. Decision procedures for arithmetics are useful for the verification of digital systems, since these methods can be used for the verification of temporal properties as well as for proving lemmata about data paths in arithmetic circuits. For the specification of temporal properties, the mo ..."
Abstract
 Add to MetaCart
, the monadic second order arithmetic of one successor (S1S) is of particular interest. Büchi already developed a decision procedure for S1S that is based on a translation of S1S to nondeterministic automata. However, he was only interested in the decidability of S1S and did not worry about the efficiency
Efficient Decision Procedure for a Logic for XML
"... Abstract. In this paper, we investigate formal verification techniques to solve decision problems in the world of XML. Such problems can be uniformly modeled by formulas of a modal logic defined on XML trees and having general least and greatest fixpoint operators. This logic, called BTL, can be see ..."
Abstract
 Add to MetaCart
be seen as a variation on alternatingfree full µcalculus. BTL sufficiently captures XPath, a path language for querying XML, and thus models typechecking problems for XPathbased XML transformation. We then give an efficient procedure that decides the satisfiability of a formula of this logic, which
Efficient Decision Procedures for Message Deducibility and Static Equivalence
"... Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomialtime algorithms for deciding both problems under subterm convergent equational theories and under a theory representing symmet ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomialtime algorithms for deciding both problems under subterm convergent equational theories and under a theory representing symmetric encryption with the prefix property. For subterm convergent theories, polynomialtime algorithms for both problems are wellknown. However, we achieve a significantly better asymptotic complexity than existing approaches. For the prefix theory, we are not aware of any polynomialtime algorithms for static equivalence. As an application, we use our algorithm for static equivalence to discover offline guessing attacks on the Kerberos protocol when implemented using a symmetric encryption scheme for which the prefix property holds. Key words: security protocols, equational theories, deducibility, static equivalence 1
Results 1  10
of
2,626,082