85 search results - page 12 / 17 » Decidability of Trajectory-Based Equations |
109
click to vote
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
99
Voted
SP
2005
IEEE
15 years 5 months ago
2005
IEEE
An apparently prevailing myth is that safety is undecidable in Discretionary Access Control (DAC); therefore, one needs to invent new DAC schemes in which safety analysis is decid...
93
Voted
LICS
2003
IEEE
15 years 5 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
93
Voted
ICS
2010
Tsinghua U.
15 years 3 months ago
2010
Tsinghua U.
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
106
Voted
JSC
2010
14 years 6 months ago
2010
Both Sequence and Context Unification generalize the same problem: Word Unification. Besides that, Sequence Unification solves equations between unranked terms involving sequence ...