메뉴 건너뛰기




Volumn , Issue , 2004, Pages 221-231

Exploiting purity for atomicity

Author keywords

Atomicity; Concurrent programs; Purity; Reduction

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; ITERATIVE METHODS; MATHEMATICAL MODELS; SEMANTICS; SIGNAL INTERFERENCE; SYNCHRONIZATION;

EID: 23744506416     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1007512.1007543     Document Type: Conference Paper
Times cited : (21)

References (40)
  • 3
    • 84876658945 scopus 로고
    • A method for refining atomicity in parallel algorithms
    • PARLE 89: Parallel Architectures and Languages Europe. Springer-Verlag
    • R.-J. Back. A method for refining atomicity in parallel algorithms. In PARLE 89: Parallel Architectures and Languages Europe, volume 366 of Lecture Notes in Computer Science, pages 199-216. Springer-Verlag, 1989.
    • (1989) Lecture Notes in Computer Science , vol.366 , pp. 199-216
    • Back, R.-J.1
  • 6
    • 84945912413 scopus 로고    scopus 로고
    • Reduction in TLA
    • Proceedings of the International Conference on Concurrency Theory. Springer-Verlag
    • E. Cohen and L. Lamport. Reduction in TLA. In Proceedings of the International Conference on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 317-331. Springer-Verlag, 1998.
    • (1998) Lecture Notes in Computer Science , vol.1466 , pp. 317-331
    • Cohen, E.1    Lamport, L.2
  • 7
    • 0036038312 scopus 로고    scopus 로고
    • Invariant-based specification, synthesis, and verification of synchronization in concurrent programs
    • X. Deng, M. Dwyer, J. Hatcliff, and M. Mizuno. Invariant-based specification, synthesis, and verification of synchronization in concurrent programs. In International Conference on Software Engineering, pages 442-452, 2002.
    • (2002) International Conference on Software Engineering , pp. 442-452
    • Deng, X.1    Dwyer, M.2    Hatcliff, J.3    Mizuno, M.4
  • 13
    • 23744506416 scopus 로고    scopus 로고
    • Exploiting purity for atomicity
    • Williams College
    • C. Flanagan, S. N. Freund, and S. Qadeer. Exploiting purity for atomicity. Technical Note 04-02, Williams College, 2004.
    • (2004) Technical Note , vol.4 , Issue.2
    • Flanagan, C.1    Freund, S.N.2    Qadeer, S.3
  • 18
    • 4644245164 scopus 로고    scopus 로고
    • Checking concise specifications for multithreaded software
    • to appear
    • S. N. Freund and S. Qadeer. Checking concise specifications for multithreaded software. In Journal of Object Technology, 2004. (to appear).
    • (2004) Journal of Object Technology
    • Freund, S.N.1    Qadeer, S.2
  • 25
    • 0005456280 scopus 로고
    • Towards a theory of parallel programming
    • Operating Systems Techniques. Academic Press
    • C. A. R. Hoare. Towards a theory of parallel programming. In Operating Systems Techniques, volume 9 of A.P.I. C. Studies in Data Processing, pages 61-71. Academic Press, 1972.
    • (1972) A.P.I. C. Studies in Data Processing , vol.9 , pp. 61-71
    • Hoare, C.A.R.1
  • 26
    • 0008199832 scopus 로고
    • Pretending atomicity
    • DEC Systems Research Center
    • L. Lamport and F. B. Schneider. Pretending atomicity. Research Report 44, DEC Systems Research Center, 1989.
    • (1989) Research Report , vol.44
    • Lamport, L.1    Schneider, F.B.2
  • 27
    • 0016592810 scopus 로고
    • Reduction: A method of proving properties of parallel programs
    • R. J. Lipton. Reduction: A method of proving properties of parallel programs. Communications of the ACM, 18(12):717-721, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.12 , pp. 717-721
    • Lipton, R.J.1
  • 29
    • 84976817238 scopus 로고
    • Process structuring, synchronization, and recovery using atomic actions
    • D. B. Lomet. Process structuring, synchronization, and recovery using atomic actions. Language Design for Reliable Software, pages 128-137, 1977.
    • (1977) Language Design for Reliable Software , pp. 128-137
    • Lomet, D.B.1
  • 33
    • 70350750512 scopus 로고
    • Combining partial order reductions with on-the-fly model checking
    • D. Dill, editor, Lecture Notes in Computer Science 818. Springer-Verlag
    • D. Peled. Combining partial order reductions with on-the-fly model checking. In D. Dill, editor, CAV 94: Computer Aided Verification, Lecture Notes in Computer Science 818, pages 377-390. Springer-Verlag, 1994.
    • (1994) CAV 94: Computer Aided Verification , pp. 377-390
    • Peled, D.1
  • 36
    • 0005042862 scopus 로고    scopus 로고
    • Double-checked locking - A optimization pattern for efficiently initializing and accessing thread-safe objects
    • R. Martin, F. Buschmann, and D. Riehle, editors. Addison-Wesley
    • D. C. Schmidt and T. H. Harrison. Double-checked locking - a optimization pattern for efficiently initializing and accessing thread-safe objects. In R. Martin, F. Buschmann, and D. Riehle, editors, Pattern Languages of Program Design 3. Addison-Wesley, 1997.
    • (1997) Pattern Languages of Program Design , vol.3
    • Schmidt, D.C.1    Harrison, T.H.2
  • 37
  • 39
    • 11344262111 scopus 로고    scopus 로고
    • Run-time analysis for atomicity
    • Proceedings of the Workshop on Runtime Verification. Elsevier
    • L. Wang and S. D. Stoller. Run-time analysis for atomicity. In Proceedings of the Workshop on Runtime Verification, volume 89(2) of Electronic Notes in Computer Science. Elsevier, 2003.
    • (2003) Electronic Notes in Computer Science , vol.89 , Issue.2
    • Wang, L.1    Stoller, S.D.2


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