Communicating sequential processes
Communicating sequential processes
Fairness
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Efficient on-the-fly model-checking for regular alternation-free mu-calculus
Science of Computer Programming - Special issure on formal methods for industrial critical systems (FMICS 2000)
Liveness and Fairness in Process-Algebraic Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Formal Analysis of a Non-Repudiation Protocol
CSFW '98 Proceedings of the 11th IEEE workshop on Computer Security Foundations
An intruder model for verifying liveness in security protocols
Proceedings of the fourth ACM workshop on Formal methods in security
Modelling Distributed Systems (Texts in Theoretical Computer Science. An EATCS Series)
Modelling Distributed Systems (Texts in Theoretical Computer Science. An EATCS Series)
ProB: an automated analysis toolset for the B method
International Journal on Software Tools for Technology Transfer (STTT)
Specification of communicating processes: temporal logic versus refusals-based refinement
Formal Aspects of Computing
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Seven at one stroke: LTL model checking for high-level specifications in B, Z, CSP, and more
International Journal on Software Tools for Technology Transfer (STTT)
A theorem-proving approach to verification of fair non-repudiation protocols
FAST'06 Proceedings of the 4th international conference on Formal aspects in security and trust
Understanding Concurrent Systems
Understanding Concurrent Systems
A fair non-repudiation protocol
SP'96 Proceedings of the 1996 IEEE conference on Security and privacy
CADP 2010: a toolbox for the construction and analysis of distributed processes
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Towards verification of timed non-repudiation protocols
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
On the security of public key protocols
IEEE Transactions on Information Theory
An intensive survey of fair non-repudiation protocols
Computer Communications
Design and formal verification of a CEM protocol with transparent TTP
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Motivated by Murray's work on the limits of refinement testing for CSP, we propose the use of ProB to check liveness properties under assumptions of strong and weak event fairness, whose refinement-closures cannot generally be expressed as refinement checks for FDR. Such properties are necessary for the analysis of fair exchange protocols in CSP, which assume at least some messages are sent over a resilient channel. As the properties we check are refinement-closed, we retain CSP's theory of refinement, enabling subsequent step-wise refinement of the CSP model. Moreover, we improve upon existing CSP models of fair exchange protocols by proposing a revised intruder model inspired by the one of Cederquist and Dashti. Our intruder model is stronger as we use a weaker fairness constraint.