851 search results - page 19 / 171 » Inaccessibility in Decision Procedures |
151
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quan...
141
click to vote
IFIP
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We consider two standard notions in formal security protocol analysis: message deducibility and static equivalence under equational theories. We present polynomial-time a...
152
click to vote
CADE
2012
Springer
13 years 6 months ago
2012
Springer
Combination of theories underlies the design of satisfiability modulo theories (SMT) solvers. The Nelson-Oppen framework can be used to build a decision procedure for the combinat...