An analytical and experimental comparison of CSP extensions and tools
File version
Accepted Manuscript (AM)
Author(s)
Liu, Y
Sun, J
Dong, JS
Carvalho, G
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Date
Size
File type(s)
Location
License
Abstract
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.
Journal Title
Lecture Notes in Computer Science
Conference Title
Book Title
Edition
Volume
7635
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
© 2012 Springer International Publishing AG. This is an electronic version of an article published in Lecture Notes In Computer Science (LNCS), volume 7635, pp 381-397, 2012. Lecture Notes In Computer Science (LNCS) is available online at: http://link.springer.com// with the open URL of your article.
Item Access Status
Note
Access the data
Related item(s)
Subject
Software engineering not elsewhere classified