메뉴 건너뛰기




Volumn , Issue , 2007, Pages 135-144

Parallel test generation and execution with Korat

Author keywords

Bounded exhaustive testing; Korat; Parallel testing; Test data generation

Indexed keywords

BOUNDED-EXHAUSTIVE TESTING; PARALLEL TESTING; TEST DATA GENERATION; COMPLEX TESTS; INFRA STRUCTURES; INPUT SIZES; KORAT; NOVEL ALGORITHMS; NOVEL METHODOLOGIES; PARALLEL SEARCHES; PARALLEL TESTS; SPEED-UP; STRUCTURAL CONSTRAINTS; SYSTEMATIC SEARCHES; TEST INPUTS;

EID: 37849029299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1287624.1287645     Document Type: Conference Paper
Times cited : (56)

References (46)
  • 5
    • 0016993577 scopus 로고
    • A system to generate test data and symbolically execute programs
    • Sept
    • L. A. Clarke. A system to generate test data and symbolically execute programs. IEEE Transactions on Software Engineering, Sept. 1976.
    • (1976) IEEE Transactions on Software Engineering
    • Clarke, L.A.1
  • 11
    • 0032649748 scopus 로고    scopus 로고
    • State of the art in parallel search techniques for discrete optimization problems
    • A. Grama and V. Kumar. State of the art in parallel search techniques for discrete optimization problems. IEEE Trans. Knowl. Data Eng., 11(1):28-35, 1999.
    • (1999) IEEE Trans. Knowl. Data Eng , vol.11 , Issue.1 , pp. 28-35
    • Grama, A.1    Kumar, V.2
  • 13
    • 84976754472 scopus 로고
    • An approach to program testing
    • J. C. Huang. An approach to program testing. ACM Computing Surveys, 7(3), 1975.
    • (1975) ACM Computing Surveys , vol.7 , Issue.3
    • Huang, J.C.1
  • 16
    • 0024142783 scopus 로고
    • A randomized parallel backtracking algorithm
    • V. K. Janakiram, D. P. Agrawal, and R. Mehrotra. A randomized parallel backtracking algorithm. IEEE Trans. Comput., 37(12): 1665-1676, 1988.
    • (1988) IEEE Trans. Comput , vol.37 , Issue.12 , pp. 1665-1676
    • Janakiram, V.K.1    Agrawal, D.P.2    Mehrotra, R.3
  • 18
    • 0027624326 scopus 로고
    • Randomized parallel algorithms for backtrack search and branch-and-bound computation
    • R. M. Karp and Y. Zhang. Randomized parallel algorithms for backtrack search and branch-and-bound computation. J. ACM, 40(3):765-789, 1993.
    • (1993) J. ACM , vol.40 , Issue.3 , pp. 765-789
    • Karp, R.M.1    Zhang, Y.2
  • 19
  • 20
    • 4344661319 scopus 로고    scopus 로고
    • Checking Java implementation of a naming architecture using TestEra
    • S. D. Stoller and W. Visser, editors, Elsevier Science Publishers
    • S. Khurshid and D. Marinov. Checking Java implementation of a naming architecture using TestEra. In S. D. Stoller and W. Visser, editors, Electronic Notes in Theoretical Computer Science (ENTCS), volume 55. Elsevier Science Publishers, 2001.
    • (2001) Electronic Notes in Theoretical Computer Science (ENTCS) , vol.55
    • Khurshid, S.1    Marinov, D.2
  • 21
    • 4344568509 scopus 로고    scopus 로고
    • TestEra: Specification-based testing of Java programs using SAT
    • Oct
    • S. Khurshid and D. Marinov. TestEra: Specification-based testing of Java programs using SAT. Automated Software Engineering Journal, 11(4):403-434, Oct. 2004.
    • (2004) Automated Software Engineering Journal , vol.11 , Issue.4 , pp. 403-434
    • Khurshid, S.1    Marinov, D.2
  • 23
    • 0016971687 scopus 로고
    • Symbolic execution and program testing
    • J. C. King. Symbolic execution and program testing. Communications of the ACM, 19(7), 1976.
    • (1976) Communications of the ACM , vol.19 , Issue.7
    • King, J.C.1
  • 25
    • 16244369137 scopus 로고    scopus 로고
    • Load balancing parallel explicit state model checking
    • R. Kumar and E. G. Mercer. Load balancing parallel explicit state model checking. Electr. Notes Theor. Comput. Sci., 128(3):19-34, 2005.
    • (2005) Electr. Notes Theor. Comput. Sci , vol.128 , Issue.3 , pp. 19-34
    • Kumar, R.1    Mercer, E.G.2
  • 27
    • 84894631380 scopus 로고    scopus 로고
    • Addressing dynamic issues of program model checking
    • F. Lerda and W. Visser. Addressing dynamic issues of program model checking. Lecture Notes in Computer Science, 2057:80-102, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2057 , pp. 80-102
    • Lerda, F.1    Visser, W.2
  • 29
    • 26944475277 scopus 로고    scopus 로고
    • PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology
    • D. Marinov. Automatic Testing of Software with Structurally Complex Inputs. PhD thesis, Dept. of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, 2004.
    • (2004) Automatic Testing of Software with Structurally Complex Inputs
    • Marinov, D.1
  • 30
    • 37849019340 scopus 로고    scopus 로고
    • D. Marinov, A. Andoni, D. Daniliuc, S. Khurshid, and M. Rinard. An evaluation of exhaustive testing for data structures. Technical Report MIT-LCS-TR-921, MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, Sept. 2003.
    • D. Marinov, A. Andoni, D. Daniliuc, S. Khurshid, and M. Rinard. An evaluation of exhaustive testing for data structures. Technical Report MIT-LCS-TR-921, MIT Computer Science and Artificial Intelligence Lab, Cambridge, MA, Sept. 2003.
  • 31
    • 37849042271 scopus 로고    scopus 로고
    • B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 1(30):45-87, 1981. http://cs.anu.edu.au/bdm/nauty/.
    • B. D. McKay. Practical graph isomorphism. Congressus Numerantium, 1(30):45-87, 1981. http://cs.anu.edu.au/"bdm/nauty/.
  • 32
    • 4043152821 scopus 로고    scopus 로고
    • Differential testing for software
    • W. M. McKeeman. Differential testing for software. Digital Technical Journal, 10(1), 1998.
    • (1998) Digital Technical Journal , vol.10 , Issue.1
    • McKeeman, W.M.1
  • 37
    • 0013136961 scopus 로고    scopus 로고
    • The encyclopedia of integer sequences
    • N. J. A. Sloane, S. Plouffe, J. M. Borwein, and R. M. Corless. The encyclopedia of integer sequences. SIAM Review, 38(2), 1996. http://www.research.att.com/~njas/sequences/Seis.html.
    • (1996) SIAM Review , vol.38 , Issue.2
    • Sloane, N.J.A.1    Plouffe, S.2    Borwein, J.M.3    Corless, R.M.4
  • 42
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146-160, 1972.
    • (1972) SIAM Journal on Computing , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 45
    • 0019019881 scopus 로고
    • Theories of program testing and the application of revealing subdomains
    • May
    • E. J. Weyuker and T. J. Ostrand. Theories of program testing and the application of revealing subdomains. IEEE Transactions on Software Engineering, 6(3), May 1980.
    • (1980) IEEE Transactions on Software Engineering , vol.6 , Issue.3
    • Weyuker, E.J.1    Ostrand, T.J.2


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