School of Computing

Compiling CSP

F.R.M. Barnes

In P.H. Welch, J. Kerridge, and F.R.M. Barnes, editors, Proceedings of Communicating Process Architectures 2006 (CPA-2006), volume 64 of Concurrent Systems Engineering Series, pages 182-196. IOS Press, September 2006.

Abstract

CSP, Hoare's Communicating Sequential Processes, is a formal language for specifying, implementing and reasoning about concurrent processes and their interactions. Existing software tools that deal with CSP directly are largely concerned with assisting formal proofs. This paper presents an alternative use for CSP, namely the compilation of CSP systems to executable code. The main motivation for this work is in providing a means to experiment with relatively large CSP systems, possibly consisting millions of concurrent processes --- something that is hard to achieve with the tools currently available.

Download publication 114 kbytes (PDF)

Bibtex Record

@inproceedings{2430,
author = {F.R.M. Barnes},
title = {Compiling {CSP}},
month = {September},
year = {2006},
pages = {182-196},
keywords = {determinacy analysis, Craig interpolants},
note = {},
doi = {},
url = {http://www.cs.kent.ac.uk/pubs/2006/2430},
    publication_type = {inproceedings},
    submission_id = {8040_1158809712},
    ISBN = {1-58603-671-8},
    booktitle = {Proceedings of Communicating Process Architectures 2006 (CPA-2006)},
    editor = {P.H. Welch and J. Kerridge and F.R.M. Barnes},
    volume = {64},
    series = {Concurrent Systems Engineering Series},
    publisher = {IOS Press},
    ISSN = {1383-7575},
    refereed = {yes},
}

School of Computing, University of Kent, Canterbury, Kent, CT2 7NF

Enquiries: +44 (0)1227 824180 or contact us.

Last Updated: 21/03/2014