메뉴 건너뛰기




Volumn 5850 LNCS, Issue , 2009, Pages 757-772

An incremental approach to scope-bounded checking using a lightweight formal method

Author keywords

Alloy; Computation graph; First order logic; Lightweight formal method; SAT; Scope bounded checking; White box testing

Indexed keywords

CODE SEGMENTS; CONSTRAINT SOLVERS; EXECUTION PATHS; FIRST ORDER LOGIC; HEAVY WORKLOADS; INCREMENTAL APPROACH; INCREMENTAL CHECKING; KEY ISSUES; LIGHTWEIGHT FORMAL METHOD; LIGHTWEIGHT FORMAL METHODS; NON-TRIVIAL PROGRAMS; RELATIONAL CONSTRAINT; SPEED-UPS; SUB-PROBLEMS; WHITE-BOX TESTING;

EID: 70649097225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-05089-3_48     Document Type: Conference Paper
Times cited : (10)

References (31)
  • 3
    • 0033697422 scopus 로고    scopus 로고
    • Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., Pasareanu, C.S., Robby, Zheng, H.: Bandera: extracting finite-state models from Java source code. In: Proc. of International Conference on Software Engineering, ICSE (2000)
    • Corbett, J.C., Dwyer, M.B., Hatcliff, J., Laubach, S., Pasareanu, C.S., Robby, Zheng, H.: Bandera: extracting finite-state models from Java source code. In: Proc. of International Conference on Software Engineering, ICSE (2000)
  • 7
    • 30344450270 scopus 로고    scopus 로고
    • Eén, N., Sörensson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, 2919, pp. 502-518. Springer, Heidelberg (2004)
    • Eén, N., Sörensson, N.: An extensible SAT solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
  • 13
    • 0034449066 scopus 로고    scopus 로고
    • Jackson, D, Automating first-order relational logic. In: Proc. of the International Symposium on Foundations of Software Engineering, FSE
    • Jackson, D.: Automating first-order relational logic. In: Proc. of the International Symposium on Foundations of Software Engineering, FSE (2000)
    • (2000)
  • 16
    • 4344568509 scopus 로고    scopus 로고
    • TestEra: Specification-based Testing of Java Programs Using SAT
    • October
    • Khurshid, S., Marinov, D.: TestEra: Specification-based Testing of Java Programs Using SAT. Automated Software Engineering Journal 11(4) (October 2004)
    • (2004) Automated Software Engineering Journal , vol.11 , Issue.4
    • Khurshid, S.1    Marinov, D.2
  • 17
    • 35248872018 scopus 로고    scopus 로고
    • Generalized Symbolic Execution for Model Checking and Testing
    • Garavel, H, Hatcliff, J, eds, TACAS 2003, Springer, Heidelberg
    • Khurshid, S., Pasareanu, C., Visser, W.: Generalized Symbolic Execution for Model Checking and Testing. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 553-568. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2619 , pp. 553-568
    • Khurshid, S.1    Pasareanu, C.2    Visser, W.3
  • 18
    • 0016971687 scopus 로고
    • Symbolic execution and program testing
    • July
    • King, J.C.: Symbolic execution and program testing. Communications of the ACM 19(7) (July 1976)
    • (1976) Communications of the ACM , vol.19 , Issue.7
    • King, J.C.1
  • 19
    • 84954454453 scopus 로고    scopus 로고
    • Klarlund, N., Møller, A., Schwartzbach, M.I.: MONA implementation secrets. In: Yu, S., Pǎun, A. (eds.) CIAA 2000. LNCS, 2088, p. 182. Springer, Heidelberg (2001)
    • Klarlund, N., Møller, A., Schwartzbach, M.I.: MONA implementation secrets. In: Yu, S., Pǎun, A. (eds.) CIAA 2000. LNCS, vol. 2088, p. 182. Springer, Heidelberg (2001)
  • 20
    • 33947317189 scopus 로고    scopus 로고
    • Ph.D. thesis, EECS Department, Massachusetts Institute of Technology
    • Kuncak, V.: Modular Data Structure Verification. Ph.D. thesis, EECS Department, Massachusetts Institute of Technology (2007)
    • (2007) Modular Data Structure Verification
    • Kuncak, V.1
  • 21
    • 45749085681 scopus 로고    scopus 로고
    • Z3: An Efficient SMT Solver
    • Ramakrishnan, C.R, Rehof, J, eds, TACAS 2008, Springer, Heidelberg
    • Leonardo, M., Bjørner, N.: Z3: An Efficient SMT Solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
    • (2008) LNCS , vol.4963 , pp. 337-340
    • Leonardo, M.1    Bjørner, N.2
  • 26
    • 32344447459 scopus 로고    scopus 로고
    • Sen, K., Marinov, D., Agha, G.: CUTE: A concolic unit testing engine for C. In: Proc. of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering, ESEC/FSE (2005)
    • Sen, K., Marinov, D., Agha, G.: CUTE: A concolic unit testing engine for C. In: Proc. of the 10th European software engineering conference held jointly with 13th ACM SIGSOFT international symposium on Foundations of software engineering, ESEC/FSE (2005)
  • 27
    • 0000990322 scopus 로고
    • A survey of program slicing techniques
    • Tip, F.: A survey of program slicing techniques. Journal of Programming Languages 3(3), 121-189 (1995)
    • (1995) Journal of Programming Languages , vol.3 , Issue.3 , pp. 121-189
    • Tip, F.1
  • 28
    • 37149013755 scopus 로고    scopus 로고
    • Torlak, E., Jackson, D.: Kodkod: A Relational Model Finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, 4424, pp. 632-647. Springer, Heidelberg (2007)
    • Torlak, E., Jackson, D.: Kodkod: A Relational Model Finder. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 632-647. Springer, Heidelberg (2007)
  • 29
    • 35248837869 scopus 로고    scopus 로고
    • Checking properties of heap-manipulating procedures with a constraint solver
    • Garavel, H, Hatcliff, J, eds, TACAS 2003, Springer, Heidelberg
    • Vaziri, M., Jackson, D.: Checking properties of heap-manipulating procedures with a constraint solver. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 505-520. Springer, Heidelberg (2003)
    • (2003) LNCS , vol.2619 , pp. 505-520
    • Vaziri, M.1    Jackson, D.2


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