Traversal of arbitrary sequences of UCM symbolic transitions for test generation
The paper proposes a method of traversal of high-level multi-threaded models formalized in UCM language. The pros and cons of this approach comparing to the existing ones are considered. The method that allows state space exploring of UCM models using symbolic solving and proving is presented. The g...
Saved in:
| Date: | 2014 |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Інститут програмних систем НАН України
2014
|
| Series: | Проблеми програмування |
| Subjects: | |
| Online Access: | http://dspace.nbuv.gov.ua/handle/123456789/113221 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Digital Library of Periodicals of National Academy of Sciences of Ukraine |
| Cite this: | Traversal of arbitrary sequences of UCM symbolic transitions for test generation / A.A. Guba // Проблеми програмування. — 2014. — № 2-3. — С. 107-111. — Бібліогр.: 17 назв. — англ. |
Institution
Digital Library of Periodicals of National Academy of Sciences of Ukraine| Summary: | The paper proposes a method of traversal of high-level multi-threaded models formalized in UCM language. The pros and cons of this approach comparing to the existing ones are considered. The method that allows state space exploring of UCM models using symbolic solving and proving is presented. The generation of symbolic traces used for software system testing is described. |
|---|