Modelirovanie i Analiz Informatsionnykh Sistem
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Model. Anal. Inform. Sist.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Modelirovanie i Analiz Informatsionnykh Sistem, 2021, Volume 28, Number 4, Pages 372–393
DOI: https://doi.org/10.18255/1818-1015-2021-4-372-393
(Mi mais758)
 

Theory of computing

Towards automatic deductive verification of C programs with sisal loops using the C-lightVer system

D. A. Kondratyev

A.P. Ershov Institute of Informatics Systems, Siberian Branch of the Russian Academy of Sciences, 6, Acad. Lavrentjev pr., Novosibirsk 630090, Russia
References:
Abstract: 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.
Keywords: deductive verification, C-lightVer, cloud parallel programming system, symbolic method of verification of definite iterations, loop invariant, ACL2.
Funding agency Grant number
Russian Science Foundation 18-11-00118
RSF, project No 18-11-00118.
Received: 15.11.2021
Revised: 01.12.2021
Accepted: 08.12.2021
Document Type: Article
UDC: 004.052.42
MSC: 68Q60
Language: Russian
Citation: D. A. Kondratyev, “Towards automatic deductive verification of C programs with sisal loops using the C-lightVer system”, Model. Anal. Inform. Sist., 28:4 (2021), 372–393
Citation in format AMSBIB
\Bibitem{Kon21}
\by D.~A.~Kondratyev
\paper Towards automatic deductive verification of C programs with sisal loops using the C-lightVer system
\jour Model. Anal. Inform. Sist.
\yr 2021
\vol 28
\issue 4
\pages 372--393
\mathnet{http://mi.mathnet.ru/mais758}
\crossref{https://doi.org/10.18255/1818-1015-2021-4-372-393}
Linking options:
  • https://www.mathnet.ru/eng/mais758
  • https://www.mathnet.ru/eng/mais/v28/i4/p372
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Моделирование и анализ информационных систем
    Statistics & downloads:
    Abstract page:85
    Full-text PDF :29
    References:25
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024