Skip to main content
Log in

Developing a self-applicable verification system. Theory and practice

  • Published:
Automatic Control and Computer Sciences Aims and scope Submit manuscript

Abstract

Compared with traditional testing, the deductive verification represents a more formal way to establish the program correctness. However, can we be sure that the verification system itself is correct? The theoretical foundations of Hoare logic were examined in classical works, and some soundness/completeness theorems are well known. Nevertheless, we practically are not aware of implementations of those theoretical methods subjected to anything more than testing. In other words, our ultimate goal is a verification system that can be self-applicable (at least partially). In our recent studies, we applied the MetaVCG approach in order to make such a task more feasible.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Apt, K.R. and Olderog, E.R., Verification of Sequential and Concurrent Programs, Berlin etc.: Springer, 1991.

    Google Scholar 

  2. Cohen, E., Dahlweid, M., Hillebrand, M.A., Leinenbach, D., Moskal, M., Santen, T., Schulte, W., and Tobies, S., VCC: A practical system for verifying concurrent C, Proc. TPHOLs 2009, LNCS, 2009, vol. 5674, p. 23–42.

    MathSciNet  Google Scholar 

  3. Filliatre, J.C. and Marche, C., Multi-prover verification of C programs, Proc. ICFEM 2004, LNCS, 2004, vol. 3308, p. 15–29.

    Google Scholar 

  4. Maryasov, I.V., Nepomnyaschy, V.A., Promsky, A.V., and Kondratyev, D.A., Automatic C program verification based on mixed axiomatic semantics, Proc. Fourth Workshop “Program Semantics, Specification and Verification: Theory and Applications,” Yekaterinburg, 2013, p. 50–59.

    Google Scholar 

  5. Moriconi, M. and Schwartz, R.L., Automatic construction of verification condition generators from Hoare logics, Lect. Notes Comput. Sci., 1981, vol. 115, p. 363–377.

    Article  MathSciNet  Google Scholar 

  6. Nepomnyaschy, V.A., Anureev, I.S., Mikhaylov, I.N., and Promsky A.V., Verification oriented language C-light, Sistemnaya informatika: Sb. nauch. tr. (Sist. Inf., Collection of Scientific Papers), Novosibirsk: SO RAN, 2004, no. 9, p. 51–134.

    Google Scholar 

  7. Norrish, M., C formalised in HOL, PhD (Comput. Sci.) Thesis, Cambridge, 1998.

    Google Scholar 

  8. von Oheimb, D., Hoare logic for Java in Isabelle/HOL, Concurrency Comput.: Pract. Exper., 2001, vol. 13, no. 13, p. 1173–1214.

    Article  MATH  Google Scholar 

  9. Promsky, A.V., C program verification: Verification condition explanation and standard library, Autom. Control Comput. Sci., 2012, vol. 46, no. 7, p. 394–401.

    Article  Google Scholar 

  10. Promsky, A.V., Experiments on self-applicability in the C-light verification system, Bull. Nov. Comp. Center, Comp. Sci., 2013, no. 35, p. 85–99.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. A. Kondratyev.

Additional information

Original Russian Text © D.A. Kondratyev, A.V. Promsky, 2014, published in Modelirovanie i Analiz Informatsionnykh Sistem, 2014, No. 6, pp. 71–82.

The article was translated by the authors.

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kondratyev, D.A., Promsky, A.V. Developing a self-applicable verification system. Theory and practice. Aut. Control Comp. Sci. 49, 445–452 (2015). https://doi.org/10.3103/S0146411615070123

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0146411615070123

Keywords

Navigation