Please use this identifier to cite or link to this item:
https://www.um.edu.mt/library/oar/handle/123456789/27839| Title: | A simplified model of QuickCheck automata |
| Authors: | Falzon, Kevin Pace, Gordon J. |
| Keywords: | Sequential machine theory Computer programs -- Verification Machine theory |
| Issue Date: | 2010 |
| Publisher: | University of Malta. Faculty of ICT |
| Citation: | Falzon, K., & Pace, G. J. (2010). A simplified model of QuickCheck automata. Workshop in Information and Communication Technology (WICT 2010), Msida. 1-4. |
| Abstract: | Placing guarantees on a program’s correctness is as hard as it is essential. Several approaches to verification exist, with testing being a popular, if imperfect, solution. The following is a formal description of QuickCheck finite state automata, which can be used to model a system and automatically derive command sequences over which properties can be checked. Understanding and describing such a model will aid in integrating this verification approach with other methodologies, notably runtime verification. |
| URI: | https://www.um.edu.mt/library/oar//handle/123456789/27839 |
| Appears in Collections: | Scholarly Works - FacICTCS |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| A_simplified_model_of_QuickCheck_automata_2010.pdf | 246.94 kB | Adobe PDF | View/Open |
Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.