Sciweavers

1302 search results - page 44 / 261
» Free-Style Theorem Proving
Sort
View
CADE
2008
Springer
14 years 8 months ago
On Automating the Calculus of Relations
Relation algebras provide abstract equational axioms for the calculus of binary relations. They name an established area of mathematics with various applications in computer scienc...
Georg Struth, Peter Höfner
ENTCS
2006
131views more  ENTCS 2006»
13 years 7 months ago
Cooperating Theorem Provers: A Case Study Combining HOL-Light and CVC Lite
This paper is a case study in combining theorem provers. We define a derived rule in HOL-Light, CVC PROVE, which calls CVC Lite and translates the resulting proof object back to HO...
Sean McLaughlin, Clark Barrett, Yeting Ge
TPHOL
2007
IEEE
14 years 2 months ago
Finding Lexicographic Orders for Termination Proofs in Isabelle/HOL
We present a simple method to formally prove termination of recursive functions by searching for lexicographic combinations of size measures. Despite its simplicity, the method tur...
Lukas Bulwahn, Alexander Krauss, Tobias Nipkow
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 1 months ago
Adaptive Security of Symbolic Encryption
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
Daniele Micciancio, Saurabh Panjwani
TCS
2010
13 years 6 months ago
Strong normalization property for second order linear logic
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
Michele Pagani, Lorenzo Tortora de Falco