Sciweavers

71 search results - page 7 / 15
» Correct rounding of algebraic functions
Sort
View
ACNS
2010
Springer
134views Cryptology» more  ACNS 2010»
14 years 10 months ago
Efficient and Secure Evaluation of Multivariate Polynomials and Applications
In this work, we design two-party and multiparty protocols for evaluating multivariate polynomials at participants' inputs with security against a malicious adversary who may ...
Matthew K. Franklin, Payman Mohassel
CSUR
1999
137views more  CSUR 1999»
14 years 9 months ago
Algebraic Methods for Specification and Formal Development of Programs
with functions over those sets. This level of abstraction is commensurate with the view that the correctness of the input/output behaviour of a program takes precedence over all it...
Donald Sannella, Andrzej Tarlecki
APLAS
2010
ACM
14 years 9 months ago
Data Structure Fusion
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
ENTCS
2002
141views more  ENTCS 2002»
14 years 9 months ago
Coalgebraic Monads
This paper introduces coalgebraic monads as a unified model of term algebras covering fundamental examples such as initial algebras, final coalgebras, rational terms and term grap...
Neil Ghani, Christoph Lüth, Federico De March...
ARITH
1997
IEEE
15 years 1 months ago
On the Design of IEEE Compliant Floating Point Units
Engineering design methodology recommends designing a system as follows: Start with an unambiguous speci cation, partition the system into blocks, specify the functionality of eac...
Guy Even, Wolfgang J. Paul