3552 search results - page 330 / 711 » Proof theory in the abstract |
230
click to vote
TACAS
2000
Springer
15 years 10 months ago
2000
Springer
Salsa is an invariant checker for speci cations in SAL the SCR Abstract Language. To establish a formula as an invariant without any user guidance Salsa carries out an induction pr...
188
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
163
click to vote
FMCO
2008
Springer
15 years 8 months ago
2008
Springer
The Bytecode Modeling Language (BML) is a specication for Java bytecode, that provides a high level of abstraction, while not restricting the format of the bytecode. Notably, BML s...
146
click to vote
ICISC
2003
15 years 8 months ago
2003
Abstract. It had been thought that it is difficult to provide receiptfreeness in mixnet-based electronic voting schemes. Any kind of user chosen randomness can be used to construct...
179
Voted
IANDC
2008
15 years 6 months ago
2008
A previous paper introduced eternity variables as an alternative to the prophecy variables of Abadi and Lamport and proved the formalism to be semantically complete: every simulat...