Communicating sequential processes
Communicating sequential processes
The B-book: assigning programs to meanings
The B-book: assigning programs to meanings
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
TACAS '95 Proceedings of the First International Workshop on Tools and Algorithms for Construction and Analysis of Systems
How to Make FDR Spin LTL Model Checking of CSP by Refinement
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
On the expressive power of CSP refinement
Formal Aspects of Computing
Specification of communicating processes: temporal logic versus refusals-based refinement
Formal Aspects of Computing
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
Probing the Depths of CSP-M: A New fdr-Compliant Validation Tool
ICFEM '08 Proceedings of the 10th International Conference on Formal Methods and Software Engineering
PAT: Towards Flexible Verification under Fairness
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Formal methods: Practice and experience
ACM Computing Surveys (CSUR)
Integrating Specification and Programs for System Modeling and Verification
TASE '09 Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering
Fair Model Checking with Process Counter Abstraction
FM '09 Proceedings of the 2nd World Congress on Formal Methods
Understanding Concurrent Systems
Understanding Concurrent Systems
Architectural verification of control systems using CSP
ICFEM'11 Proceedings of the 13th international conference on Formal methods and software engineering
| Hi-index | 0.00 |
Communicating Sequential Processes (CSP) has been widely applied to modeling and analyzing concurrent systems. There have been considerable efforts on enhancing CSP by taking data and other system aspects into account. For instance, CSPM combines CSP with a functional programming language whereas CSP# integrates high-level CSP-like process operators with low-level procedure code. Little work has been done to systematically compare these CSP extensions, which may have subtle and substantial differences. In this paper, we compare CSPM and CSP# not only on their syntax, but also operational semantics as well as their supporting tools such as FDR, ProB, and PAT. We conduct extensive experiments to compare the performance of these tools in different settings. Our comparison can be used to guide users to choose the appropriate CSP extension and verification tool based on the system characteristics.