• DocumentCode
    2994370
  • Title

    Automated test sequence generation using sequencing constraints for concurrent programs

  • Author

    Karaçali, Bengi ; Tai, Kuo-Chung

  • Author_Institution
    North Carolina State Univ., Raleigh, NC, USA
  • fYear
    1999
  • fDate
    1999
  • Firstpage
    97
  • Lastpage
    108
  • Abstract
    Sequencing constraints for a concurrent program specify restrictions on the allowed sequences of synchronization events, and they can be used in generating test sequences for the program. In earlier work, the notion of CSPE (constraints on succeeding and preceding events) constraint was defined, and the CSPE-1 coverage criterion, which requires the coverage of each CSPE constraint at least once, was shown to be effective for fault detection. We show how to automatically generate test sequences to satisfy, the CSPE-1 criterion for a set of CSPE constraints. Our test sequence generation strategy is to determine (a) the number of instances for each process type for accomplishing the CSPE-1 coverage criterion such that the total instance number is minimum and (b) the smallest sequence set among all sets satisfying (a). Empirical results of applying our test generation strategy to the bounded buffer problem and seven versions of the readers and writers problem are presented
  • Keywords
    concurrency theory; program testing; synchronisation; CSPE-1 coverage criterion; automated test sequence generation; bounded buffer problem; concurrent programs; readers and writers problem; sequencing constraints; synchronization events; Synchronization;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Software Engineering for Parallel and Distributed Systems, 1999. Proceedings. International Symposium on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    0-7695-0191-5
  • Type

    conf

  • DOI
    10.1109/PDSE.1999.779742
  • Filename
    779742