Sciweavers

601 search results - page 8 / 121
» Quantified Equality Constraints
Sort
View
CADE
2006
Springer
14 years 9 months ago
Tree Automata with Equality Constraints Modulo Equational Theories
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
Florent Jacquemard, Laurent Vigneron, Michaël...
JACIII
2007
68views more  JACIII 2007»
13 years 8 months ago
Constraint Solving Specializations for Equality on an Interval-Variable Domain
Hiroshi Mabuchi, Kiyoshi Akama, Katsunori Miura, T...
AINA
2007
IEEE
14 years 3 months ago
Towards Quantifying the (In)Security of Networked Systems
Traditional security analyses are often geared towards cryptographic primitives or protocols. Although such analyses are absolutely necessary, they do not provide much insight for...
Xiaohu Li, T. Paul Parker, Shouhuai Xu
JAR
2006
236views more  JAR 2006»
13 years 8 months ago
Deciding Boolean Algebra with Presburger Arithmetic
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
Viktor Kuncak, Huu Hai Nguyen, Martin C. Rinard
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 8 months ago
An Efficient Algorithm for a Sharp Approximation of Universally Quantified Inequalities
This paper introduces a new algorithm for solving a subclass of quantified constraint satisfaction problems (QCSP) where existential quantifiers precede universally quantified ine...
Alexandre Goldsztejn, Claude Michel, Michel Rueher