Sciweavers

213 search results - page 4 / 43
» A framework for checking proofs naturally
Sort
View
CCS
1999
ACM
13 years 11 months ago
Proof-Carrying Authentication
We have designed and implemented a general and powerful distributed authentication framework based on higher-order logic. Authentication frameworks — including Taos, SPKI, SDSI,...
Andrew W. Appel, Edward W. Felten
GI
2001
Springer
13 years 12 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...
IFL
2007
Springer
221views Formal Methods» more  IFL 2007»
14 years 1 months ago
From Contracts Towards Dependent Types: Proofs by Partial Evaluation
Abstract. The specification and resolution of non-trivial domain constraints has become a well-recognised measure for improving the stability of large software systems. In this pa...
Stephan Herhut, Sven-Bodo Scholz, Robert Bernecky,...
LICS
1987
IEEE
13 years 11 months ago
A Framework for Defining Logics
The Edinburgh Logical Framework (LF) provides a means to define (or present) logics. It is based on a general treatment of syntax, rules, and proofs by means of a typed -calculus ...
Robert Harper, Furio Honsell, Gordon D. Plotkin
TYPES
1995
Springer
13 years 11 months ago
A Natural Deduction Approach to Dynamic Logic
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
Furio Honsell, Marino Miculan