C-programs verification based on mixed axiomatic semantics

Anureev, Igor S.; Maryasov, Ilya V.; Nepomniaschy, V. A.

doi:10.3103/s0146411611070029

Cited by 12 publications

(21 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Генератор условий корректности основан на смешанной аксиоматической семантике языка C-kernel [4]. Он реализован на C++.…”

Section: генерация условий корректностиunclassified

“…C-light является выразительным подмножеством языка C. Для верификации Clight программ ранее был предложен двухуровневый подход [3] и метод смешанной аксиоматической семантики [4].…”

Section: Introductionunclassified

“…Были доказаны теоремы о корректности трансляции из C-light в Ckernel и о корректности смешанной аксиоматической семантики C-kernel [4]. Другим преимуществом метода является полная операционная и аксиоматическая формали-зация языка C-light.…”

Section: Introductionunclassified

“…С другой стороны, это приводит к громоздким условиям корректности. Для преодоления этой проблемы используется метод сме-шанной аксиоматической семантики [4], который является комбинацией двухуров-невого метода верификации C-программ и смешанной аксиоматической семантики языка C-kernel. Слово смешанная означает, что имеются несколько правил выво-да для одной и той же программной конструкции, которые однозначно применяются в зависимости от контекста.…”

Section: Introductionunclassified

See 3 more Smart Citations

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: генерация условий корректностиunclassified

Section: Introductionunclassified

See 2 more Smart Citations

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 this paper we consider the C-light language [18] which is a powerful subset of the ISO C language. To verify C-light programs the two-level approach [19,20] and the mixed axiomatic semantics method [1,3,11] were suggested. At the first stage, we translate [17] the source C-light program into Ckernel one.…”

mentioning

confidence: 99%

Loop Invariants Elimination for Definite Iterations over Unchangeable Data Structures in C Programs

Марьясов¹,

Непомнящий²

2016

Model. anal. inf. sist.

Self Cite

View full text Add to dashboard Cite

The C-program verification is an urgent problem of modern programming. To apply known methods of deductive verification it is necessary to provide loop invariants which might be a challenge in many cases. In this paper we consider the C-light language [18] which is a powerful subset of the ISO C language. To verify C-light programs the two-level approach [19,20] and the mixed axiomatic semantics method [1,3,11] were suggested. At the first stage, we translate [17] the source C-light program into Ckernel one. The C-kernel language [19] is a subset of C-light. The theorem of translation correctness was proved in [10,11]. The C-kernel has less statements with respect to the C-light, this allows to decrease the number of inference rules of axiomatic semantics during its development. At the second stage of this approach, the verification conditions are generated by applying the rules of mixed axiomatic semantics [10, 11] which could contain several rules for the same program statement. In such cases the inference rules are applied depending on the context. Let us note that application of the mixed axiomatic semantics allows to significantly simplify verification conditions in many cases. This article represents an extension of this approach which includes our verification method for definite iteration over unchangeable data structures without loop exit in C-light programs. The method contains a new inference rule for the deifinite iteration without invariants. This rule was implemented in verification conditions generator. At the proof stage the SMT-solver Z3 [12] is used. An example which illustrates the application of this technique is considered.The article is published in the authors' wording.

show abstract