Communicating sequential processes
Communicating sequential processes
Verification of sequential and concurrent programs
Verification of sequential and concurrent programs
A classical mind
The Unified Modeling Language reference manual
The Unified Modeling Language reference manual
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Formal Methods for the International Space Station ISS
Correct System Design, Recent Insight and Advances, (to Hans Langmaack on the occasion of his retirement from his professorship at the University of Kiel)
Deadlock Analysis for a Fault-Tolerant System
AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
Combining Methods for the Livelock Analysis of a Fault-Tolerant System
AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Combining CSP and Object-Z: Finite or Infinite Trace Semantics?
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
Testing Transition Systems: An Annotated Bibliography
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Hierarchical Hybrid Modeling of Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
An Extended Duration Calculus for Hybrid Real-Time Systems
Hybrid Systems
From Testing Theory to Test Driver Implementation
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Test Automation for Safety-Critical Systems: Industrial Application and Future Developments
FME '96 Proceedings of the Third International Symposium of Formal Methods Europe on Industrial Benefit and Advances in Formal Methods
Derivation of Parallel Algorithms from Functional Specifications to CSP Processes
MPC '95 Mathematics of Program Construction
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A Survivable Avionics System for Space Applications
FTCS '98 Proceedings of the The Twenty-Eighth Annual International Symposium on Fault-Tolerant Computing
Design and verification of fault tolerant systems with CSP
Distributed Computing
Testing Software Design Modeled by Finite-State Machines
IEEE Transactions on Software Engineering
On model checking data-independent systems with arrays with whole-array operations
CSP'04 Proceedings of the 2004 international conference on Communicating Sequential Processes: the First 25 Years
Automatic translation from combined B and CSP specification to java programs
B'07 Proceedings of the 7th international conference on Formal Specification and Development in B
Hi-index | 0.00 |
Since 1985, CSP has been applied by the author, his research team at Bremen University and verification engineers at Verified Systems International to a variety of “real-world” projects. These include the verification of high-availability database servers, of fault-tolerant computers now operable in the International Space Station, hardware-in-the-loop tests for the novel Airbus A380 aircraft controller family and conformance tests for the European Train Control System. Illustrated by examples from these projects, we highlight important aspects of the CSP language design, its semantics and tool support, and describe the impact of these features on the quality and efficiency of verification and testing. New requirements with regard to the test of hybrid control systems, the demand for executable formal specifications, as well as the ongoing discussion about the practical applicability of formal methods have led to the development of new specification formalisms. We sketch some key decisions in the formalism design and indicate how some of the fundamental properties of CSP have been adopted, while others have been deliberately discarded in these new developments.