C program verification in SPECTRUM multilanguage system

Nepomniaschy, V. A.; Anureev, Igor S.; Atuchin, M. M.; Maryasov, Ilya V.; Петров, А А; Promsky, Alexey

doi:10.3103/s014641161107011x

Cited by 7 publications

(4 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…В [15] была описана схема расширяемой мультиязыковой системы анализа и ве-рификации СПЕКТР. В настоящей работе мы представляем систему, в которой ре-ализованы наши методы в контексте верификации C программ.…”

Section: Introductionunclassified

Automatic C Program Verification Based on Mixed Axiomatic Semantics

Марьясов¹,

Непомнящий²,

Промский³

et al. 2015

Model. anal. inf. sist.

Self Cite

View full text Add to dashboard Cite

Section: Introductionunclassified

Automatic C Program Verification Based on Mixed Axiomatic Semantics

Марьясов¹,

Непомнящий²,

Промский³

et al. 2015

Model. anal. inf. sist.

Self Cite

View full text Add to dashboard Cite

“…In [15], an extensible multilanguage system of analysis and verification SPECTRUM was described. In this paper, we present a system in which our methods are implemented in the context of verification of C programs.…”

Section: Introductionmentioning

confidence: 99%

Automatic C program verification based on mixed axiomatic semantics

Maryasov

Nepomnyaschy

Promsky

et al. 2014

Aut. Control Comp. Sci.

Self Cite

View full text Add to dashboard Cite

“…There exist several systems that aid the proof process, for example, Boogie [4] and Spectrum [5] for programs in the C language, and LOOP [6] and KeY [7] for programs written in an object-oriented language. Boogie generates verification conditions for the theorem prover Simplify [8], and LOOP uses the interactive theorem prover PVS [9], for which it generates proof obligations that look like Hoare triples.…”

Section: Introductionmentioning

confidence: 99%

Automation of Formal Veriﬁcation of Programs in the Pifagor Language

Ushakova¹,

Legalov²

2015

Model. anal. inf. sist.

View full text Add to dashboard Cite

Nowadays, due to software sophistication, programs correctness is more often proved by means of formal verification. The method of deduction based on Hoare logic could be used for any programming language and it has the capability of partial automation of the proof process. However, the method of deduction is not widely used for verification of parallel programs because of high complexity of the process. The usage of the functional data-flow paradigm of parallel programming allows to decrease the complexity of the proof process. In this article a proof process of correctness of functional data-flow parallel programs in the Pifagor language is considered. The proof process of a program correctness is considered as a tree where each node is a program data-flow graph, whose edges are marked with formulas in a specification language. The tree root is the initial program data-flow graph with a precondition and a postcondition, which describe restrictions on input variables and correctness conditions of the result of the program execution, respectively. Basic transformations of the data-flow graph are edge marking, equivalent transformation, splitting, folding of the program. By means of these transformations the data-flow graph is transformed and finally is reduced to a set of formulas in the specification language. If all these formulas are identically true, the program is correct. Several modules is distinguished in the system: "Program correctness prover", "Axioms and theorems library management system" and "Errors analysis and output of information about errors". According to this architecture, the toolkit for supporting formal verification was developed. The main functionality of the system implementation is considered.

show abstract

C program verification in SPECTRUM multilanguage system

Cited by 7 publications

References 4 publications

Automatic C Program Verification Based on Mixed Axiomatic Semantics

Automatic C Program Verification Based on Mixed Axiomatic Semantics

Automatic C program verification based on mixed axiomatic semantics

Automation of Formal Veriﬁcation of Programs in the Pifagor Language

Contact Info

Product

Resources

About