메뉴 건너뛰기




Volumn 46, Issue 7, 1997, Pages 779-782

How to make a correct multiprocess program execute correctly on a multiprocessor

Author keywords

Concurrency; Memory consistency; Multiprocessor; Synchronization; Verification

Indexed keywords

ALGORITHMS; CONCURRENCY CONTROL; PROGRAM PROCESSORS; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

EID: 0031189694     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.599898     Document Type: Article
Times cited : (65)

References (17)
  • 1
    • 0040690883 scopus 로고
    • On Global-Time and Inter-Process Communication
    • M.Z. Kwiatkowska, M. W. Shields, and R.M. Thomas, eds., Leicester: Springer-Verlag
    • U. Abraham, S. Ben-David, and M. Magidor, "On Global-Time and Inter-Process Communication," Semantics for Concurrency, M.Z. Kwiatkowska, M. W. Shields, and R.M. Thomas, eds., pp. 311-323. Leicester: Springer-Verlag, 1990.
    • (1990) Semantics for Concurrency , pp. 311-323
    • Abraham, U.1    Ben-David, S.2    Magidor, M.3
  • 3
    • 0024700207 scopus 로고
    • On Lamport's Interprocessor Communication Model
    • July
    • F.D. Anger, "On Lamport's Interprocessor Communication Model," ACM Trans. Programming Languages and Systems, vol. 11, no. 3, pp. 404-417, July 1989.
    • (1989) ACM Trans. Programming Languages and Systems , vol.11 , Issue.3 , pp. 404-417
    • Anger, F.D.1
  • 4
    • 0016472703 scopus 로고
    • Proving Assertions about Parallel Programs
    • Feb.
    • E.A. Ashcroft, "Proving Assertions about Parallel Programs," J. Computer and System Sciences, vol. 10, pp. 110-135, Feb. 1975.
    • (1975) J. Computer and System Sciences , vol.10 , pp. 110-135
    • Ashcroft, E.A.1
  • 8
    • 84976678577 scopus 로고
    • Proving Sequential Consistency of High-Performance Shared Memories
    • July 1991. A full version available as an AT&T Bell Laboratories technical report, May
    • P.B. Gibbons, M. Merritt, and K. Gharachorloo, "Proving Sequential Consistency of High-Performance Shared Memories," Proc. Symp. Parallel Algorithms and Architectures, July 1991. A full version available as an AT&T Bell Laboratories technical report, May 1991.
    • (1991) Proc. Symp. Parallel Algorithms and Architectures
    • Gibbons, P.B.1    Merritt, M.2    Gharachorloo, K.3
  • 9
    • 0017472779 scopus 로고
    • Proving the Correctness of Multiprocess Programs
    • Mar.
    • L. Lamport, "Proving the Correctness of Multiprocess Programs," IEEE Trans. Software Eng., vol. 3, no. 2, pp. 125-143, Mar. 1977.
    • (1977) IEEE Trans. Software Eng. , vol.3 , Issue.2 , pp. 125-143
    • Lamport, L.1
  • 10
    • 0018518477 scopus 로고
    • How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
    • Sept.
    • L. Lamport, "How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs," IEEE Trans. Computers, vol. 28, no. 9, pp. 690-691, Sept. 1979.
    • (1979) IEEE Trans. Computers , vol.28 , Issue.9 , pp. 690-691
    • Lamport, L.1
  • 11
    • 0002908596 scopus 로고
    • A New Approach to Proving the Correctness of Multiprocess Programs
    • July
    • L. Lamport, "A New Approach to Proving the Correctness of Multiprocess Programs," ACM Trans. Programming Languages and Systems, vol. 1, no. 1, pp. 84-97, July 1979.
    • (1979) ACM Trans. Programming Languages and Systems , vol.1 , Issue.1 , pp. 84-97
    • Lamport, L.1
  • 12
    • 0022699092 scopus 로고
    • The Mutual Exclusion Problem - Part I: A Theory of Interprocess Communication
    • Jan.
    • L. Lamport, "The Mutual Exclusion Problem - Part I: A Theory of Interprocess Communication," J. ACM, vol. 33, no. 2, pp. 313-326, Jan. 1985.
    • (1985) J. ACM , vol.33 , Issue.2 , pp. 313-326
    • Lamport, L.1
  • 13
    • 33747154326 scopus 로고
    • The Mutual Exclusion Problem - Part II: Statement and Solutions
    • Jan.
    • L. Lamport, "The Mutual Exclusion Problem - Part II: Statement and Solutions," J. ACM, vol. 32, no. 1, pp. 327-348, Jan. 1985.
    • (1985) J. ACM , vol.32 , Issue.1 , pp. 327-348
    • Lamport, L.1
  • 14
    • 0022873767 scopus 로고
    • On Interprocess Communication - Part I: Basic Formalism
    • L. Lamport, "On Interprocess Communication - Part I: Basic Formalism," Distributed Computing, vol. 1, pp. 77-85, 1986.
    • (1986) Distributed Computing , vol.1 , pp. 77-85
    • Lamport, L.1
  • 15
    • 0025460470 scopus 로고
    • Win and sin: Predicate Transformers for Concurrency
    • July
    • L. Lamport, "win and sin: Predicate Transformers for Concurrency," ACM Trans. Programming Languages and Systems, vol. 12, no. 3, pp. 396-428, July 1990.
    • (1990) ACM Trans. Programming Languages and Systems , vol.12 , Issue.3 , pp. 396-428
    • Lamport, L.1
  • 16
    • 0016951439 scopus 로고
    • Verifying Properties of Parallel Programs An Axiomatic Approach
    • May
    • S. Owicki and D. Gries, "Verifying Properties of Parallel Programs An Axiomatic Approach," Comm. ACM, vol. 19, no. 5, pp. 279-284, May 1976.
    • (1976) Comm. ACM , vol.19 , Issue.5 , pp. 279-284
    • Owicki, S.1    Gries, D.2


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