6533b85bfe1ef96bd12bb364

RESEARCH PRODUCT

Automatic construction of test sets: Theoretical approach

Janis BarzdinsJanis BicevskisAndrejs J. AuzinsKarlis CeransAudris Kalnins

subject

Computer Science::PerformanceComputer scienceProperty (programming)Simple (abstract algebra)Completeness (order theory)Test setComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKSComputer Science::Networking and Internet ArchitectureComputer Science::Programming LanguagesInternal variableArithmeticHardware_LOGICDESIGNTest (assessment)

description

We consider the problem of automatic construction of complete test set (CTS) from program text. The completeness criterion adopted is C1, i.e., it is necessary to execute all feasible branches of program at least once on the tests of CTS. A simple programming language is introduced with the property that the values used in conditional statements are not arithmetically deformed. For this language the CTS problem is proved to be algorithmically solvable and CTS construction algorithm is obtained. Some generalizations of this language containing counters, stacks or arrays are considered where the CTS problem remains solvable. In conclusion the applications of the obtained results to CTS construction for real time systems are considered.

yearjournalcountryeditionlanguage
2005-11-22
https://doi.org/10.1007/bfb0019362