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
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Springer, Heidelberg (2012)
Nikitchenko, N.S.: A composition-nominative approach to program semantics. Technical report, IT-TR 1998–020, Technical University of Denmark (1998)
Nikitchenko, M., Tymofieiev, V.: Satisfiability in composition-nominative logics. Cent. Eur. J. Comput. Sci. 2, 194–213 (2012)
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)
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)
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)
Nielson, H.R., Nielson, F.: Semantics with Applications: A Formal Introduction. John Wiley & Sons Inc., New York (1992)
Floyd, R.: Assigning meanings to programs. Proc. Am. Math. Soc. Symp. Appl. Math. 19, 19–31 (1967)
Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 576–580, 583 (1969)
Skobelev, V.: Local algorithms on graphs. Publishing house of Institute of Applied Mathematics and Mechanics of NAS of Ukraine (in Russian) (2003)
Roman, S.: Lattices and Ordered Sets. Springer, New York (2008)
Glushkov, V.: Automata theory and formal transformations of microprograms. Cybernetics (in Russian) 5, 3–10 (1965)
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)
Mirkowska, G., Salwicki, A.: Algorithmic Logic. Springer, New York (1987)
Harel, D., Kozen, D., Tiuryn, J.: Dynamic Logic. The MIT Press, Cambridge (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights 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)