Sciweavers

13383 search results - page 313 / 2677
» Abstractions from proofs
Sort
View
ICISC
2003
90views Cryptology» more  ICISC 2003»
15 years 8 months ago
Providing Receipt-Freeness in Mixnet-Based Voting Protocols
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...
Byoungcheon Lee, Colin Boyd, Ed Dawson, Kwangjo Ki...
179
Voted
IANDC
2008
81views more  IANDC 2008»
15 years 6 months ago
Universal extensions to simulate specifications
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...
Wim H. Hesselink
JAR
2002
82views more  JAR 2002»
15 years 6 months ago
A Compendium of Continuous Lattices in MIZAR
Abstract. This paper reports on the Mizar formalization of the theory of continuous lattices as presented in A Compendium of Continuous Lattices, [25]. By the Mizar formalization w...
Grzegorz Bancerek, Piotr Rudnicki
TODAES
1998
68views more  TODAES 1998»
15 years 6 months ago
Specification and verification of pipelining in the ARM2 RISC microprocessor
Abstract State Machines (ASMs) provide a sound mathematical basis for the specification and verification of systems. An application of the ASM methodology to the verification of a ...
James K. Huggins, David Van Campenhout
FORTE
2011
14 years 10 months ago
A Framework for Verifying Data-Centric Protocols
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
Yuxin Deng, Stéphane Grumbach, Jean-Fran&cc...