메뉴 건너뛰기




Volumn 40, Issue 6, 2005, Pages 38-47

Path slicing

Author keywords

Counterexample analysis; Program slicing

Indexed keywords

APPLICATION PROGRAMS; COUNTEREXAMPLE ANALYSIS; PATH SLICING; PROGRAM SLICING;

EID: 33745270033     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1064978.1065016     Document Type: Article
Times cited : (32)

References (27)
  • 5
    • 84944629827 scopus 로고    scopus 로고
    • Simple and efficient relational querying of software structures
    • IEEE
    • D. Beyer, A. Noack, and C. Lewerentz. Simple and efficient relational querying of software structures. In Proc. WCRE, pages 216-225. IEEE, 2003.
    • (2003) Proc. WCRE , pp. 216-225
    • Beyer, D.1    Noack, A.2    Lewerentz, C.3
  • 6
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • R.E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, 1986.
    • (1986) IEEE Transactions on Computers , vol.C-35 , Issue.8 , pp. 677-691
    • Bryant, R.E.1
  • 7
    • 3042642057 scopus 로고    scopus 로고
    • Automated compositional abstraction refinement for concurrent C programs: A two-level approach
    • S. Chaki, J. Ouaknine, K. Yorav, and E.M. Clarke. Automated compositional abstraction refinement for concurrent C programs: A two-level approach. In SoftMC 03: Software Model Checking, 2003.
    • (2003) SoftMC 03: Software Model Checking
    • Chaki, S.1    Ouaknine, J.2    Yorav, K.3    Clarke, E.M.4
  • 12
    • 35248826991 scopus 로고    scopus 로고
    • Theorem proving using lazy proof explication
    • LNCS
    • C. Flanagan, R. Joshi, X. Ou, and J.B. Saxe. Theorem proving using lazy proof explication. In CAV 03, LNCS, pages 355-367, 2003.
    • (2003) CAV 03 , pp. 355-367
    • Flanagan, C.1    Joshi, R.2    Ou, X.3    Saxe, J.B.4
  • 13
    • 0035031398 scopus 로고    scopus 로고
    • Avoiding exponential explosion: Generating compact, verification conditions
    • ACM
    • C. Flanagan and J.B. Saxe. Avoiding exponential explosion: generating compact, verification conditions. In POPL 00: Principles of Programming Languages, pages 193-205. ACM, 2000.
    • (2000) POPL 00: Principles of Programming Languages , pp. 193-205
    • Flanagan, C.1    Saxe, J.B.2
  • 15
    • 31844454546 scopus 로고    scopus 로고
    • Codesurfer 1.9
    • Grammatech. Codesurfer 1.9. Technical report, 2004.
    • (2004) Technical Report
  • 16
    • 35248845029 scopus 로고    scopus 로고
    • What went wrong: Explaining counterexamples
    • LNCS 2648, Springer
    • A. Groce and W. Visser. What went wrong: Explaining counterexamples. In SPIN 03: SPIN Workshop, LNCS 2648, pages 121-135. Springer, 2003.
    • (2003) SPIN 03: SPIN Workshop , pp. 121-135
    • Groce, A.1    Visser, W.2
  • 19
    • 0025228221 scopus 로고
    • Interprocedural slicing using dependence graphs
    • S. Horwitz, T. Reps, and D. Binkley. Interprocedural slicing using dependence graphs. ACM TOPLAS, 12:26-61, 1990.
    • (1990) ACM TOPLAS , vol.12 , pp. 26-61
    • Horwitz, S.1    Reps, T.2    Binkley, D.3
  • 21
    • 4544342550 scopus 로고    scopus 로고
    • Jedd: A BDD-based relational extension of Java
    • O. Lhotak and L.J. Hendren. Jedd: a BDD-based relational extension of Java. In PLDI 2004, pages 158-169, 2004.
    • (2004) PLDI 2004 , pp. 158-169
    • Lhotak, O.1    Hendren, L.J.2
  • 23
    • 0039488517 scopus 로고    scopus 로고
    • Parametric shape analysis via 3-valued logic
    • S. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24:217-298, 2002.
    • (2002) ACM TOPLAS , vol.24 , pp. 217-298
    • Sagiv, S.1    Reps, T.2    Wilhelm, R.3
  • 24
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • F. Tip. A survey of program slicing techniques. Journal of Programming Languages, 3:121-189, 1995.
    • (1995) Journal of Programming Languages , vol.3 , pp. 121-189
    • Tip, F.1
  • 26
    • 8344251741 scopus 로고    scopus 로고
    • Cloning-based context-sensitive pointer alias analysis using binary decision diagrams
    • ACM
    • J. Whaley and M.S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In PLDI 2004, pages 131-144. ACM, 2004.
    • (2004) PLDI 2004 , pp. 131-144
    • Whaley, J.1    Lam, M.S.2


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