Sciweavers

74 search results - page 4 / 15
» Local Proofs for Linear-Time Properties of Concurrent Progra...
Sort
View
VMCAI
2009
Springer
14 years 3 months ago
Towards Automatic Stability Analysis for Rely-Guarantee Proofs
The Rely-Guarantee approach is a well-known compositional method for proving Hoare logic properties of concurrent programs. In this approach, predicates in the proof must be proved...
Hasan Amjad, Richard Bornat
POPL
2000
ACM
14 years 3 days ago
Verifying Secrets and Relative Secrecy
Systems that authenticate a user based on a shared secret (such as a password or PIN) normally allow anyone to query whether the secret is a given value. For example, an ATM machi...
Dennis M. Volpano, Geoffrey Smith
LPAR
2005
Springer
14 years 2 months ago
Towards Automated Proof Support for Probabilistic Distributed Systems
Abstract. The mechanisation of proofs for probabilistic systems is particularly challenging due to the verification of real-valued properties that probability entails: experience ...
Annabelle McIver, Tjark Weber
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 7 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
AC
2000
Springer
14 years 27 days ago
The Join Calculus: A Language for Distributed Mobile Programming
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
Cédric Fournet, Georges Gonthier