63 search results - page 2 / 13 » Proving Atomicity: An Assertional Approach |
MPC
2000
Springer
13 years 10 months ago
2000
Springer
It is possible, but difficult, to reason in Hoare logic about programs which address and modify data structures defined by pointers. The challenge is to approach the simplicity of ...
ASIAN
2009
Springer
13 years 8 months ago
2009
Springer
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
EKAW
2010
Springer
13 years 5 months ago
2010
Springer
The World Wide Web has evolved into a distributed network of web applications facilitating the publication of information on a large scale. Judging whether such information can be ...
ASPLOS
2011
ACM
12 years 10 months ago
2011
ACM
In practice, it is quite difficult to write correct multithreaded programs due to the potential for unintended and nondeterministic interference between parallel threads. A funda...
CHARME
2003
Springer
14 years 6 days ago
2003
Springer
This paper shows how classic inductive assertions can be used in conjunction with an operational semantics to prove partial correctness properties of programs. The method imposes o...