View in EDS HTML Full Text PDF Full Text

Generating effective test cases based on satisfiability modulo theory solvers for service-oriented workflow applications.

Saved in:
Bibliographic Details
Title: Generating effective test cases based on satisfiability modulo theory solvers for service-oriented workflow applications.
Authors: Wang, Hongda1, Xing, Jianchun1, Yang, Qiliang1,2, Song, Wei2,3, Zhang, Xuewei1
Source: Software Testing: Verification & Reliability. Mar2016, Vol. 26 Issue 2, p149-169. 21p.
Subjects: Web services, BPEL (Computer program language), Service-oriented architecture (Computer science), Semantics, Programming languages
Abstract: Web Service Business Process Execution Language (WS-BPEL) is one of the most popular service-oriented workflow applications. The unique features (e.g. dead path elimination semantics and correlation mechanism) of WS-BPEL applications have raised enormous problems to its test case generation, especially in unit testing. Existing studies mainly assume that each path in the control flow graphs that correspond to WS-BPEL applications is feasible, which always yields imprecise test cases or complicates testing results. The current study tackles this problem based on satisfiability modulo theory solvers. First, a new coverage criterion is proposed to measure the quality of test sets for testing WS-BPEL applications. Second, decomposition algorithms are presented to obtain test paths that meet the proposed coverage criterion. Finally, this paper symbolically encodes each test path with several constraints by capturing the unique features of WS-BPEL. These constraints are solved and the test cases (test paths and test data) are obtained with the help of satisfiability modulo theory solvers to test WS-BPEL applications effectively. Experiments are conducted using our approach and other typical approaches (e.g. message-sequence generation-based approach and concurrent path analysis approach) with 10 WS-BPEL applications. Experimental results demonstrate that the test cases generated by our approach can avoid instantiating idle instance and expose more faults. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 113138175
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Generating effective test cases based on satisfiability modulo theory solvers for service-oriented workflow applications.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Wang%2C+Hongda%22">Wang, Hongda</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Xing%2C+Jianchun%22">Xing, Jianchun</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Yang%2C+Qiliang%22">Yang, Qiliang</searchLink><relatesTo>1,2</relatesTo><br /><searchLink fieldCode="AR" term="%22Song%2C+Wei%22">Song, Wei</searchLink><relatesTo>2,3</relatesTo><br /><searchLink fieldCode="AR" term="%22Zhang%2C+Xuewei%22">Zhang, Xuewei</searchLink><relatesTo>1</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Software+Testing%3A+Verification+%26+Reliability%22">Software Testing: Verification & Reliability</searchLink>. Mar2016, Vol. 26 Issue 2, p149-169. 21p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Web+services%22">Web services</searchLink><br /><searchLink fieldCode="DE" term="%22BPEL+%28Computer+program+language%29%22">BPEL (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Service-oriented+architecture+%28Computer+science%29%22">Service-oriented architecture (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Semantics%22">Semantics</searchLink><br /><searchLink fieldCode="DE" term="%22Programming+languages%22">Programming languages</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Web Service Business Process Execution Language (WS-BPEL) is one of the most popular service-oriented workflow applications. The unique features (e.g. dead path elimination semantics and correlation mechanism) of WS-BPEL applications have raised enormous problems to its test case generation, especially in unit testing. Existing studies mainly assume that each path in the control flow graphs that correspond to WS-BPEL applications is feasible, which always yields imprecise test cases or complicates testing results. The current study tackles this problem based on satisfiability modulo theory solvers. First, a new coverage criterion is proposed to measure the quality of test sets for testing WS-BPEL applications. Second, decomposition algorithms are presented to obtain test paths that meet the proposed coverage criterion. Finally, this paper symbolically encodes each test path with several constraints by capturing the unique features of WS-BPEL. These constraints are solved and the test cases (test paths and test data) are obtained with the help of satisfiability modulo theory solvers to test WS-BPEL applications effectively. Experiments are conducted using our approach and other typical approaches (e.g. message-sequence generation-based approach and concurrent path analysis approach) with 10 WS-BPEL applications. Experimental results demonstrate that the test cases generated by our approach can avoid instantiating idle instance and expose more faults. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Software Testing: Verification & Reliability is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=113138175
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1002/stvr.1592
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 21
        StartPage: 149
    Subjects:
      – SubjectFull: Web services
        Type: general
      – SubjectFull: BPEL (Computer program language)
        Type: general
      – SubjectFull: Service-oriented architecture (Computer science)
        Type: general
      – SubjectFull: Semantics
        Type: general
      – SubjectFull: Programming languages
        Type: general
    Titles:
      – TitleFull: Generating effective test cases based on satisfiability modulo theory solvers for service-oriented workflow applications.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Wang, Hongda
      – PersonEntity:
          Name:
            NameFull: Xing, Jianchun
      – PersonEntity:
          Name:
            NameFull: Yang, Qiliang
      – PersonEntity:
          Name:
            NameFull: Song, Wei
      – PersonEntity:
          Name:
            NameFull: Zhang, Xuewei
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar2016
              Type: published
              Y: 2016
          Identifiers:
            – Type: issn-print
              Value: 09600833
          Numbering:
            – Type: volume
              Value: 26
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Software Testing: Verification & Reliability
              Type: main
ResultId 1