Results 1 
5 of
5
Algebraic Process Verification
 Handbook of Process Algebra, chapter 17
"... This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. ..."
Abstract

Cited by 68 (16 self)
 Add to MetaCart
This chapter addresses the question how to verify distributed and communicating systems in an e#ective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras.
A brief history of process algebra
 Theor. Comput. Sci
, 2004
"... Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The a ..."
Abstract

Cited by 62 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This note addresses the history of process algebra as an area of research in concurrency theory, the theory of parallel and distributed systems in computer science. Origins are traced back to the early seventies of the twentieth century, and developments since that time are sketched. The author gives his personal views on these matters. He also considers the present situation, and states some challenges for the future.
Symbolic Techniques for Valuepassing Calculi
 University of Sussex
, 1997
"... We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents into pur ..."
Abstract

Cited by 10 (2 self)
 Add to MetaCart
(Show Context)
We investigate the use of symbolic operational semantics for valuepassing process languages. Symbolic semantics provide analytical tools for reasoning about particular infinite state systems where traditional methods fail. We eschew the use of Milner's encoding of valuepassing agents into pure process algebra and advocate the treatment of valuepassing terms as firstorder processes proper. Such an approach enables us to build finitary proof systems for reasoning within a variety of valuepassing calculi. All work carried out here is parametric with respect to the language of data expressions and, as such, reasoning about processes must be done relative to reasoning about data. Firstly, we consider...
Symbolic Techniques
, 1997
"... The contents of Chapters 3 and 4 are the result of collaborative research with my supervisor, Matthew Hennessy. Preliminary versions of these two chapters have been published as Sussex University technical reports [47, 48] and appear as an extended abstract in [46]. An earlier version ..."
Abstract
 Add to MetaCart
(Show Context)
The contents of Chapters 3 and 4 are the result of collaborative research with my supervisor, Matthew Hennessy. Preliminary versions of these two chapters have been published as Sussex University technical reports [47, 48] and appear as an extended abstract in [46]. An earlier version
Concurrency and Communication Evolution in Computing
, 2013
"... • Sequential computing (1940): a single instruction at a time is executed. • Imperative models: Turing machines and less expressive automata (finitestate automata, pushdown automata). • Declarative models: Church λcalculus, firstorder logic. • Programming languages (Fortran, Cobol, Algol, C,..., ..."
Abstract
 Add to MetaCart
• Sequential computing (1940): a single instruction at a time is executed. • Imperative models: Turing machines and less expressive automata (finitestate automata, pushdown automata). • Declarative models: Church λcalculus, firstorder logic. • Programming languages (Fortran, Cobol, Algol, C,..., Lisp, Prolog,...). • Concurrent and distributed computing (1980): several instructions can be simultaneously executed. • Sharedmemory model vs. messagepassing model. • Primitives for programs synchronization (semaphores, monitors,...). • Concurrent programming languages (Ada, Occam, Java,...). • Global computing (2000): computation over infrastructures available globally and able to provide uniform services with variable guarantees, with particular regard to exploiting their universal scale as well as the programmability of their services. • Development of largescale generalpurpose computer systems that have