메뉴 건너뛰기




Volumn , Issue , 2009, Pages 453-464

Semantics-aware trace analysis

Author keywords

Orithms; Reliability

Indexed keywords

ANALYSIS TECHNIQUES; DYNAMIC CODE GENERATION; DYNAMIC PROGRAM ANALYSIS; EXECUTION TRACE; HIGH-LEVEL ABSTRACTION; HUMAN REASONING; JAVA PROGRAM; LARGE PROGRAMS; MULTI-THREADING; NONLOCAL; OPEN-SOURCE; ORITHMS; PROGRAM EXECUTION; PROGRAM PROPERTIES; REFACTORINGS; UNDERLYING CAUSE;

EID: 70450235111     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1542476.1542527     Document Type: Conference Paper
Times cited : (26)

References (24)
  • 1
    • 0025448361 scopus 로고
    • Dynamic Program Slicing
    • H. Agrawal and J.R. Horgan. Dynamic Program Slicing. In PLDI'90, pages 246-256, 1990.
    • (1990) PLDI'90 , pp. 246-256
    • Agrawal, H.1    Horgan, J.R.2
  • 2
    • 34247400790 scopus 로고    scopus 로고
    • ASE'07
    • 3-36
    • T. Apiwattanapong, A. Orso, and M.J. Harrold. JDiff: A Differencing Technique and Tool for Object-Oriented Programs. ASE'07, 14(1):3-36, 2007.
    • (2007) , vol.14 , Issue.1
    • Apiwattanapong, T.1    Orso, A.2    Harrold, M.J.3
  • 3
    • 84964528874 scopus 로고    scopus 로고
    • L. Bergroth, H. Hakonen, and T. Raita. A Survey of Longest Common Subsequence Algorithms. In SPIRE'00, page 39, 2000.
    • L. Bergroth, H. Hakonen, and T. Raita. A Survey of Longest Common Subsequence Algorithms. In SPIRE'00, page 39, 2000.
  • 4
    • 34247337300 scopus 로고    scopus 로고
    • DSD-Crasher: A Hybrid Analysis Tool for Bug Finding
    • C. Csallner and Y. Smaragdakis. DSD-Crasher: A Hybrid Analysis Tool for Bug Finding. In ISSTA'06, pages 245-254, 2006.
    • (2006) ISSTA'06 , pp. 245-254
    • Csallner, C.1    Smaragdakis, Y.2
  • 5
    • 67650809815 scopus 로고    scopus 로고
    • Extraction of Bug Localization Benchmarks from History
    • Valentin Dallmeier and Thomas Zimmermann. Extraction of Bug Localization Benchmarks from History. In ASE, pages 433-436, 2007.
    • (2007) ASE , pp. 433-436
    • Dallmeier, V.1    Zimmermann, T.2
  • 6
    • 0035250541 scopus 로고    scopus 로고
    • Dynamically Discovering Likely Program Invariants to Support Program Evolution
    • M. Ernst, J. Cockrell, W. Griswold, and D. Notkin. Dynamically Discovering Likely Program Invariants to Support Program Evolution. TSE, 27(2):1-25, 2001.
    • (2001) TSE , vol.27 , Issue.2 , pp. 1-25
    • Ernst, M.1    Cockrell, J.2    Griswold, W.3    Notkin, D.4
  • 8
    • 33745773504 scopus 로고    scopus 로고
    • Accurately Choosing Execution Runs for Software Fault Localization
    • Liang Guo, Abhik Roychoudhury, and Tao Wang. Accurately Choosing Execution Runs for Software Fault Localization. In CC, pages 80-95, 2006.
    • (2006) CC , pp. 80-95
    • Guo, L.1    Roychoudhury, A.2    Wang, T.3
  • 9
    • 0016518550 scopus 로고    scopus 로고
    • D. S. Hirschberg. A Linear Space Algorithm for Computing Maximal Common Subsequences. CACM, 18(6):341-343, 1975.
    • D. S. Hirschberg. A Linear Space Algorithm for Computing Maximal Common Subsequences. CACM, 18(6):341-343, 1975.
  • 10
    • 70450226269 scopus 로고    scopus 로고
    • Kevin Hoffman, Patrick Eugster, and Suresh Jagannathan. RPrism: Efficient Regression Analysis Using View-Based Trace Differencing. Technical Report dynt-200811-1, Purdue University, 2008.
    • Kevin Hoffman, Patrick Eugster, and Suresh Jagannathan. RPrism: Efficient Regression Analysis Using View-Based Trace Differencing. Technical Report dynt-200811-1, Purdue University, 2008.
  • 11
    • 0012583283 scopus 로고    scopus 로고
    • Featherweight Java: A Minimal Core Calculus for Java and GJ
    • May
    • Atsushi Igarashi, Benjamin C. Pierce, and Philip Wadler. Featherweight Java: A Minimal Core Calculus for Java and GJ. ACM TOPLAS, 23(3):396-450, May 2001.
    • (2001) ACM TOPLAS , vol.23 , Issue.3 , pp. 396-450
    • Igarashi, A.1    Pierce, B.C.2    Wadler, P.3
  • 13
    • 34547229642 scopus 로고    scopus 로고
    • Have Things Changed Now?: An Empirical Study of Bug Characteristics in Modern Open Source Software
    • Zhenmin Li, Lin Tan, Xuanhui Wang, Shan Lu, Yuanyuan Zhou, and Chengxiang Zhai. Have Things Changed Now?: An Empirical Study of Bug Characteristics in Modern Open Source Software. In ASID, pages 25-33, 2006.
    • (2006) ASID , pp. 25-33
    • Li, Z.1    Tan, L.2    Wang, X.3    Lu, S.4    Zhou, Y.5    Zhai, C.6
  • 14
    • 0038716503 scopus 로고    scopus 로고
    • Bug Isolation via Remote Program Sampling
    • Ben Liblit, Alex Aiken, Alice X. Zheng, and Michael I. Jordan. Bug Isolation via Remote Program Sampling. In PLDI '03, pages 141-154, 2003.
    • (2003) PLDI '03 , pp. 141-154
    • Liblit, B.1    Aiken, A.2    Zheng, A.X.3    Jordan, M.I.4
  • 15
    • 42149124293 scopus 로고    scopus 로고
    • Scalable Omniscient Debugging
    • G. Pothier, E. Tanter, and J. Piquer. Scalable Omniscient Debugging. In OOPSLA'07, pages 535-552, 2007.
    • (2007) OOPSLA'07 , pp. 535-552
    • Pothier, G.1    Tanter, E.2    Piquer, J.3
  • 16
    • 12844268515 scopus 로고    scopus 로고
    • Chianti: A Tool for Change Impact Analysis of Java Programs
    • X. Ren, F. Shah, F. Tip, B. Ryder, and O. Chesley. Chianti: A Tool for Change Impact Analysis of Java Programs. In OOPSLA'04, pages 432-448, 2004.
    • (2004) OOPSLA'04 , pp. 432-448
    • Ren, X.1    Shah, F.2    Tip, F.3    Ryder, B.4    Chesley, O.5
  • 17
    • 34547239481 scopus 로고    scopus 로고
    • Finding Failure-Inducing Changes in Java Programs Using Change Classification
    • M. Stoerzer, B. Ryder, X. Ren, and F. Tip. Finding Failure-Inducing Changes in Java Programs Using Change Classification. In ESECFSE-14, pages 57-68, 2006.
    • (2006) ESECFSE-14 , pp. 57-68
    • Stoerzer, M.1    Ryder, B.2    Ren, X.3    Tip, F.4
  • 18
    • 70450254076 scopus 로고    scopus 로고
    • F. Tip. A Survey of Program Slicing Techniques. Journal of programming languages, 3:121-189, 1995.
    • F. Tip. A Survey of Program Slicing Techniques. Journal of programming languages, 3:121-189, 1995.
  • 20
    • 57349109988 scopus 로고    scopus 로고
    • Efficient Program Execution Indexing
    • Bin Xin, William N. Sumner, and Xiangyu Zhang. Efficient Program Execution Indexing. In PLDI '08, pages 238-248, 2008.
    • (2008) PLDI '08 , pp. 238-248
    • Xin, B.1    Sumner, W.N.2    Zhang, X.3
  • 21
    • 0037672303 scopus 로고    scopus 로고
    • Isolating Cause-Effect Chains from Computer Programs
    • Andreas Zeller. Isolating Cause-Effect Chains from Computer Programs. In FSE-10, pages 1-10, 2002.
    • (2002) FSE-10 , pp. 1-10
    • Zeller, A.1
  • 22
    • 0036472476 scopus 로고    scopus 로고
    • Simplifying and Isolating Failure-Inducing Input
    • Andreas Zeller and Ralf Hildebrandt. Simplifying and Isolating Failure-Inducing Input. TSE, 28(2):183-200, 2002.
    • (2002) TSE , vol.28 , Issue.2 , pp. 183-200
    • Zeller, A.1    Hildebrandt, R.2
  • 23
    • 4544283390 scopus 로고    scopus 로고
    • Cost Effective Dynamic Program Slicing
    • X. Zhang and R. Gupta. Cost Effective Dynamic Program Slicing. In PLDI'04, pages 94-106, 2004.
    • (2004) PLDI'04 , pp. 94-106
    • Zhang, X.1    Gupta, R.2
  • 24
    • 32344449616 scopus 로고    scopus 로고
    • Matching Execution Histories of Program Versions
    • X. Zhang and R. Gupta. Matching Execution Histories of Program Versions. In ESEC/FSE-13, pages 197-206, 2005.
    • (2005) ESEC/FSE-13 , pp. 197-206
    • Zhang, X.1    Gupta, R.2


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