Sciweavers

564 search results - page 32 / 113
» Proof General: A Generic Tool for Proof Development
Sort
View
LICS
2008
IEEE
14 years 2 months ago
Typed Normal Form Bisimulation for Parametric Polymorphism
This paper presents a new bisimulation theory for parametric polymorphism which enables straightforward coinductive proofs of program equivalences involving existential types. The...
Søren B. Lassen, Paul Blain Levy
GECCO
2010
Springer
173views Optimization» more  GECCO 2010»
13 years 11 months ago
The baldwin effect in developing neural networks
The Baldwin Effect is a very plausible, but unproven, biological theory concerning the power of learning to accelerate evolution. Simple computational models in the 1980’s gave...
Keith L. Downing
CTRSA
2009
Springer
95views Cryptology» more  CTRSA 2009»
14 years 2 months ago
Statistically Hiding Sets
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...
Manoj Prabhakaran, Rui Xue
SPE
2011
13 years 2 months ago
Decomposition tool for event-B
Abstract. Two methods have been identified for Event-B model decomposition: shared variable and shared event. The purpose of this paper is to introduce the two approaches and the ...
Renato Silva, Carine Pascal, Thai Son Hoang, Micha...
STOC
1999
ACM
104views Algorithms» more  STOC 1999»
13 years 12 months ago
Fast Approximate PCPs
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
Funda Ergün, Ravi Kumar, Ronitt Rubinfeld