A methodology for improving parallel programs by adding communications

  • Alberto Pettorossi
  • Andrzej Skowron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 208)


We propose a programming methodology for improving the efficiency of applicative parallel programs.

The basic idea comes from the program transformation approach à la Burstall-Darlington, in which "new and more efficient" versions of the programs are derived from "old" ones.

We extend that approach in the following two respects:
  • we consider parallel concurrent programs, and

  • we provide a calculus for ensuring that the derived versions are more efficient.

We consider that the programmer provides a first version of his/her program and then he/she discovers, maybe in an incremental way, some "facts" about it. Facts are then tested by the calculus and, if they are "accepted", they will be incorporated into the given version of the program via a translation algorithm, and a new version is thereby derived.


Recursive Call Recursive Equation Optimal Communication Recursive Definition Recursive Program 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

8. References

  1. [BuD 77]
    Burstall, R.M. and J. Darlington: "A transformation system for developing recursive programs" J.A.C.M. Vol. 24, No. 1, pag. 44–67 (1977)Google Scholar
  2. [Coh 83]
    Cohen, N.H.: "Eliminating Redundant Recursive Calls" ACM Transactions on Programming Languages and Systems 5, pag. 265–299 (1983)Google Scholar
  3. [Fea 79]
    Feather, M.S.: "A system for developing programs by transformations" Ph.D. Thesis, University of Edinburgh, Scotland (1979)Google Scholar
  4. [Kot 78]
    Kott L.: "About transformation system: A theoretical study" 3ème Colloque International sur la Programmation pag. 232–247, Dunod, Paris (1978)Google Scholar
  5. [Pet 77]
    Pettorossi, A.: "Transformation of programs and use of "tupling strategy"". Proc. Informatica 77, Bled, Yugoslavia (1977)Google Scholar
  6. [PeS 83]
    Pettorossi, A. and A. Skowron: "Complete Modal Theories for Verifying Communicating Agents Behaviour in Recursive Equations Programs" Report Computer Science Department CSR-128-83 Edinburgh University, Scotland (1983)Google Scholar
  7. [Sch 80]
    Scherlis, W.L.: "Expression Procedures and Program Derivation". Ph.D. Thesis, Stanford University Computer Science Report STAN-CS-80-818 (August 1980)Google Scholar
  8. [Weg 76]
    Wegbreit, B.: "Goal-directed program transformation". IEEE Trans. Software Eng. SE-2, pag. 69–79 (1976)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • Alberto Pettorossi
    • 1
  • Andrzej Skowron
    • 2
  1. 1.IASI — CNRRomaItaly
  2. 2.Institute of MathematicsWarsaw University, PKiN IX/907WarsawPoland

Personalised recommendations