메뉴 건너뛰기




Volumn 39, Issue 1, 2004, Pages 245-255

Summarizing procedures in concurrent programs

Author keywords

Concurrent programs; Interprocedural dataflow analysis; Model checking; Procedure summaries; Pushdown systems; Reduction; Transactions

Indexed keywords

ALGORITHMS; COMPUTER PROGRAMMING LANGUAGES; CONCURRENCY CONTROL; DATA FLOW ANALYSIS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; RECURSIVE FUNCTIONS; RELIABILITY; SYNCHRONIZATION;

EID: 1442312211     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/982962.964022     Document Type: Conference Paper
Times cited : (27)

References (22)
  • 3
    • 84947232436 scopus 로고    scopus 로고
    • Bebop: A symbolic model checker for Boolean programs
    • Springer-Verlag
    • T. Ball and S. K. Rajamani. Bebop: A symbolic model checker for Boolean programs. In SPIN 00: SPIN Workshop, LNCS 1885, pages 113-130. Springer-Verlag, 2000.
    • (2000) SPIN 00: SPIN Workshop, LNCS 1885 , pp. 113-130
    • Ball, T.1    Rajamani, S.K.2
  • 4
  • 7
    • 84892753835 scopus 로고
    • Concurrency analysis in the presence of procedures using a data-flow framework
    • ACM
    • E. Duesterwald and M. L. Soffa. Concurrency analysis in the presence of procedures using a data-flow framework. In TAV 91: Testing, Analysis and Verification, pages 36-48. ACM, 1991.
    • (1991) TAV 91: Testing, Analysis and Verification , pp. 36-48
    • Duesterwald, E.1    Soffa, M.L.2
  • 8
    • 85030211978 scopus 로고
    • Data flow analysis for verifying properties of concurrent programs
    • ACM
    • M. Dwyer and L. Clarke. Data flow analysis for verifying properties of concurrent programs. In FSE 94: Foundations of Software Engineering, pages 62-75. ACM, 1994.
    • (1994) FSE 94: Foundations of Software Engineering , pp. 62-75
    • Dwyer, M.1    Clarke, L.2
  • 9
    • 0033698872 scopus 로고    scopus 로고
    • Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
    • ACM
    • J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In: POPL 00: Principles of Programming Languages, pages 1-11. ACM, 2000.
    • (2000) POPL 00: Principles of Programming Languages , pp. 1-11
    • Esparza, J.1    Podelski, A.2
  • 17
    • 0016592810 scopus 로고
    • Reduction: A method of proving properties of parallel programs
    • R J. Lipton. Reduction: A method of proving properties of parallel programs. In Communications of the ACM, volume 18:12, pages 717-721, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.12 , pp. 717-721
    • Lipton, R.J.1
  • 18
    • 0000422707 scopus 로고    scopus 로고
    • Context sensitive synchronization sensitive analysis is undecidable
    • G. Ramalingam. Context sensitive synchronization sensitive analysis is undecidable. ACM Trans. on Programming Languages and Systems, 22:416-430, 2000.
    • (2000) ACM Trans. on Programming Languages and Systems , vol.22 , pp. 416-430
    • Ramalingam, G.1
  • 20
    • 64649104000 scopus 로고    scopus 로고
    • Analysis of multithreaded programs
    • Springer-Verlag
    • M. C. Rinard. Analysis of multithreaded programs. In SAS 01: Static Analysis, LNCS 2126, pages 1-19. Springer-Verlag, 2001.
    • (2001) SAS 01: Static Analysis, LNCS 2126 , pp. 1-19
    • Rinard, M.C.1
  • 21
  • 22
    • 0001863831 scopus 로고
    • Composition, decomposition and model checking optimal of pushdown processes
    • B. Steffen and O. Burkart. Composition, decomposition and model checking optimal of pushdown processes. Nordic Journal of Computing, 2(2):89-125, 1995.
    • (1995) Nordic Journal of Computing , vol.2 , Issue.2 , pp. 89-125
    • Steffen, B.1    Burkart, O.2


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