The Automation of C Program Verification by the Symbolic Method of Loop Invariant Elimination

Kondratyev, Dmitry A.; Maryasov, Ilya V.; Nepomniaschy, V. A.

doi:10.3103/s0146411619070101

Cited by 8 publications

(42 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Система C-lightVer [1][2][3][4][5] разрабатывается в Институте систем информатики СО РАН для верификации C-программ. Данная система основана на методе дедуктивной верификации [6][7][8][9].…”

Section: Introductionunclassified

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

Section: Introductionunclassified

“…При этом, использования классической индукции в системе ACL2 не достаточно для доказательства УК, содержащих операцию замены для финитной итерации, в случае, если итерация изменяет элементы структуры или содержит инструкции, подобные break. В системе C-lightVer была реализована стратегия автоматизации доказательства УК программ, постусловием которых является разбор случаев [4].…”

Section: Introductionunclassified

“…Данная статья также представляет наш комплексный подход к проблеме автоматизации дедуктивной верификации в случае финитных итераций над структурами данных. Нашим решением является композиция символического метода верификации финитных итераций [4,5,12], метода метагенерации УК [2,5,13] и метода смешанной аксиоматической семантики [1]. Мы полагаем, что наш подход может быть применен к различным языкам программирования, которые позволяют записывать программы с циклами, соответствующими финитным итерациям.…”

Section: Introductionunclassified

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

Section: Introductionunclassified

See 4 more Smart Citations

Towards Automatic Deductive Verification of C Programs with Sisal Loops Using the C-lightVer System

Kondratyev

2021

Model. anal. inf. sist.

View full text Add to dashboard Cite

The C-lightVer system is developed in IIS SB RAS for C-program deductive verification. C-kernel is an intermediate verification language in this system. Cloud parallel programming system (CPPS) is also developed in IIS SB RAS. Cloud Sisal is an input language of CPPS. The main feature of CPPS is implicit parallel execution based on automatic parallelization of Cloud Sisal loops. Cloud-Sisal-kernel is an intermediate verification language in the CPPS system. Our goal is automatic parallelization of such a superset of C that allows implementing automatic verification. Our solution is such a superset of C-kernel as C-Sisal-kernel. The first result presented in this paper is an extension of C-kernel by Cloud-Sisal-kernel loops. We have obtained the C-Sisal-kernel language. The second result is an extension of C-kernel axiomatic semantics by inference rule for Cloud-Sisal-kernel loops. The paper also presents our approach to the problem of deductive verification automation in the case of finite iterations over data structures. This kind of loops is referred to as definite iterations. Our solution is a composition of symbolic method of verification of definite iterations, verification condition metageneration and mixed axiomatic semantics method. Symbolic method of verification of definite iterations allows defining inference rules for these loops without invariants. Symbolic replacement of definite iterations by recursive functions is the base of this method. Obtained verification conditions with applications of recursive functions correspond to logical base of ACL2 prover. We use ACL2 system based on computable recursive functions. Verification condition metageneration allows simplifying implementation of new inference rules in a verification system. The use of mixed axiomatic semantics results to simpler verification conditions in some cases.

show abstract

Section: Introductionunclassified

See 3 more Smart Citations

Towards Automatic Deductive Verification of C Programs with Sisal Loops Using the C-lightVer System

Kondratyev

2021

Model. anal. inf. sist.

View full text Add to dashboard Cite

show abstract

Towards Automatic Deductive Verification of C Programs over Linear Arrays

Kondratyev

Maryasov

Nepomniaschy

2019

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Invariant relations for affine loops

Ghardallou,

Mohammadi,

Linger

et al. 2024

Acta Informatica

View full text Add to dashboard Cite

Invariant relations are used to analyze while loops; while their primary application is to derive the function of a loop, they can also be used to derive loop invariants, weakest preconditions, strongest postconditions, sufficient conditions of correctness, necessary conditions of correctness, and termination conditions of loops. In this paper we present two generic invariant relations that capture the semantics of loops whose loop body applies affine transformations on numeric variables.

show abstract

The Automation of C Program Verification by the Symbolic Method of Loop Invariant Elimination

Cited by 8 publications

References 12 publications

Towards Automatic Deductive Verification of C Programs with Sisal Loops Using the C-lightVer System

Towards Automatic Deductive Verification of C Programs with Sisal Loops Using the C-lightVer System

Towards Automatic Deductive Verification of C Programs over Linear Arrays

Invariant relations for affine loops

Contact Info

Product

Resources

About