Sciweavers

1026 search results - page 118 / 206
» A Methodology for Equational Reasoning
Sort
View
HICSS
2010
IEEE
215views Biometrics» more  HICSS 2010»
14 years 4 months ago
Investigating the Drivers of the Continuous Use of Social Virtual Worlds
Social virtual worlds (SVWs) have become increasingly important environments for social interaction, especially for the younger generations. For SVWs to be economically sustainabl...
Matti Mäntymäki, Jani Merikivi
FOSSACS
2009
Springer
14 years 3 months ago
Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
Abstract. We present a realizability model for a call-by-value, higherorder programming language with parametric polymorphism, general first-class references, and recursive types....
Lars Birkedal, Kristian Støvring, Jacob Tha...
CSFW
2009
IEEE
14 years 3 months ago
A Method for Proving Observational Equivalence
—Formal methods have proved their usefulness for analyzing the security of protocols. Most existing results focus on trace properties like secrecy (expressed as a reachability pr...
Véronique Cortier, Stéphanie Delaune
CRYPTO
2007
Springer
132views Cryptology» more  CRYPTO 2007»
14 years 3 months ago
How Should We Solve Search Problems Privately?
Abstract. Secure multiparty computation allows a group of distrusting parties to jointly compute a (possibly randomized) function of their inputs. However, it is often the case tha...
Amos Beimel, Tal Malkin, Kobbi Nissim, Enav Weinre...
ICLP
2007
Springer
14 years 3 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...