Impartiality, justice and fairness: The ethics of concurrent termination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 115 LNCS, Issue , 1981, Pages 264-277

  Lehmann, D ^a   Pnueli, A ^b   Stavi, J ^c  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CONCURRENT PROGRAM;

AUTOMATA THEORY;

EID: 85034565451     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-10843-2_22     Document Type: Conference Paper

References (7)

1. Floyd, R.W. — Assigning meaning to programs, in J.T. Schwartz (ed.) — Mathematical aspects of computer science, Proc. Symp. In Appl. Math. 19, A.M.S. 1967, 19–32.
2. Keller, R.M. — Formal Verification of Parallel Programs, CACM 19 (7) 1976.
3. Lamport, L. — Proving the Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, 3 (2) 1977, 125–143.
4. Manna, Z., Pnueli, A. — The Temporal Logic of Programs — A manuscript, 1980.
5. Manna, Z., Pnueli, A. — Temporal Verification of Concurrent Programs, the Nontemporal Alternative, Workshop on Program Logics, Yorktown Heights, May 1981.
6. Owicki, S., Gries, D. — An Axiomatic Proof Technique for Parallel Programs, Acta information 5, 319–339.
7. Owicki, S., Gries, D. — Verifying Properties of Parallel Programs: An Axiomatic Approach, CACM 19(5) 1976, 279–286.