1199 search results - page 68 / 240 » Parameterized Proof Complexity |
132
click to vote
LATIN
2004
Springer
15 years 6 months ago
2004
Springer
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
COCO
2008
Springer
15 years 2 months ago
2008
Springer
A central question in quantum information theory and computational complexity is how powerful nonlocal strategies are in cooperative games with imperfect information, such as mult...
CRYPTO
2006
Springer
15 years 4 months ago
2006
Springer
This paper presents the first automatic technique for proving not only protocols but also primitives in the exact security computational model. Automatic proofs of cryptographic pr...
89
Voted
LICS
2005
IEEE
15 years 6 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
ICNP
1998
IEEE
15 years 5 months ago
1998
IEEE
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequen...