Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Valery A. Nepomniaschy"'
Publikováno v:
Моделирование и анализ информационных систем, Vol 24, Iss 6, Pp 743-745 (2017)
This work represents the further development of the method for definite iteration verification [7]. It extends the mixed axiomatic semantics method [1] suggested for C-light program verification. This extension includes a verification method for defi
Externí odkaz:
https://doaj.org/article/a48d7bbe11a9420286ab689791f3df2e
Autor:
Sergei Nikolaevich Artemov, Jānis Martynovich Barzdiņs, Leonid Arkad'evich Bokut', Yuri Gurevich, Alexander Mikhailovich Dekhtyar', Leonid Anatol`evich Levin, Irina Aleksandrovna Lomazova, Yuri Vladimirovich Matiyasevich, Valery Alexandrovich Nepomniaschy, Sergei Petrovich Novikov, A Rabinovich, Vladimir Yur'evich Sazonov, Anatol Oles'evich Slisenko, Valery Anatolievich Sokolov, Mark Borisovich Trakhtenbrot, Nikolai Vyacheslavovich Shilov
Publikováno v:
Uspekhi Matematicheskikh Nauk. 77:191-195
Publikováno v:
Vestnik Tomskogo gosudarstvennogo universiteta. Upravlenie, vychislitel'naya tekhnika i informatika. :118-126
Publikováno v:
Automatic Control and Computer Sciences. 53:653-662
In the deductive verification of programs written in the imperative programming languages, the generation and proving of the verification conditions corresponding to loops are of particular complexity, as each of them must be provided with an invaria
Publikováno v:
Modelirovanie i Analiz Informacionnyh Sistem, Vol 23, Iss 6, Pp 688-702 (2016)
This article presents a method for the analysis and verification of Use Case Maps (UCM) models with scenario control structures — protected components and failure handling constructs. UCM models are analyzed and verified with the help of coloured
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030374860
Ershov Informatics Conference
Ershov Informatics Conference
The generation and proving of verification conditions, which correspond to loops, may cause difficulties during deductive verification because the construction of required invariants is a challenge, especially for nested loops. The methods of invaria
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0ce96641065098a859926a3860c158c
https://doi.org/10.1007/978-3-030-37487-7_20
https://doi.org/10.1007/978-3-030-37487-7_20
Publikováno v:
Modelirovanie i Analiz Informacionnyh Sistem, Vol 24, Iss 6, Pp 743-745 (2017)
This work represents the further development of the method for definite iteration verification [7]. It extends the mixed axiomatic semantics method [1] suggested for C-light program verification. This extension includes a verification method for defi
Publikováno v:
Automatic Control and Computer Sciences. 49:484-492
The standard language of message sequence charts (MSCs) is designed to describe scenarios of object interaction. Due to their expressiveness and simplicity, MSC diagrams are widely used in practice at all stages of system design and development. In p
Publikováno v:
Cybernetics and Systems Analysis. 51:213-222
This article presents a new method for the analysis and verification of Use Case Map (UCM) specifications with the help of colored Petri nets and the SPIN model checker. Standardized UCM notation is a convenient visual language that allows one to for
Publikováno v:
Programming and Computer Software. 41:41-48
A distributed systems specification language Dynamic-REAL (dREAL) which extends the language Basic-REAL developed previously by dynamic constructs for generating and removing process instances is presented. A tool-set SRDSV2 (SDL/REAL Distributed Sys