Premium
Testing from a Z Specification
Author(s) -
HIERONS ROBERT M.
Publication year - 1997
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/(sici)1099-1689(199703)7:1<19::aid-stvr124>3.0.co;2-n
Subject(s) - computer science , automaton , finite state machine , partition (number theory) , model checking , formal specification , formal methods , process (computing) , model based testing , programming language , algorithm , domain (mathematical analysis) , theoretical computer science , test case , mathematics , combinatorics , mathematical analysis , regression analysis , machine learning
This paper looks at the formal analysis of Z specifications in order to enhance the testing process. An algorithm is given that rewrites the specification to a form from which both a partition of the input domain and the states of a finite state automaton model can be derived. Test cases can be derived from the former and an automated system to control the testing process can be based upon the latter. © 1997 by John Wiley & Sons, Ltd.