Verification of concurrent programs: Temporal proof principles

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

Volumn 131 LNCS, Issue , 1982, Pages 200-252

  Manna, Zohar ^a,b   Pnxjeli, Amir ^b  

^a STANFORD UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; SEMANTICS;

AUTOMATIC DERIVATION; CONCURRENT PROGRAM; LIVENESS; PROOF METHODS; TEMPORAL SEMANTICS;

APPLICATION PROGRAMS;

EID: 84904500492     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0025785     Document Type: Conference Paper

References (16)

1. Ben-Ari, M., Z. Manna and A Pnueli, “The temporal logic of branching time," Proceedings of the Eighth ACM Symposium on Principles of Programming Languages, Williamsburg, VA, Jan. 1981, pp. 169-176.
2. Burstall, R.M., "Program proving as hand simulation with a little induction," Proc. IFIP Congress, Amsterdam, The Netherlands (1974), North Holland, pp. 308-312.
3. Clarke, E.M., "Synthesis of resource invariants for concurrent programs," ACM Trans. on Programming Languages and Systems, Vol, 2, No. 3 (July 1980), pp. 338-358.
4. Dijkstra, E.W., "Cooperating sequential processes", in Programming Languages and Systems (F. Genvys ed.), Academic Press, New York, NY, 1968, pp. 43-112.
5. Francez, N., "The analysis of cyclic programs," Ph.D. Thesis, Applied Mathematics Dept., The Weizmann Institute of Science, Rehovot, Israel, July 1976.
6. Keller, R.M., "Formal verification of parallel programs," CACM, Vol.19, No. 7 (July 1976), pp. 371-384.
7. Lamport, L., "Proving the correctness of multiprocess programas" IEEE Transactions on Software Engineering, Vol. 8E-3, No. 7 (March 1977), pp. 125-143.
8. Manna, Z., "Logics of programs," Prec. IFIP Congress, Tokyo and Melbourne (October 1980), North Holland, pp. 41-51.
9. Manna, Z., "Verification of sequential programs: Temporal axiomatization" in Theoretical Foundations of Programming Methodology (F.L. Bauer, ed.), NATO Scientific Series, D. Riedel Pub. Co., Dordrecht, Holland, 1981.
10. Maana, Z. and A. Pnueli, "The modal logic of programs," Prec. 6th International Colloquium on Automata, Languages and Programming, Graz, Austria (July 1979). Lecture Notes in Computer Science, Vol. 71, Springer Verlag, pp. 385-409.
11. Manna, Z. and A. Pnueli, "Verification of concurrent programs: The temporal framework," in The Correctness Problem in Computer Science (R.S. Boyer and J S. Moore, eda.), International Lecture Series in Computer Science, Academic Press, London, 1981
12. Manaa, Z. and R. Waldinger, "Is 'sometime' sometimes better than 'Always'?: Intermittent assertions in proving program correctness," CACM, Vol 21, No. 2, pp. 159-172 (February 1978), pp. 159-172.
13. Owicki, S. and D. Gries, "an axiomatic proof technique for parallel programs," Acta Informatica, Vol. 6 (1976), pp. 319-340.
14. Owicki, S. and L. Lamport, "rProving liveness properties of concurrent programs," unpublished report (october 1980).
15. Pnueli, A., "The temporal logic of programs," Prac. 18th FOCS, Providence, RI (November 1977), pp. 46-57.
16. Pnueli, A., "The temporal semantics of concurrent programs," Proc. Symposium on Semantics of Concurrent Computations, Evian, France (July 1979), Lecture Notes in Compaber Sclence, Vol. 70, Springer Verlag, pp, 1-20.