Using X-CTL logic to implement formal verification of X-machines
Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2010), pp. 47-52
Voir la notice de l'article provenant de la source Math-Net.Ru
The article contains the review of CTL logic and its application to formal verification. X-CTL logic is proposed, allowing implementing the formal verification of X-machines. The sample model of a counter is presented.
Keywords:
Formal verification, model checking, X-Machine, complex systems.
@article{ITVS_2010_3_a5,
author = {M. S. Sobolev},
title = {Using {X-CTL} logic to implement~ formal verification of {X-machines}},
journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
pages = {47--52},
publisher = {mathdoc},
number = {3},
year = {2010},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ITVS_2010_3_a5/}
}
M. S. Sobolev. Using X-CTL logic to implement formal verification of X-machines. Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2010), pp. 47-52. http://geodesic.mathdoc.fr/item/ITVS_2010_3_a5/