3970 search results - page 526 / 794 » A Logic For Causal Reasoning |
186
click to vote
CADE
2005
Springer
16 years 7 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
162
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
This paper presents on-going researches on theoretical and practical issues of combining rewriting based automated theorem proving and user-guided proof development, with the stron...
165
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Developing automatable methods for proving termination of term rewrite systems that resist traditional techniques based on simplification orders has become an active research area ...
176
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
If there exist efficient procedures (canonizers) for reducing terms of two first-order theories to canonical form, can one use them to construct such a procedure for terms of the d...
190
click to vote
CADE
2003
Springer
16 years 7 months ago
2003
Springer
Abstract. We present an abstract view of existential variables in a dependently typed lambda-calculus based on modal type theory. This allows us to justify optimizations to pattern...