Sciweavers

2196 search results - page 94 / 440
» Practical Reasoning Using Values
Sort
View
CADE
2008
Springer
16 years 2 months ago
Specification Predicates with Explicit Dependency Information
Specifications of programs use auxiliary symbols to encapsulate concepts for a variety of reasons: readability, reusability, structuring and, in particular, for writing recursive d...
Richard Bubel, Reiner Hähnle, Peter H. Schmit...
90
Voted
ASIACRYPT
2001
Springer
15 years 6 months ago
Mutually Independent Commitments
We study the two-party commitment problem, where two players have secret values they wish to commit to each other. Traditional commitment schemes cannot be used here because they d...
Moses Liskov, Anna Lysyanskaya, Silvio Micali, Leo...
COR
2006
88views more  COR 2006»
15 years 2 months ago
An exact algorithm for the capacitated vertex p-center problem
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
F. Aykut Özsoy, Mustafa Ç. Pinar
87
Voted
CORR
2010
Springer
65views Education» more  CORR 2010»
15 years 1 months ago
Iterative method for improvement of coding and decryption
Cryptographic check values (digital signatures, MACs and H-MACs) are useful only if they are free of errors. For that reason all of errors in cryptographic check values should be ...
Natasa Zivic
145
Voted
HASKELL
2005
ACM
15 years 7 months ago
Verifying haskell programs using constructive type theory
Proof assistants based on dependent type theory are closely related to functional programming languages, and so it is tempting to use them to prove the correctness of functional p...
Andreas Abel, Marcin Benke, Ana Bove, John Hughes,...