Specification based testing
β Scribed by Rob Hierons
- Publisher
- John Wiley and Sons
- Year
- 2000
- Weight
- 161 KB
- Volume
- 1
- Category
- Article
- ISSN
- 1529-7942
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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 deri
cliloride rctnincd by tlic porosity of t,lic iiictnl, cvcii iifter rcpciitd wiishiiigs. 'l'liis piirticdiir piccc of tllic moultl Iiiitl prowtl esccptioiiiilly poroiis, iiiitl its innltcr hnil eiidcavoiirctl t o iinprovc iiinttcrs by Iiiiiiiiiic4iig it wit11 ii I~liiiit-cntl(:tl Iininiiicr. l\'licrc
A good specification of a software system is the best foundation for good testing, and automated testing really requires a formal specification. A formal specification of the operations provided by a system is typically written at an abstract level. The data types of any arguments and result values
A specification provides a concise description of a system, and can be used as both the benchmark against which any implementation is tested, and also as a means to generate tests. Formal specifications have potential advantages over informal descriptions because they offer the possibility of reduci
## SUMMARY This paper proposes a test to check the specification of models with unobserved individual effects integrated out by quadrature and also a simple way of increasing the flexibility of this type of model. The results of a Monte Carlo study and an application using a wellβknown dataset illu