13383 search results - page 125 / 2677 » Abstractions from proofs |
175
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. Loosely speaking, an interactive proof is said to be zeroknowledge if the view of every “efficient” verifier can be “efficiently” simulated. An outstanding open ...
127
click to vote
KBSE
1997
IEEE
15 years 10 months ago
1997
IEEE
Abstract: This paper describes some tools to support formal methods, and conversely some formal methods for developing such tools. We focus on distributed cooperative proving over ...
160
click to vote
ITP
2010
15 years 10 months ago
2010
Abstract. We present a compiler for definitions made by pattern matching on inductive families in the Coq system. It allows to write structured, recursive dependently-typed functi...
156
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We investigate a modification of the sequent calculus which s a first-order proof into its abstract deductive structure and a unifier which renders this structure a valid proof. We...
169
click to vote
TC
2011
15 years 1 months ago
2011
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...