797 search results - page 115 / 160 » Eliminating Proofs from Programs |
143
Voted
IFIP
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Task-structured probabilistic input/output automata (taskPIOAs) are concurrent probabilistic automata that, among other things, have been used to provide a formal framewo...
135
Voted
POPL
2010
ACM
16 years 15 hour ago
2010
ACM
This paper introduces a new approach to type theory called pure subtype systems. Pure subtype systems differ from traditional approaches to type theory (such as pure type systems)...
114
Voted
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
As critical records are increasingly stored in electronic form, which tends to make for easy destruction and clandestine modification, it is imperative that they be properly manag...
126
Voted
PET
2010
Springer
15 years 6 months ago
2010
Springer
In this work, we propose a new platform to enable service providers, such as web site operators, on the Internet to block past abusive users of anonymizing networks (for example, T...
125
Voted
IACR
2011
14 years 2 months ago
2011
Abstract. Sponge functions were introduced by Bertoni et al. as an alternative to the classical MerkleDamg˚ard design. Many hash function submissions to the SHA-3 competition laun...