메뉴 건너뛰기




Volumn 28, Issue 6, 2006, Pages 1088-1144

Interprocedural slicing of multithreaded programs with applications to Java

Author keywords

Context sensitivity; Data dependence; Interference dependence; Multithreading; Program slicing; Strongly connected regions

Indexed keywords

INTERFERENCE DEPENDENCE; MULTITHREADING; PROGRAM SLICING; STRONGLY CONNECTED REGIONS;

EID: 33845521068     PISSN: 01640925     EISSN: 15584593     Source Type: Journal    
DOI: 10.1145/1186632.1186636     Document Type: Article
Times cited : (35)

References (48)
  • 1
    • 0027606679 scopus 로고
    • Debugging with dynamic slicing and backtracking
    • AGRAWAL, H., DEMILLO, R., AND SPAFFORD, E. 1993. Debugging with dynamic slicing and backtracking. Softw. - Pract. Exper. 23, 6, 589-616.
    • (1993) Softw. - Pract. Exper. , vol.23 , Issue.6 , pp. 589-616
    • Agrawal, H.1    Demillo, R.2    Spafford, E.3
  • 5
    • 0029233080 scopus 로고
    • Program integration for languages with procedure calls
    • BINKLEY, D., HORWITZ, S., AND REPS, T. 1995. Program integration for languages with procedure calls. ACM Trans. Softw. Eng. Meth. 4, 1 (Jan.), 3-35.
    • (1995) ACM Trans. Softw. Eng. Meth. , vol.4 , Issue.1 JAN , pp. 3-35
    • Binkley, D.1    Horwitz, S.2    Reps, T.3
  • 6
    • 0025461033 scopus 로고
    • An interval-based approach to exhaustive and incremental interprocedural data-flow analysis
    • BURKE, M. 1990. An interval-based approach to exhaustive and incremental interprocedural data-flow analysis. ACM Trans. Prog. Lang. Syst. 12, 3 (July).
    • (1990) ACM Trans. Prog. Lang. Syst. , vol.12 , Issue.3 JULY
    • Burke, M.1
  • 8
    • 0002611590 scopus 로고    scopus 로고
    • Slicing concurrent Java programs
    • CHEN, Z. AND XU, B. 2001. Slicing concurrent Java programs. ACM SIGPLAN Notices 36, 4 (Apr.), 41-47.
    • (2001) ACM SIGPLAN Notices , vol.36 , Issue.4 APR , pp. 41-47
    • Chen, Z.1    Xu, B.2
  • 9
    • 84988034580 scopus 로고
    • Slicing concurrent programs
    • Lecture Notes in Computer Science, Springer-Verlag, New York
    • CHENG, J. 1993. Slicing concurrent programs. In Automated and Algorithmic Debugging 1st International Workshop. Lecture Notes in Computer Science, vol 749. Springer-Verlag, New York.
    • (1993) Automated and Algorithmic Debugging 1st International Workshop , vol.749
    • Cheng, J.1
  • 13
    • 0026203186 scopus 로고
    • Using program slicing in software maintenance
    • GALLAGHER, K. B. AND LYLE, J. R. 1991. Using program slicing in software maintenance. IEEE Trans. Softw. Eng. 17, 8, 751-761.
    • (1991) IEEE Trans. Softw. Eng. , vol.17 , Issue.8 , pp. 751-761
    • Gallagher, K.B.1    Lyle, J.R.2
  • 18
    • 0024700474 scopus 로고
    • Integrating noninterfering versions of programs
    • HORWITZ, S., PRINS, J., AND REPS, T. 1989. Integrating noninterfering versions of programs. ACM Trans. Prog. Lang. Syst. 11, 3, 345-387.
    • (1989) ACM Trans. Prog. Lang. Syst. , vol.11 , Issue.3 , pp. 345-387
    • Horwitz, S.1    Prins, J.2    Reps, T.3
  • 20
  • 28
    • 33751040831 scopus 로고    scopus 로고
    • Ph.D. thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay. Examiners: Dr. Frank Tip, IBM T. J. Watson Research Center and Prof. R. Mall, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur
    • NANDA, M. G. 2001. Slicing concurrent Java programs: Issues and solutions. Ph.D. thesis, Department of Computer Science and Engineering, Indian Institute of Technology, Bombay. http://www.cse.iitb.ernet.in/~ramesh/gow- thesis.ps.gz; Examiners: Dr. Frank Tip, IBM T. J. Watson Research Center and Prof. R. Mall, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur.
    • (2001) Slicing Concurrent Java Programs: Issues and Solutions
    • Nanda, M.G.1
  • 34
    • 0000422707 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • RAMALINGAM, G. 2000. Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22, 2, 416-430.
    • (2000) ACM Trans. Program. Lang. Syst. , vol.22 , Issue.2 , pp. 416-430
    • Ramalingam, G.1
  • 40
    • 0026213832 scopus 로고
    • Automatic partitioning of a program dependence graph into parallel tasks
    • SARKAR, V. 1991. Automatic partitioning of a program dependence graph into parallel tasks. IBM J. Res. Devel. 35, 779-804.
    • (1991) IBM J. Res. Devel. , vol.35 , pp. 779-804
    • Sarkar, V.1
  • 41
    • 0002823436 scopus 로고
    • Two approaches to interprocedural data flow analysis
    • S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, NJ
    • SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program. Flow Analysis: Theory and Applications, S. S. Muchnick and N. D. Jones, Eds. Prentice-Hall, Englewood Cliffs, NJ, 189-233.
    • (1981) Program. Flow Analysis: Theory and Applications , pp. 189-233
    • Sharir, M.1    Pnueli, A.2
  • 43
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • TIP, F. 1995. A survey of program slicing techniques. J. Prog. Lang. 3, 121-181.
    • (1995) J. Prog. Lang. , vol.3 , pp. 121-181
    • Tip, F.1
  • 47
    • 0026890189 scopus 로고
    • A program integration algorithm that accommodates semantics-preserving transformations
    • YANG, W., HORWITZ, S., AND REPS, T. 1992. A program integration algorithm that accommodates semantics-preserving transformations. ACM Trans. Softw. Eng. Method. 1, 3 (July), 310-354.
    • (1992) ACM Trans. Softw. Eng. Method. , vol.1 , Issue.3 JULY , pp. 310-354
    • Yang, W.1    Horwitz, S.2    Reps, T.3


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