96 search results - page 15 / 20 » On Several Proofs of the Recognizability Theorem |
114
click to vote
CSFW
1999
IEEE
15 years 1 months ago
1999
IEEE
We propose an efficient automatic checking algorithm, Athena, for analyzing security protocols. Athena incorporates a logic that can express security properties including authenti...
127
click to vote
LPAR
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. The TPTP World is a well established infrastructure supporting research, development, and deployment of Automated Theorem Proving systems. Recently, the TPTP World has be...
PADL
2004
Springer
15 years 2 months ago
2004
Springer
Gentzen’s Hauptsatz – cut elimination theorem – in sequent calculi reveals a fundamental property on logic connectives in various logics such as classical logic and intuition...
UTP
2010
14 years 8 months ago
2010
In this paper, we present various extensions of Isabelle/HOL by theories that are essential for several formal methods. First, we explain how we have developed an Isabelle/HOL theo...
156
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Machine-checked proofs of properties of programming languages have become a critical need, both for increased confidence in large and complex designs and as a foundation for techn...