Advertisement

Synthesis of parallel programs invariants

  • E. Pascal Gribomont
Colloquium On Software Engineering Views Of Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 186)

Abstract

Most current methods for parallel programs design and verification are based on the concept of invariant. However, invariant synthesis is the most difficult part of those methods. This work presents a technique for invariant design usable for both parallel program synthesis and verification. This technique drastically reduces the risks of errors due to a bad statement serialization or to inadequate interprocess synchronization.

Keywords

Control Point Parallel Program Critical Section Mutual Exclusion Safety Property 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    ASHCROFT, E.A., MANNA, Z., "Formalization of Properties of Parallel Programs", Machine Intelligence, vol. 6, pp. 17–41, 1970.Google Scholar
  2. [2]
    CLARKE, E.M., "Synthesis of resource invariants for concurrent programs", ACM Toplas, Vol. 2, pp. 338–358, 1980.Google Scholar
  3. [3]
    DIJKSTRA, E.W., "A discipline of programming", Prentice Hall, New Jersey, 1976.Google Scholar
  4. [4]
    DIJKSTRA, E.W. "An assertional proof of a program by G. L. Peterson", EWD 779, 1981.Google Scholar
  5. [5]
    GRIBOMONT, E.P., "Programmation parallèle", Internal Report, University of Liège, 1982.Google Scholar
  6. [6]
    GRIBOMONT, E.P., "Proving parallel programs in an incremental way", submitted to Science of Computer Programming, 1983.Google Scholar
  7. [7]
    GRIBOMONT, E.P., "Mutual exclusion in a computer network", submitted to Computer Networks, 1983.Google Scholar
  8. [8]
    GRIES, D., "An Exercise in Proving Parallel Programs Correct", CACM, vol. 20, pp. 921–930, 1977.Google Scholar
  9. [9]
    LEVIN, G.M., GRIES, D., "A Proof Technique for Communicating Sequential Processes", Acta Informatica, vol. 15, pp. 281–302, 1981.Google Scholar
  10. [10]
    MANNA, Z., PNUELI, A., "Verification of concurrent programs: temporal proofs principles", Lecture Notes in Comp. Sc., vol. 131, pp. 200–252, Springer, 1981.Google Scholar
  11. [11]
    OWICKI, S., GRIES, D., "An Axiomatic Proof Technique for Parallel Programs", Acta Informatica, vol. 6, pp. 319–340, 1976.Google Scholar
  12. [12]
    PETERSON, G.L., "Myths about the mutual exclusion problem", Information Processing Letters, vol. 12, pp. 115–116, 1981.Google Scholar
  13. [13]
    RICART, G., AGRAWALA, A.K., "An optimal algorithm for mutual exclusion", CACM, vol. 24, pp. 9–17, 1981.Google Scholar
  14. [14]
    Corrigendum, CACM, vol. 24, p. 578, 1981.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1985

Authors and Affiliations

  • E. Pascal Gribomont
    • 1
  1. 1.Institut MontefioreUniversité de LiègeLiègeBelgium

Personalised recommendations