Sciweavers

719 search results - page 99 / 144
» Proving Security Protocols Correct
Sort
View
POPL
2006
ACM
15 years 10 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
POPL
2005
ACM
15 years 10 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
EUROPAR
2010
Springer
14 years 10 months ago
Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems
This paper introduces a set object, namely a shared object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition su...
Roberto Baldoni, Silvia Bonomi, Michel Raynal
CORR
2011
Springer
187views Education» more  CORR 2011»
14 years 4 months ago
Failure of A Mix Network
A mix network by Wikstrom fails in correctness, provable privacy and soundness. Its claimed advantages in security and efficiency are compromised. The analysis in this paper illus...
Kun Peng
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
15 years 3 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...