Neutral debugging using grafts

https://doi.org/10.1016/0950-5849(94)90070-1Get rights and content

Abstract

Debugging distributed applications expressed using message passing parallelism is inherently difficult. We introduce two mechanisms that make this task easier: grafts and spies. A graft is a process that is inserted in a communication channel to work with the messages carried by this channel. The use of grafts does not require recompilation of the application to debug. A spy is a graft that does not modify any message. We have proven that spies do not change the behaviour of the original processes. In this paper we introduce grafts and spies and illustrate their use by means of an example.

References (15)

  • D Austry et al.

    Algèbre de processus et synchronisation

    Theoret. Comput. Sci.

    (1984)
  • RW Hockney et al.

    Parallel computers

    (1981)
  • HF Bal et al.

    Programming languages for distributed computing systems

    ACM Comput. Surv.

    (1989)
  • CAR Hoare

    Communicating sequential processes

    Comm. ACM

    (1978)
  • R Milner

    A calculus of communicating systems

  • D May et al.

    A communicating process architecture: transputers and Occam

  • The Helios operating system

    (1990)
There are more references available in the full text version of this article.

Cited by (0)

View full text