Model checking under fairness in ProB and its application to fair exchange protocols

DOI10.1007/978-3-642-32943-2_14MaRDI QIDQ2915106zbMATH OpenOpenAlexFDO

Authors D. M. Williams, Joeri de Ruiter, Wan Fokkink

Publication date 21 September 2012

Published in Theoretical Aspects of Computing – ICTAC 2012 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-32943-2_14

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• On the limits of refinement-testing for model-checking CSP
• Model checking with fairness assumptions using PAT
• scientific article; zbMATH DE number 7280017
• scientific article; zbMATH DE number 1863165
• Attacking fair-exchange protocols: parallel models vs. trace models

Cited in

(5)

• On the limits of refinement-testing for model-checking CSP
• Model checking with fairness assumptions using PAT
• Attacking fair-exchange protocols: parallel models vs. trace models
• Foundations for using linear temporal logic in Event-B refinement
• A formal model of fair exchange protocols

Describes a project that uses

Uses Software

• PVS
• CADP
• ProB
• PAT

This page was built for publication: Model checking under fairness in ProB and its application to fair exchange protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915106)