Skip to main content

On Algebraic Properties of Nominative Data and Functions

  • Conference paper
  • First Online:

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 469))

Abstract

In the chapter basic properties of nominative data and functions over nominative data (nominative functions) are investigated from the perspective of abstract algebra. A set of all nominative data over arbitrary fixed sets of names and values together with basic operations which include naming, denaming, and overlapping is considered as an algebraic structure and its main properties are studied. Nominative data with complex names satisfy the principle of associative naming and processing. For such data a natural equivalence relation is introduced. Properties of nominative functions (mathematical models of programs over nominative data) and predicates are studied. A notion of nominative stability of nominative functions and predicates is considered. A two-sorted algebra of nominative functions and predicates which generalizes Glushkov algorithmic algebras is introduced and it is proved that the set of nominative stable functions and the set of nominative stable predicates constitute its sub-algebra. The obtained results form a mathematical basis for nominative program logic construction.

This work was supported in part by the research project No. 11BF015-02 “Formal specifications and methods of development of reliable software systems”, Taras Shevchenko National University of Kyiv, Ukraine.

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

Buying options

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

Learn about institutional subscriptions

References

  1. Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Springer, Heidelberg (2012)

    Book  MATH  Google Scholar 

  2. Nikitchenko, N.S.: A composition-nominative approach to program semantics. Technical report, IT-TR 1998–020, Technical University of Denmark (1998)

    Google Scholar 

  3. Nikitchenko, M., Tymofieiev, V.: Satisfiability in composition-nominative logics. Cent. Eur. J. Comput. Sci. 2, 194–213 (2012)

    Article  MATH  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, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Nikitchenko, M., Ivanov, I.: Programming with nominative data. In: Proceedings of CSE’2010 International Scientific Conference on Computer Science and Engineering, Kosice, Slovakia, 20–22 September 2010, pp. 30–39 (2010)

    Google Scholar 

  6. Nikitchenko, M., Ivanov, I.: Composition-nominative languages of programs with associative denaming. Visnyk (Bulletin) of the Lviv University Ser. Appl. Math. Inform. 16, 124–139 (2010)

    Google Scholar 

  7. Nielson, H.R., Nielson, F.: Semantics with Applications: A Formal Introduction. John Wiley & Sons Inc., New York (1992)

    MATH  Google Scholar 

  8. Floyd, R.: Assigning meanings to programs. Proc. Am. Math. Soc. Symp. Appl. Math. 19, 19–31 (1967)

    Article  MathSciNet  Google Scholar 

  9. Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 576–580, 583 (1969)

    Google Scholar 

  10. Skobelev, V.: Local algorithms on graphs. Publishing house of Institute of Applied Mathematics and Mechanics of NAS of Ukraine (in Russian) (2003)

    Google Scholar 

  11. Roman, S.: Lattices and Ordered Sets. Springer, New York (2008)

    MATH  Google Scholar 

  12. Glushkov, V.: Automata theory and formal transformations of microprograms. Cybernetics (in Russian) 5, 3–10 (1965)

    Article  Google Scholar 

  13. Coquand, T., Paulin, C.: Inductively defined types. In: Martin-Löf, P., Mints, G. (eds.) COLOG 1988. LNCS, vol. 417, pp. 50–66. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  14. Mirkowska, G., Salwicki, A.: Algorithmic Logic. Springer, New York (1987)

    MATH  Google Scholar 

  15. Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ievgen Ivanov .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Skobelev, V.G., Nikitchenko, M., Ivanov, I. (2014). On Algebraic Properties of Nominative Data and Functions. In: Ermolayev, V., Mayr, H., Nikitchenko, M., Spivakovsky, A., Zholtkevych, G. (eds) Information and Communication Technologies in Education, Research, and Industrial Applications. ICTERI 2014. Communications in Computer and Information Science, vol 469. Springer, Cham. https://doi.org/10.1007/978-3-319-13206-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13206-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13205-1

  • Online ISBN: 978-3-319-13206-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics