Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Computer science --- Computer algorithms. --- Computer programming. --- Mathematics --- Parallel processing (Electronic computers). --- Sequential processing (Computer science). --- Data processing. --- Computer algorithms --- Computer programming --- Parallel processing (Electronic computers) --- Sequential processing (Computer science) --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Algorithms --- Data processing --- Programming --- Parallelism --- Computational Complexity --- Np Complete

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Communicating Sequential Processes (CSP) 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, 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 textbook/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 Failures-Divergences Refinement (FDR), and describes how to create new tools based on FDR. Most of the book relies on no previous knowledge of the theoretical background other than a basic knowledge of sets and sequences. Sophisticated mathematical arguments are avoided whenever possible. Topics and features: Presents a comprehensive, accessible introduction to CSP Discusses the latest advances in CSP, giving novel presentations of its operational and algebraic semantics as well as the first comprehensive survey of its hierarchy of behavioural denotational models Explores the practical application of CSP, including timed modelling, discrete modelling, parameterised verifications and the state explosion problem, as well as advanced topics in the use of FDR Examines the ability of CSP to describe and enable reasoning about parallel systems modelled in other paradigms including two chapters on shared variable programming Covers a broad variety of concurrent systems, including combinatorial, timed, priority-based, mobile, shared variable, statecharts, buffered and asynchronous systems Contains ample exercises and case studies to support the text and aid in the explanation 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 Hoare's CSP. Bill Roscoe has been Head of Department at Oxford University Computing Laboratory since 2003 and a Professor of Computer Science there since 1997. He is a Fellow of University College, Oxford and co-Director of the James Martin Institute for the Future of Computing. He is also co-editor of the Springer book Reflections on the Work of C.A.R. Hoare.

Parallel processing (Electronic computers) --- Sequential processing (Computer science) --- Engineering & Applied Sciences --- Computer Science --- Computer science. --- Operating systems (Computers). --- Computer logic. --- Computer Science. --- Operating Systems. --- Logics and Meanings of Programs. --- High performance computing --- Multiprocessors --- Parallel programming (Computer science) --- Supercomputers --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory --- Computer operating systems --- Computers --- Disk operating systems --- Systems software --- Operating systems --- Computer science logic --- Logic, Symbolic and mathematical

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Program analysis is concerned with techniques that automatically determine run-time properties of given programs prior to run-time. It is used for validation in order to ensure that programs serve their intended purpose and in further processing for efficient execution such as in optimizing compilers. Optimal program analysis provides a guarantee about the precision of the computed results. This monograph, a revised version of the author's habilitation thesis, focusses on optimal flow analysis of sequential and parallel programs. It studies algorithmic properties of various versions of the well-known constant-propagation problem. In order to come to grips with the variants considered, it combines techniques from different areas such as linear algebra, computable ring theory, abstract interpretation, program verification, complexity theory, etc. Combination of techniques is the key to further progress in automatic analysis and constant-propagation allows us to illustrate this point in a theoretical study. After a general overview, the monograph consists of three essentially self-contained parts that can be read independently of each other. These parts study: a hierarchy of constants in sequential programs, inherent limits of flow analysis of parallel programs, and how to overcome these limits by abandoning a classic atomic execution assumption.

Parallel programming (Computer science) --- Sequential processing (Computer science) --- Mathematical constants. --- Variables (Mathematics) --- Computer programs --- Programmation parallèle (Informatique) --- Constantes (Mathématiques) --- Variables (Mathématiques) --- Correctness. --- Mathematical constants --- Computer Science --- Engineering & Applied Sciences --- Correctness --- Information Technology --- Software Engineering --- Correctness of computer programs --- Program correctness (Computer science) --- Constants, Mathematical --- Computer science. --- Software engineering. --- Programming languages (Electronic computers). --- Computers. --- Computer logic. --- Computer Science. --- Theory of Computation. --- Software Engineering. --- Logics and Meanings of Programs. --- Programming Languages, Compilers, Interpreters. --- Computer science logic --- Logic, Symbolic and mathematical --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Computer systems --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Computer software engineering --- Engineering --- Informatics --- Science --- Debugging in computer science --- Mathematics --- Functions --- Computer programming --- Parallel processing (Electronic computers) --- Information theory. --- Logic design. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Communication theory --- Communication