Sciweavers

403 search results - page 34 / 81
» Contracts for higher-order functions
Sort
View
POPL
2006
ACM
16 years 6 months ago
Modular set-based analysis from contracts
In PLT Scheme, programs consist of modules with contracts. The latter describe the inputs and outputs of functions and objects via predicates. A run-time system enforces these pre...
Philippe Meunier, Robert Bruce Findler, Matthias F...
QSIC
2005
IEEE
15 years 11 months ago
Runtime Validation of Behavioural Contracts for Component Software
In component software, the independence of components is achieved by separating their interfaces from implementations. The interface definition of a component serves as the contr...
Yan Jin, Jun Han
FC
2005
Springer
120views Cryptology» more  FC 2005»
15 years 11 months ago
Achieving Fairness in Private Contract Negotiation
Abstract. Suppose Alice and Bob are two entities (e.g. agents, organizations, etc.) that wish to negotiate a contract. A contract consists of several clauses, and each party has ce...
Keith B. Frikken, Mikhail J. Atallah
PKC
2010
Springer
177views Cryptology» more  PKC 2010»
15 years 10 months ago
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
We propose new and improved instantiations of lossy trapdoor functions (Peikert and Waters, STOC ’08), and correlation-secure trapdoor functions (Rosen and Segev, TCC ’09). Ou...
David Mandell Freeman, Oded Goldreich, Eike Kiltz,...
GECCO
2000
Springer
101views Optimization» more  GECCO 2000»
15 years 9 months ago
Polynomial Time Summary Statistics for Two general Classes of Functions
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
Robert B. Heckendorn