Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Robert M. Hierons (1997) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: