Sciweavers

203 search results - page 21 / 41
» Proof Reflection in Coq
Sort
View
ICFP
2012
ACM
13 years 4 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
111
Voted
JSYML
2006
97views more  JSYML 2006»
15 years 1 months ago
The proper forcing axiom and the singular cardinal hypothesis
We show that the Proper Forcing Axiom implies the Singular Cardinal Hypothesis. The proof uses the reflection principle MRP introduced by Moore in [11].
Matteo Viale
135
Voted
ESORICS
2005
Springer
15 years 7 months ago
Machine-Checked Security Proofs of Cryptographic Signature Schemes
Abstract. Formal methods have been extensively applied to the certification of cryptographic protocols. However, most of these works make the perfect cryptography assumption, i.e....
Sabrina Tarento
ICFEM
2003
Springer
15 years 7 months ago
Formal Proof of a Polychronous Protocol for Loosely Time-Triggered Architectures
The verification of safety critical systems has become an area of increasing importance in computer science. The notion of reactive system has emerged to concentrate on problems r...
Mickaël Kerboeuf, David Nowak, Jean-Pierre Ta...
126
Voted
ICFP
2008
ACM
16 years 1 months ago
Ynot: dependent types for imperative programs
We describe an axiomatic extension to the Coq proof assistant, that supports writing, reasoning about, and extracting higher-order, dependently-typed programs with side-effects. C...
Aleksandar Nanevski, Greg Morrisett, Avraham Shinn...