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: | 2025 |
---|---|
Main Author: | Guba, A.A. |
Format: | Article |
Language: | English |
Published: |
Інститут програмних систем НАН України
2025
|
Subjects: | |
Online Access: | https://pp.isofts.kiev.ua/index.php/ojs1/article/view/701 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Journal Title: | Problems in programming |
Institution
Problems in programmingSimilar Items
-
Traversal of arbitrary sequences of UCM symbolic transitions for test generation
by: Guba, A.A.
Published: (2014) -
Static method of consistency and completeness checking in formal model of distributed software systems
by: Kolchin, A.V., et al.
Published: (2025) -
Traversal of arbitrary sequences of UCM symbolic transitions for test generation
by: A. A. Guba
Published: (2014) -
Regression testing: techniques and future research directions
by: Moroz, H.B., et al.
Published: (2025) -
DS-theory. Research of R-data division factors in order to generate applied algorithms. Part 1
by: Kolesnyk, V.G.
Published: (2017)