Local Search in Model Checking
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Static livelock analysis in CSP
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A design-for-verification framework for a configurable performance-critical communication interface
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
An enhanced flow analysis technique for detecting unreachability faults in concurrent systems
Information Sciences: an International Journal
Compositional modelling and reasoning in an institution for processes and data
WADT'10 Proceedings of the 20th international conference on Recent Trends in Algebraic Development Techniques
SAT-solving in CSP trace refinement
Science of Computer Programming
Refinement checking for privacy policies
Science of Computer Programming
CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Safety and line capacity in railways --- an approach in timed CSP
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Early fault detection in industry using models at various abstraction levels
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
To boldly go: an occam-π mission to engineer emergence
Natural Computing: an international journal
Model checking under fairness in proB and its application to fair exchange protocols
ICTAC'12 Proceedings of the 9th international conference on Theoretical Aspects of Computing
All linear-time congruences for familiar operators part 2: infinite LTSs
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
An optimization approach for effective formalized fUML model checking
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
An analytical and experimental comparison of CSP extensions and tools
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
Testing with inputs and outputs in CSP
FASE'13 Proceedings of the 16th international conference on Fundamental Approaches to Software Engineering
Theoretical Computer Science
Theories of Programming and Formal Methods
CSP-based counter abstraction for systems with node identifiers
Science of Computer Programming
Mining high utility itemsets by dynamically pruning the tree structure
Applied Intelligence
Hi-index | 0.00 |
CSP notation has been used extensively for teaching and applying concurrency theory, ever since the publication of the text Communicating Sequential Processes by C.A.R. Hoare in 1985. Both a programming language and a specification language, the theory of CSP helps users to understand concurrent systems, and to decide whether a program meets its specification. As a member of the family of process algebras, the concepts of communication and interaction are presented in an algebraic style. An invaluable reference on the state of the art in CSP, Understanding Concurrent Systems also serves as a comprehensive introduction to the field, in addition to providing material for a number of more advanced courses. A first point of reference for anyone wanting to use CSP or learn about its theory, the book also introduces other views of concurrency, using CSP to model and explain these. The text is fully integrated with CSP-based tools such as FDR, and describes how to create new tools based on FDR. Most of the book relies on no theoretical background other than a basic knowledge of sets and sequences. Sophisticated mathematical arguments are avoided whenever possible. Topics and features: presents a comprehensive introduction to CSP; discusses the latest advances in CSP, covering topics of operational semantics, denotational models, finite observation models and infinite-behaviour models, and algebraic semantics; explores the practical application of CSP, including timed modelling, discrete modelling, parameterised verifications and the state explosion problem, and advanced topics in the use of FDR; examines the ability of CSP to describe and enable reasoning about parallel systems modelled in other paradigms; covers a broad variety of concurrent systems, including combinatorial, timed, priority-based, mobile, shared variable, statecharts, buffered and asynchronous systems; contains exercises and case studies to support the text; supplies further tools and information at the associated website: http://www.comlab.ox.ac.uk/ucs/. From undergraduate students of computer science in need of an introduction to the area, to researchers and practitioners desiring a more in-depth understanding of theory and practice of concurrent systems, this broad-ranging text/reference is essential reading for anyone interested in Hoares CSP.