A proof system to derive eventuality properties under justice hypothesis

  • Dominique Mery
Part of the Lecture Notes in Computer Science book series (LNCS, volume 233)


An axiomatic method based on a fragment of the temporal logic is proposed. It is used to derive eventuality properties of concurrent programs under justice hypothesis. A monotonous operator defines a precondition Pre(q) attached to any assertion q and Pre(q) holds until q does hold under justice hypothesis. This monotonous operator is built from the notion of critical (or determinant) group of atomic concurrent actions.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. APT and DELPORTE (1983):"Syntax-directed analysis of liveness properties" in RR83-42, october 1983,LITP,Universite de PARIS VII,FRANCE.Google Scholar
  2. BEN-ARI (1982):"On-the-fly garbage collection:New algorithms inspired from proofs" in 9th ICALP, LNCS No140, july 1982.Google Scholar
  3. BURSTALL (1974):"Program proving as hand simulation with a little induction" in Proc. IFIP 1974,pp 308–312,Amsterdam,The Netherlands.Google Scholar
  4. COUSOT (1985):"Fondements des méthodes de preuves d'invariance et de fatalité de programmes parallèles", Thèse d'état,nov. 1985,INPL,NANCY,FRANCE.Google Scholar
  5. HOARE (1969):"An axiomatic basis for computer programming" in Com. of ACM 12,576–583, 1969.Google Scholar
  6. LAMPORT (1980a):"'sometime’ is sometimes better than Always" in POPL 1980.Google Scholar
  7. LAMPORT (1980b):"The HOARE logic of concurrent programs" in Acta Informatica 14,21–37, 1980.Google Scholar
  8. LEHMAN,PNUELI and STAVI (1981):"Impartiality,Justice and Fairness:the ethics of concurrent termination" in ICALP 1981, LNCS No115.Google Scholar
  9. MANNA and PNUELI (1982):"Verification of concurrent programs:proving eventuality by well-founded ranking" in Report STAN-CS-82-915,may 1982,STANFORD university.Google Scholar
  10. MANNA and PNUELI (1983):"Proving precedence properties:the temporal way" in Report STAN-CS-83-964, STANFORD university.Google Scholar
  11. MANNA and PNUELI (1984):"Adequate proof principles for invariance and liveness properties of concurrent programs" in Science of Computer Programming 4, 1984,pp257–289.Google Scholar
  12. MERY (1983):"Une méthode axiomatique de preuves de propriétés de fatalité de programmes parallèles avec hypothèse d'exécution équitable",Thèse 3ieme cycle,INPL,mai 1983, NANCY,FRANCE.Google Scholar
  13. MERY (1985):"Preuves de propriétés de fatalité et de precédence sous hypothèse d'exécution équitable", in Report LRIM-85-02,may 1985,Université de METZ,FRANCE.Google Scholar
  14. MERY (1986):"Quelques exemples de preuves de propriétés de fatalité dans le systeme axiomatique FEPS",in Report LRIM-86-02,march 1986,Université de METZ,FRANCE.Google Scholar
  15. OWICKI and LAMPORT (1982):"Proving liveness properties of concurrent programs" in TOPLAS-ACM 4 (3), 1982,455–495.Google Scholar
  16. PARK (1981):"A predicate transformer for weak fair iteration" in Proc. of the 6th IBM Symposium on mathematical foundations of computer science,hakone,Japan, 1981.Google Scholar
  17. PNUELI (1977):"The temporal logic of programs" in Proc. of the 18th FOCS, 1977.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Dominique Mery
    • 1
  1. 1.Laboratoire de Recherche en Informatique de METZUniversite de METZ Faculte des SciencesMetzFrance

Personalised recommendations