Skip to main content

Abstract

In this article, we describe the theory of nominative data, formulate the basic principles of the composition-nominative approach, define the class of nominative data and functions, and describe a calculus for the Theory of Nominative Data. By using nominative data, we can increase the adequacy level of representation of data structures, functions, and compositions that are used in programming languages. Thus, in terms of composition-nominative approach, we can build program verification system based on a unified conceptual basis. Computer-aided verification of computer programs often uses SMT (satisfiability modulo theories) solvers. A common technique is to translate preconditions, postconditions, and assertions into SMT formulas in order to determine whether required properties can hold. The SMT-LIB Standard was created for forming a common standard and library for solving SMT problems. Now, it is one of the most used libraries for SMT systems. Formulas in SMT-LIB format are accepted by the great majority of current SMT solvers. The theory of nominative data is of interest for software modelling and verification, but currently lacks support in the SMT-LIB format. In the article, we propose the declaration for the theory of nominative data for the SMT-LIB Standard 2.6.

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

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Nikitchenko, N.: A composition nominative approach to program semantics. Technical report IT–TR, Technical University of Denmark, Lyngby (1998)

    Google Scholar 

  2. Omelchuk, L.: Aksiomatychni systemy specyfikacij program nad nominatyvnymy danymy [Axiomatic Systems of Specifications of Programs over Nominative Data]. Candidate’s thesis, Kyiv [in Ukrainian] (2007)

    Google Scholar 

  3. Nikitchenko, N., Omelchuk, L., Shkilniak S.: Formalisms for Specification of Programs over Nominative Data. Electronic computers and informatics (ECI 2006). Košice, Herl’any, Slovakia, pp. 134–139 (2006)

    Google Scholar 

  4. Kryvolap, A., Nikitchenko, M., Schreiner, W.: Extending Floyd-Hoare logic for partial pre- and postconditions. In: Ermolayev, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds.) ICTERI 2013. CCIS, vol. 412, pp. 355–378. Springer, Cham (2013). https://doi.org/10.1007/978-3-319-03998-5_18

    Chapter  Google Scholar 

  5. Leino, K.R.M.: Dafny: an automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) LPAR 2010. LNCS (LNAI), vol. 6355, pp. 348–370. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-17511-4_20

    Chapter  MATH  Google Scholar 

  6. de Moura, L., Bjørner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337–340. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78800-3_24

    Chapter  Google Scholar 

  7. Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB Standard: Version 2.6. Publishing house of Department of Computer Science, The University of Iowa (2017). http://www.SMT-LIB.org. Accessed 11 Mar 2019

  8. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: from an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937–977 (2006)

    Article  MathSciNet  Google Scholar 

  9. Omelchuk, L., Shyshatska, O.: Extending the SMT-Lib standard with theory of nominative. In: Proceedings of the 15th International Conference on ICT in Education, Research and Industrial Applications. Integration, Harmonization and Knowledge Transfer (ICTERI2019), Volume II: Workshops, vol. 2393, pp. 522–533 (2019). http://www.CEUR-WS.org

  10. Theory of Nominative Data. https://sites.google.com/knu.ua/nominative-data. Accessed 21 Apr 2019

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Liudmyla Omelchuk .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Omelchuk, L., Shyshatska, O. (2020). SMT-LIB Theory of Nominative Data. In: Ermolayev, V., Mallet, F., Yakovyna, V., Mayr, H., Spivakovsky, A. (eds) Information and Communication Technologies in Education, Research, and Industrial Applications. ICTERI 2019. Communications in Computer and Information Science, vol 1175. Springer, Cham. https://doi.org/10.1007/978-3-030-39459-2_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-39459-2_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-39458-5

  • Online ISBN: 978-3-030-39459-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics