Sciweavers

1101 search results - page 102 / 221
» Forcing in proof theory
Sort
View
CCR
2000
101views more  CCR 2000»
15 years 17 days ago
Knowledge-proof based versatile smart card verification protocol
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Dae Hun Nyang, Joo-Seok Song
76
Voted
EATCS
2000
85views more  EATCS 2000»
15 years 17 days ago
A New Zero-One Law and Strong Extension Axioms
One of the previous articles in this column was devoted to the zero-one laws for a number of logics playing prominent role in finite model theory: first-order logic FO, the extens...
Andreas Blass, Yuri Gurevich
119
Voted
STTT
2010
122views more  STTT 2010»
14 years 11 months ago
Rodin: an open toolset for modelling and reasoning in Event-B
Event-B is a formal method for system-level modelling and analysis. Key features of Event-B are the use of set theory as a modelling notation, the use of ent to represent systems a...
Jean-Raymond Abrial, Michael J. Butler, Stefan Hal...
138
Voted
ICFEM
2009
Springer
14 years 10 months ago
Implementing a Direct Method for Certificate Translation
Abstract. Certificate translation is a method that transforms certificates of source programs into certificates of their compilation. It provides strong guarantees on low-level cod...
Gilles Barthe, Benjamin Grégoire, Sylvain H...
CACM
2010
97views more  CACM 2010»
14 years 10 months ago
Certified software
Certified software consists of a machine-executable program plus a formal machine-checkable proof that the software is free of bugs with respect to a claim of dependability. The c...
Zhong Shao