Skip to main content
Log in

Program Verification: State of the Art, Problems, and Results. II1

  • Published:
Cybernetics and Systems Analysis Aims and scope

Abstract

An analytical survey of modern verification methods for sequential, functional, reactive, and distributed systems is presented. The emphasis is on methods based on properties of abstract interpretations, transition systems, and Petri nets.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. L. Kryvyi and O. M. Maksymets, “Program verification: State of the art, problems, and results. I,” Cybernetics and Systems Analysis, 49, No. 6, 805–814 (2013).

    Article  Google Scholar 

  2. O. M. Maksymets, “Searching for program invariants in the form of polynomials,” in: Proc. National Academy of Sciences of Ukraine, Vol. 9, (2013), pp. 44–50.

  3. S. L. Kryvyi and O. M. Maksymets, “Program invariant generation over polynomial ring using iterative methods,” Intern. J. “Information Theories & Applications,” 20, No. 2, 113–121 (2013).

    Google Scholar 

  4. J. Esparza and K. Heljanko, Unfoldings: A Partial-Order Approach to Model Checking, Springer, Berlin (2008).

    Google Scholar 

  5. M. H. T. Hack, Decidability Questions for Petri Nets, Ph.D. Thesis, M.I.T. (1976).

  6. V. Ye. Kotov, Petri Nets [in Russian], Nauka, Moscow (1984).

    Google Scholar 

  7. T. Murata, “Petri nets: Properties, analysis and applications,” Proc. IEEE, 77, No. 4, 541–580 (1989).

    Article  Google Scholar 

  8. Yu. G. Karpov, Verification of Parallel and Distributed Software Systems [in Russian], BHV-Petersburg, St. Petersburg (2010).

    Google Scholar 

  9. E. M. Clarke Jr., O. Grumberg, and D. A. Peled, Model Checking, MIT Press (1999).

  10. B. A. Trakhtenbrot and Ya. M. Barzdin, Finite Automata: Behavior and Synthesis [in Russian], Nauka, Moscow (1970).

    Google Scholar 

  11. W. Thomas, “Automata on infinite objects,” in: Handbook on Theoretical Comput. Sci., Vol. B, Elsevier (1990), pp. 135–191.

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to S. L. Kryvyi.

Additional information

1The first part of this paper was published in No. 6, 2013.

Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 11–20, January–February 2014.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kryvyi, S.L., Maksymets, O.M. Program Verification: State of the Art, Problems, and Results. II1 . Cybern Syst Anal 50, 8–16 (2014). https://doi.org/10.1007/s10559-014-9588-6

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10559-014-9588-6

Keywords

Navigation