Premium
Specification based test sequence generation with propositional logic
Author(s) -
Wimmel G.,
Lötzbeyer H.,
Pretschner A.,
Slotosch O.
Publication year - 2000
Publication title -
software testing, verification and reliability
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.216
H-Index - 49
eISSN - 1099-1689
pISSN - 0960-0833
DOI - 10.1002/1099-1689(200012)10:4<229::aid-stvr213>3.0.co;2-o
Subject(s) - computer science , correctness , programming language , sequence (biology) , white box testing , solver , process (computing) , propositional calculus , algorithm , theoretical computer science , software , software system , software construction , genetics , biology
Abstract In the domain of concurrent reactive systems, much work has been devoted to (semi‐)automatically validating a system's correctness. In this paper a novel approach to the automated generation of test sequences is presented. It may be used for both glass box testing a specification and black box testing an implementation (software/hardware). Finite system models specified within the CASE tool AutoFocus as well as user‐friendly test case specifications are automatically translated into propositional logic and fed into the propositional solver SATO. Results are interpreted as input/output traces (test sequences) of the system, and may be displayed as message sequence charts. A small example illustrates the basic ideas as well as the method's advantages and shortcomings. The testing process is integrated into an overall development process. Main contributions include the implementation of a tool for graphical specification of test cases and the description of an efficient method to compute test sequences fully automatically as well as its integration into the same CASE tool. Copyright © 2000 John Wiley & Sons, Ltd.