31 search results - page 6 / 7 » Verifying BPEL-Like Programs with Hoare Logic |
ASIAN
2009
Springer
13 years 11 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...
ESOP
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Embedded information assurance applications that are critical to national and international infrastructures, must often adhere to certification regimes that require infor...
ICFP
2009
ACM
14 years 10 months ago
2009
ACM
We present a new approach for constructing and verifying higherorder, imperative programs using the Coq proof assistant. We build on the past work on the Ynot system, which is bas...
POPL
2009
ACM
14 years 10 months ago
2009
ACM
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that help tame the complexity of their proofs. Game-base...
PPOPP
2006
ACM
14 years 3 months ago
2006
ACM
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...