Proving progress properties of non terminating programs under fairness assumptions

  • Ricardo Peña
  • Luis A. Galán
Workshop 05+21 Parallel Languages, Programming, and High-Level Control
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AO91]
    K. R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.Google Scholar
  2. [CM88]
    K. M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley, Reading, Massachusetts, 1988.Google Scholar
  3. [Fra86]
    N. Francez. Fairness. Springer-Verlag, 1986.Google Scholar
  4. [PG95]
    R. Peña and L.A. Galán. Proving Progress Properties of non Terminating Programs under Fairness Assumptions. Technical Report DIA-UCM 95/6, Universidad Complutense de Madrid, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Ricardo Peña
    • 1
  • Luis A. Galán
    • 1
  1. 1.Departamento de Informática y AutomáticaUniversidad Complutense de MadridMadridSpain

Personalised recommendations