메뉴 건너뛰기




Volumn , Issue , 2003, Pages 178-187

Context-sensitive slicing of concurrent programs

Author keywords

concurrency; context sensitive; parallelism; program analysis; program slicing

Indexed keywords

CONCURRENT PROGRAM; CONTEXT-SENSITIVE; CONTROL FLOW GRAPHS; INLINING; INTER-PROCEDURAL; PROGRAM ANALYSIS; PROGRAM DEPENDENCE GRAPH; PROGRAM SLICING;

EID: 33644574841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/940071.940096     Document Type: Conference Paper
Times cited : (22)

References (37)
  • 1
    • 0002611590 scopus 로고    scopus 로고
    • Slicing concurrent java programs
    • Z. Chen and B. Xu. Slicing concurrent java programs. ACM SIGPLAN Notices, 36(4):41-47, 2001.
    • (2001) ACM SIGPLAN Notices , vol.36 , Issue.4 , pp. 41-47
    • Chen, Z.1    Xu, B.2
  • 5
    • 0026244475 scopus 로고
    • Techniques for debugging parallel programs with flowback analysis
    • J.-D. Choi, B. Miller, and R. Netzer. Techniques for debugging parallel programs with flowback analysis. ACM Trans. Prog. Lang. Syst., 13(4):491-530, 1991.
    • (1991) ACM Trans. Prog. Lang. Syst. , vol.13 , Issue.4 , pp. 491-530
    • Choi, J.-D.1    Miller, B.2    Netzer, R.3
  • 13
    • 0030146262 scopus 로고    scopus 로고
    • Parallelism for free: Efficient and optimal bitvector analyses for parallel programs
    • J. Knoop, B. Steffen, and J. Vollmer. Parallelism for free: Efficient and optimal bitvector analyses for parallel programs. ACM Trans. Prog. Lang. Syst., 18(3):268-299, 1996.
    • (1996) ACM Trans. Prog. Lang. Syst. , vol.18 , Issue.3 , pp. 268-299
    • Knoop, J.1    Steffen, B.2    Vollmer, J.3
  • 24
    • 84887435787 scopus 로고    scopus 로고
    • An efficient algorithm for computing mhp information for concurrent java programs
    • O. Nierstrasz and M. Lemoine, editors, 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, Springer
    • G. Naumovich, G. S. Avrunin, and L. A. Clarke. An efficient algorithm for computing mhp information for concurrent java programs. In O. Nierstrasz and M. Lemoine, editors, 7th ACM SIGSOFT Symposium on the Foundations of Software Engineering, volume 1687 of LNCS, pages 338-354. Springer, 1999.
    • (1999) LNCS , vol.1687 , pp. 338-354
    • Naumovich, G.1    Avrunin, G.S.2    Clarke, L.A.3
  • 25
    • 0000422707 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • G. Ramalingam. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Prog. Lang. Syst., 22(2):416-430, 2000.
    • (2000) ACM Trans. Prog. Lang. Syst. , vol.22 , Issue.2 , pp. 416-430
    • Ramalingam, G.1
  • 28
    • 84947290808 scopus 로고    scopus 로고
    • Constraint-based inter-procedural analysis of parallel programs
    • Proceedings of ESOP'00, 9th European Symposium on Programming
    • H. Seidl and B. Steffen. Constraint-based inter-procedural analysis of parallel programs. In Proceedings of ESOP'00, 9th European Symposium on Programming, volume 1782 of LNCS, 2000.
    • (2000) LNCS , vol.1782
    • Seidl, H.1    Steffen, B.2
  • 29
  • 30
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • F. Tip. A survey of program slicing techniques. Journal of programming languages, 3(3), 1995.
    • (1995) Journal of Programming Languages , vol.3 , Issue.3
    • Tip, F.1
  • 33
    • 0021457061 scopus 로고
    • Program slicing
    • M. Weiser. Program slicing. IEEE Trans. Softw. Eng., 10(4):352-357, 1984.
    • (1984) IEEE Trans. Softw. Eng. , vol.10 , Issue.4 , pp. 352-357
    • Weiser, M.1


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