메뉴 건너뛰기




Volumn SE-7, Issue 4, 1981, Pages 417-426

Proofs of Networks of Processes

Author keywords

Communication networks; distributed systems; message passing systems; program proofs

Indexed keywords

COMPUTER SYSTEMS, DIGITAL;

EID: 0019596077     PISSN: 00985589     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSE.1981.230844     Document Type: Article
Times cited : (366)

References (13)
  • 1
    • 84976742643 scopus 로고
    • A proof system for communicating sequential processes
    • July
    • K. R. Apt, N. Francez, and W. P. de Roever, “A proof system for communicating sequential processes,” TOPLAS, vol. 2, July 1980.
    • (1980) TOPLAS, vol , vol.2
    • Apt, K.R.1    Francez, N.2    de Roever, W.P.3
  • 2
    • 0007434664 scopus 로고
    • Program proving: Coroutines
    • M. Clint, “Program proving: Coroutines,“ Acta Inform., vol. 2, 1973.
    • (1973) Acta Inform. , vol.2
    • Clint, M.1
  • 3
    • 0041852207 scopus 로고
    • Deadlock absence proofs for networks of communicating processes
    • K. M. Chandy and J. Misra, “Deadlock absence proofs for networks of communicating processes,” Inform. Process. Lett., vol. 9, no. 4, 1974.
    • (1974) Inform. Process. Lett , vol.9 , Issue.4
    • Chandy, K.M.1    Misra, J.2
  • 4
    • 84976829840 scopus 로고
    • A simple model of distributed programs based on implementation hiding and process autonomy
    • July
    • —, “A simple model of distributed programs based on implementation hiding and process autonomy,” SIGPLAN Notices, July 1980.
    • (1980) SIGPLAN Notices
  • 5
    • 84929897842 scopus 로고    scopus 로고
    • A correctness proof for communicating processes: A small exercise
    • EWD607, The Netherlands
    • E. W. Dijkstra, “A correctness proof for communicating processes: A small exercise,” EWD607, The Netherlands.
    • Dijkstra, E.W.1
  • 6
    • 0018307411 scopus 로고
    • Principles of proving concurrent programs in GYPSY
    • on Principles of Programming Lang, San Antonio, TX, Jan
    • D. I. Good, R. M. Cohen, and J. Keeton-Williams, “Principles of proving concurrent programs in GYPSY,” in Conf. Rec. 6th Annu. ACM Symp. on Principles of Programming Lang., San Antonio, TX, Jan. 1979.
    • (1979) Conf. Rec. 6th Annu. ACM Symp.
    • Good, D.I.1    Cohen, R.M.2    Keeton-Williams, J.3
  • 7
    • 84945708698 scopus 로고
    • An axiomatic basis for computer programming
    • C. A. R. Hoare, “An axiomatic basis for computer programming,” Commun. Ass. Comput. Mach., vol. 12, 1969.
    • (1969) Commun. Ass. Comput. Mach , vol.12
    • Hoare, C. A. R.1
  • 8
    • 0018005391 scopus 로고
    • Communicating sequential processes
    • —, “Communicating sequential processes,” Commun. Ass. Comput. Mach., vol. 21, no. 8, 1978.
    • (1978) Commun. Ass. Comput. Mach. , vol.21 , Issue.8
  • 9
    • 84941861399 scopus 로고
    • A model for communicating sequential processes
    • Oxford Univ., Dec
    • —, “A model for communicating sequential processes,” Comput. Lab., Oxford Univ., Dec. 1978.
    • (1978) Comput. Lab.
  • 11
    • 0016972709 scopus 로고
    • Formal verification of parallel programs
    • R. M. Keller, “Formal verification of parallel programs,” Commun. Ass. Comput. Mach., vol. 19, no. 7, 1976.
    • (1976) Commun. Ass. Comput. Mach , vol.19 , Issue.7
    • Keller, R.M.1
  • 12
    • 84941869868 scopus 로고
    • A proof technique for communicating sequential processes (with an example)
    • TR 79–401, Dep. Comput. Sci, Cornell Univ., Ithaca, NY,
    • G. M. Levin, “A proof technique for communicating sequential processes (with an example),” TR 79–401, Dep. Comput. Sci, Cornell Univ., Ithaca, NY, 1979.
    • (1979)
    • Levin, G.M.1
  • 13
    • 0017173886 scopus 로고
    • An axiomatic proof technique for parallel programs
    • S. Owicki and D. Gries, “An axiomatic proof technique for parallel programs,” Acta Inform., vol 6, 1976.
    • (1976) Acta Inform , vol.6
    • Owicki, S.1    Gries, D.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.