Derivation of parallel algorithms from functional specifications to CSP processes

Abdallah, Ali E. (1995) Derivation of parallel algorithms from functional specifications to CSP processes. In: Mathematics of Program Construction. Springer, Berlin, Heidelberg, pp. 67-96. ISBN 978-3-540-49445-4

Full text not available from this repository. (Request a copy)

Abstract

A transformational programming approach is proposed as a means for developing a class of parallel algorithms from clear functional specifications to efficient networks of communicating sequential processes (CSP). A foundation for the systematic refinement of functional specifications into CSP processes is established. Techniques for exhibiting implicit parallelism in functional specification are developed. Their use is illustrated by deriving new efficient parallel algorithms to several problems. Derivation and reasoning are conducted in an equational style using the calculus for program synthesis developed by Bird and Meertens.

Item Type: Book Section
Subjects: G400 Computer Science
Divisions: Faculty of Computing, Engineering and the Built Environment
Faculty of Computing, Engineering and the Built Environment > School of Computing and Digital Technology
Faculty of Computing, Engineering and the Built Environment > School of Computing and Digital Technology > Cyber Security
UoA Collections > UoA11: Computer Science and Informatics
Depositing User: Oana-Andreea Dumitrascu
Date Deposited: 07 Apr 2017 11:41
Last Modified: 07 Apr 2017 11:41
URI: http://www.open-access.bcu.ac.uk/id/eprint/4241

Actions (login required)

View Item View Item

Research

In this section...