Sciweavers

602 search results - page 10 / 121
» Program Calculation in Coq
Sort
View
MPC
1995
Springer
93views Mathematics» more  MPC 1995»
14 years 1 months ago
Extracting Programs with Exceptions in an Impredicative Type System
Abstract. This paper is about exceptions handling using classical techniques of program extraction. We propose an impredicative formalization in the calculus of constructions and w...
Jean-François Monin
POPL
2012
ACM
12 years 5 months ago
Probabilistic relational reasoning for differential privacy
Differential privacy is a notion of confidentiality that protects the privacy of individuals while allowing useful computations on their private data. Deriving differential priva...
Gilles Barthe, Boris Köpf, Federico Olmedo, S...
SCP
2011
255views Communications» more  SCP 2011»
13 years 4 months ago
Map fusion for nested datatypes in intensional type theory
A definitional extension LNGMIt of the Calculus of Inductive Constructions (CIC), that underlies the proof assistant Coq, is presented that allows also to program with nested dat...
Ralph Matthes
FORTE
2011
13 years 1 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...
SAC
2006
ACM
14 years 3 months ago
Provably faithful evaluation of polynomials
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
Sylvie Boldo, César Muñoz