메뉴 건너뛰기




Volumn 6, Issue 1, 1984, Pages 68-93

Synthesis of Communicating Processes from Temporal Logic Specifications

Author keywords

Concurrency; mutual exclusion; specification; synchronization

Indexed keywords


EID: 84976828744     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/357233.357237     Document Type: Article
Times cited : (276)

References (15)
  • 2
    • 0002367651 scopus 로고
    • Synthesis of synchronization skeletons from branching time temporal logic.
    • (Yorktown-Heights, N.Y.). Lecture Notes in Computer Science, Springer-Verlag, New York
    • CLARKE, E. M., AND EMERSON, E.A. Synthesis of synchronization skeletons from branching time temporal logic. In Proceedings of the Workshop on Logics of Programs (Yorktown-Heights, N.Y.). Lecture Notes in Computer Science, Springer-Verlag, New York, 1981, pp. 52-71.
    • (1981) In Proceedings of the Workshop on Logics of Programs , pp. 52-71
    • CLARKE, E.M.1    EMERSON, E.A.2
  • 5
    • 24944432966 scopus 로고
    • Path expressions.
    • Carnegie-Mellon University, Pittsburgh, Pa.
    • HABERMANN, A.N. Path expressions. Computer Science Report, Carnegie-Mellon University, Pittsburgh, Pa., 1975.
    • (1975) Computer Science Report
    • HABERMANN, A.N.1
  • 6
    • 0018005391 scopus 로고
    • Communicating sequential processes.
    • (Aug.)
    • HOARE, C. A. R. Communicating sequential processes. Commun. ACM 21, 8 (Aug. 1978), 666-677.
    • (1978) Commun. ACM , vol.21 , Issue.8 , pp. 666-677
    • HOARE, C.A.R.1
  • 7
    • 84910442702 scopus 로고
    • Ph.D. dissertation, Laboratory for Computer Science, Massachusetts Institute of Technology, Boston, Mass., June
    • LAVENTHAL, M. Synthesis of synchronization code for data abstractions. Ph.D. dissertation, Laboratory for Computer Science, Massachusetts Institute of Technology, Boston, Mass., June 1978.
    • (1978) Synthesis of synchronization code for data abstractions.
    • LAVENTHAL, M.1
  • 8
    • 0000204728 scopus 로고
    • Verification of concurrent programs: the temporal framework.
    • R. S. Boyer and J. S. Moore (eds.). International Lecture Series in Computer Science. Academic Press, New York
    • MANNA, Z., AND PNEULI, I. Verification of concurrent programs: the temporal framework. In The Correctness Problem in Computer Science, R. S. Boyer and J. S. Moore (eds.). International Lecture Series in Computer Science. Academic Press, New York, 1981, pp. 215-273.
    • (1981) In The Correctness Problem in Computer Science , pp. 215-273
    • MANNA, Z.1    PNEULI, I.2
  • 14
    • 85034666435 scopus 로고
    • Specification and synthesis of communicating processes using an extended temporal logic.
    • (Albuquerque, N.M., Jan. 25-27), ACM, New York
    • WOLPER, P. Specification and synthesis of communicating processes using an extended temporal logic. In Proceedings of 9th ACM Symposium on Principles of Programming Languages (Albuquerque, N.M., Jan. 25-27), ACM, New York, 1982, pp. 20-33.
    • (1982) In Proceedings of 9th ACM Symposium on Principles of Programming Languages , pp. 20-33
    • WOLPER, P.1


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