2585 search results - page 372 / 517 » Automating Coherent Logic |
184
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
186
click to vote
CADE
2009
Springer
16 years 7 months ago
2009
Springer
The dependency pair framework is a powerful technique for proving termination of rewrite systems. One of the most frequently used methods within the dependency pair framework is t...
195
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. We introduce the notion of array-based system as a suittraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-...
155
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Abstract. This paper describes the translation of proofs in the Thousands of Solutions from Theorem Provers (TSTP) solution library to the Proof Markup Language (PML), and the subs...
144
click to vote
CADE
2008
Springer
16 years 6 months ago
2008
Springer
Bit vectors and bit operations are proposed for efficient propositional inference. Bit arithmetic has efficient software and hardware implementations, which can be put to advantage...