Skip to main content

Mobile Escape Analysis for occam-pi

Barnes, Frederick R.M. (2009) Mobile Escape Analysis for occam-pi. In: Welch, Peter H. and Roebbers, Herman W. and Broenink, Jan F. and Barnes, Frederick R.M. and Ritson, Carl G. and Sampson, Adam T. and Stiles, Gardiner S. and Vinter, Brian, eds. Communicating Process Architectures 2009. Concurrent Systems Engineering . IOS Press, pp. 182-196. ISBN 978-1-60750-065-0. E-ISBN 978-1-60750-513-6. (doi:10.3233/978-1-60750-065-0-117) (The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided) (KAR id:30575)

The full text of this publication is not currently available from this repository. You may be able to access a copy if URLs are provided.
Official URL:
http://dx.doi.org/10.3233/978-1-60750-065-0-117

Abstract

Escape analysis is the process of discovering boundaries of dynamically allocated objects in programming languages. For object-oriented languages such as C++ and Java, this analysis leads to an understanding of which program objects interact directly, as well as what objects hold references to other objects. Such information can be used to help verify the correctness of an implementation with respect to its design, or provide information to a run-time system about which objects can be allocated on the stack (because they do not `escape' the method in which they are declared). For existing object-oriented languages, this analysis is typically made difficult by aliasing endemic to the language, and is further complicated by inheritance and polymorphism. In contrast, the occam-pi programming language is a process-oriented language, with systems built from layered networks of communicating concurrent processes. The language has a strong relationship with the CSP process algebra, that can be used to reason formally about the correctness of occam-pi programs. This paper presents early work on a compositional escape analysis technique for mobiles in the occam-pi programming language, in a style not dissimilar to existing CSP analyses. The primary aim is to discover the boundaries of mobiles within the communication graph, and to determine whether or not they escape any particular process or network of processes. The technique is demonstrated by analysing some typical occam-pi processes and networks, giving a formal understanding of their mobile escape behaviour.

Item Type: Book section
DOI/Identification number: 10.3233/978-1-60750-065-0-117
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Frederick Barnes
Date Deposited: 21 Sep 2012 09:49 UTC
Last Modified: 16 Nov 2021 10:08 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/30575 (The current URI for this page, for reference purposes)

University of Kent Author Information

Barnes, Frederick R.M..

Creator's ORCID:
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.