메뉴 건너뛰기




Volumn 44, Issue 6, 2009, Pages 363-374

Snugglebug: A powerful approach to weakest preconditions

Author keywords

Interprocedural analysis; Symbolic analysis; Weakest preconditions

Indexed keywords

ALGORITHMIC TECHNIQUES; CALL GRAPH CONSTRUCTION; CALL GRAPHS; DYNAMIC BEHAVIORS; INTER-PROCEDURAL; INTERPROCEDURAL ANALYSIS; JAVA APPLICATIONS; NOVEL TECHNIQUES; OBJECT-ORIENTED PROGRAM; SYMBOLIC ANALYSIS; SYMBOLIC STATE; TEST GENERATIONS; WEAKEST PRECONDITION; WEAKEST PRECONDITIONS;

EID: 67650812037     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper
Times cited : (63)

References (33)
  • 1
    • 70349661346 scopus 로고    scopus 로고
    • Demand-driven compositional symbolic execution
    • S. Anand, P. Godefroid, and N. Tillmann. Demand-driven compositional symbolic execution. In TACAS, 2008.
    • (2008) TACAS
    • Anand, S.1    Godefroid, P.2    Tillmann, N.3
  • 2
    • 33845946966 scopus 로고
    • Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, DIKU
    • L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, University of Copenhagen, DIKU, 1994.
    • (1994) Program
    • Andersen, L.O.1
  • 3
    • 56249143748 scopus 로고    scopus 로고
    • Calysto: Scalable and precise extended static checking
    • D. Babic and A. J. Hu. Calysto: scalable and precise extended static checking. In ICSE, 2008.
    • (2008) ICSE
    • Babic, D.1    Hu, A.J.2
  • 4
    • 0036039066 scopus 로고    scopus 로고
    • The SLAM project: Debugging system software via static analysis
    • T. Ball and S. K. Rajamani. The SLAM project: debugging system software via static analysis. In POPL, 2002.
    • (2002) POPL
    • Ball, T.1    Rajamani, S.K.2
  • 5
    • 56249120557 scopus 로고    scopus 로고
    • Boogie: A modular reusable verifier for object-oriented programs
    • M. Barnett, B. E. Chang, R. Deline, B. Jacobs, and K. R. Leino. Boogie: A modular reusable verifier for object-oriented programs. In FMCO, 2005.
    • (2005) FMCO
    • Barnett, M.1    Chang, B.E.2    Deline, R.3    Jacobs, B.4    Leino, K.R.5
  • 6
    • 67650784074 scopus 로고    scopus 로고
    • C. Barrett and C. Tinelli. CVC3. In CAV, 2007.
    • C. Barrett and C. Tinelli. CVC3. In CAV, 2007.
  • 8
    • 0033688092 scopus 로고    scopus 로고
    • A static analyzer for finding dynamic programming errors
    • W. R. Bush, J. D. Pincus, and D. J. Sielaff. A static analyzer for finding dynamic programming errors. Softw. Pract. Exper., 30(7):775-802, 2000.
    • (2000) Softw. Pract. Exper , vol.30 , Issue.7 , pp. 775-802
    • Bush, W.R.1    Pincus, J.D.2    Sielaff, D.J.3
  • 9
    • 67650790221 scopus 로고    scopus 로고
    • KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs
    • C. Cadar, D. Dunbar, and D. Engler. KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, 2008.
    • (2008) OSDI
    • Cadar, C.1    Dunbar, D.2    Engler, D.3
  • 11
    • 43449101485 scopus 로고    scopus 로고
    • Dsd-crasher: A hybrid analysis tool for bug finding
    • C. Csallner, Y. Smaragdakis, and T. Xie. Dsd-crasher: A hybrid analysis tool for bug finding. ACM TOSEM, 17(2):1-37, 2008.
    • (2008) ACM TOSEM , vol.17 , Issue.2 , pp. 1-37
    • Csallner, C.1    Smaragdakis, Y.2    Xie, T.3
  • 13
    • 37849010680 scopus 로고    scopus 로고
    • J. Dolby, M. Vaziri, and F. Tip. Finding bugs efficiently with a SAT solver. In FSE, 2007.
    • J. Dolby, M. Vaziri, and F. Tip. Finding bugs efficiently with a SAT solver. In FSE, 2007.
  • 14
    • 0001179201 scopus 로고    scopus 로고
    • Houdini, an annotation assistant for ESC/Java
    • C. Flanagan and K. R. M. Leino. Houdini, an annotation assistant for ESC/Java. In FME, 2001.
    • (2001) In FME
    • Flanagan, C.1    Leino, K.R.M.2
  • 16
    • 34548273557 scopus 로고    scopus 로고
    • Compositional dynamic test generation
    • P. Godefroid. Compositional dynamic test generation. In POPL, 2007.
    • (2007) POPL
    • Godefroid, P.1
  • 17
    • 31844450371 scopus 로고    scopus 로고
    • DART: Directed automated random testing
    • P. Godefroid, N. Klarlund, and K. Sen. DART: directed automated random testing. In PLDI, 2005.
    • (2005) PLDI
    • Godefroid, P.1    Klarlund, N.2    Sen, K.3
  • 18
    • 0011792814 scopus 로고    scopus 로고
    • A framework for call graph construction algorithms
    • D. Grove and C. Chambers. A framework for call graph construction algorithms. ACM Trans. Program. Lang. Syst., 23(6):685-746, 2001.
    • (2001) ACM Trans. Program. Lang. Syst , vol.23 , Issue.6 , pp. 685-746
    • Grove, D.1    Chambers, C.2
  • 19
    • 34547150779 scopus 로고    scopus 로고
    • B. S. Gulavani, T. A. Henzinger, Y. Kannan, A. V. Nori, and S. K. Rajamani. SYNERGY: a new algorithm for property checking. In FSE, 2006.
    • B. S. Gulavani, T. A. Henzinger, Y. Kannan, A. V. Nori, and S. K. Rajamani. SYNERGY: a new algorithm for property checking. In FSE, 2006.
  • 22
    • 0034593036 scopus 로고    scopus 로고
    • Finding bugs with a constraint solver
    • D. Jackson and M. Vaziri. Finding bugs with a constraint solver. In ISSTA, 2000.
    • (2000) ISSTA
    • Jackson, D.1    Vaziri, M.2
  • 23
    • 0016971687 scopus 로고
    • Symbolic execution and program testing
    • J. C. King. Symbolic execution and program testing. Commun. ACM, 19(7):385-394, 1976.
    • (1976) Commun. ACM , vol.19 , Issue.7 , pp. 385-394
    • King, J.C.1
  • 24
    • 20344382538 scopus 로고    scopus 로고
    • R. Manevich, M. Sridharan, S. Adams, M. Das, and Z. Yang. PSE: explaining program failures via postmortem static analysis. FSE, 2004.
    • R. Manevich, M. Sridharan, S. Adams, M. Das, and Z. Yang. PSE: explaining program failures via postmortem static analysis. FSE, 2004.
  • 25
    • 0002699574 scopus 로고
    • A basis for a mathematical theory of computation
    • Technical report, MIT, Cambridge, MA, USA
    • J. McCarthy. A basis for a mathematical theory of computation. Technical report, MIT, Cambridge, MA, USA, 1962.
    • (1962)
    • McCarthy, J.1
  • 26
    • 0029180939 scopus 로고
    • Precise interprocedural dataflow analysis via graph reachability
    • T. Reps, S. Horwitz, and M. Sagiv. Precise interprocedural dataflow analysis via graph reachability. In POPL, 1995.
    • (1995) POPL
    • Reps, T.1    Horwitz, S.2    Sagiv, M.3
  • 27
    • 0036051192 scopus 로고    scopus 로고
    • Separation logic: A logic for shared mutable data structures
    • J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, 2002.
    • (2002) LICS
    • Reynolds, J.C.1
  • 28
    • 32344447459 scopus 로고    scopus 로고
    • CUTE: A concolic unit testing engine for C
    • K. Sen, D. Marinov, and G. Agha. CUTE: a concolic unit testing engine for C. In FSE, 2005.
    • (2005) In FSE
    • Sen, K.1    Marinov, D.2    Agha, G.3
  • 33
    • 34249879570 scopus 로고    scopus 로고
    • Saturn: A scalable framework for error detection using boolean satisfiability
    • Y. Xie and A. Aiken. Saturn: A scalable framework for error detection using boolean satisfiability. ACM TOPLAS, 29(3):16, 2007.
    • (2007) ACM TOPLAS , vol.29 , Issue.3 , pp. 16
    • Xie, Y.1    Aiken, A.2


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