851 search results - page 19 / 171 » Inaccessibility in Decision Procedures |
JSAT
2007
14 years 10 months ago
2007
FUIN
2002
14 years 10 months ago
2002
104
click to vote
SIAMCOMP
2002
14 years 10 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...
IFIP
2010
Springer
14 years 5 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...
109
click to vote
CADE
2012
Springer
13 years 21 days 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...