Verification of Procedural Programs via Building their Generalized Nets Models
Mathematics and Education in Mathematics, Tome 41 (2012) no. 1, pp. 259-265
Cet article a éte moissonné depuis la source Bulgarian Digital Mathematics Library
In the article an approach for verification of procedural programs via building their
corresponding generalized nets models is described. This approach integrates the
concept of “design by contract” with approaches for verification of type theorem
proofs and models consistency check. For this purpose, functions which compose the
program, are verified separately according to their specifications. A generalized net
model is built, specifying the relationships between functions in the form of correct
sequences of calls. For the main function of the program, a generalized net model is
built and it is checked whether it complies with the net model of relations between the
functions of the program. Each function of the program, which uses other functions
defined in the program, is verified also according to the specification set by the net
model of relations between the functions of the program. *ACM Classification: D.2.4 Software Engineering: Software/Program Verification – Formal meth-ods, Model checking.
Keywords:
Generalized Nets, Modeling, Verification, Formal Verification Methods, Procedural Programming
@incollection{MEM_2012_41_1_a28,
author = {Todorova, Magdalina},
title = {Verification of {Procedural} {Programs} via {Building} their {Generalized} {Nets} {Models}},
booktitle = {},
series = {Mathematics and Education in Mathematics},
pages = {259--265},
year = {2012},
volume = {41},
number = {1},
language = {en},
url = {http://geodesic.mathdoc.fr/item/MEM_2012_41_1_a28/}
}
Todorova, Magdalina. Verification of Procedural Programs via Building their Generalized Nets Models. Mathematics and Education in Mathematics, Tome 41 (2012) no. 1, pp. 259-265. http://geodesic.mathdoc.fr/item/MEM_2012_41_1_a28/