305 search results - page 18 / 61 » From Sets to Bits in Coq |
119
Voted
POPL
2010
ACM
15 years 10 months ago
2010
ACM
The definition of type equivalence is one of the most important design issues for any typed language. In dependentlytyped languages, because terms appear in types, this definition...
102
Voted
ENTCS
2008
15 years 18 days ago
2008
Mathematical texts can be computerized in many ways that capture differing amounts of the mathematical meaning. At one end, there is document imaging, which captures the arrangeme...
169
click to vote
PLPV
2011
ACM
14 years 3 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...
110
click to vote
IACR
2011
14 years 5 days ago
2011
We study the problem of authentication based on a weak key in the information-theoretic setting. A key is weak if its min-entropy is an arbitrary small fraction of its bit length. ...
140
click to vote
IMC
2010
ACM
14 years 10 months ago
2010
ACM
Despite many years of work in wireless mesh networks built using 802.11 radios, the performance and behavior of these networks in the wild is not well-understood. This lack of und...