Abstract
The formalism of program logics is the main instrument for software verification. Such logics are based on formal program models and reflect main program properties. Among various program logics, Floyd-Hoare logic and its variants take a special place because of its naturalness and simplicity. But such logics are oriented on total pre- and post-conditions, and in the case of partial conditions they become unsound. Different methods to overcome this problem were proposed in our previous works. One of the methods involves extension of program algebras with the composition of predicate complement. This permits to modify rules of the logic making them sound. Such modification requires introduction of undefinedness conditions into logic rules. To work with such conditions, an underlying predicate logic should become more expressive. In this paper we continue our research of such logics. We investigate a special program-oriented predicate logic called logic of renominative (quantifier-free) level with the composition of predicate complement, extended renomination, and equality predicate. This logic is a constituent part of the program logic. We introduce a special consequence relation for this logic, construct a sequent calculus, and prove its soundness and completeness.
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
Abramsky, S., Gabbay, D., Maibaum, T. (eds.): Handbook of Logic in Computer Science, vol. 1–5. Oxford University Press, (1993–2000)
Hoare, C.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576–580 (1969)
Apt, K.: Ten years of Hoare’s logic: a survey - part I. ACM Trans. Program. Lang. Syst. 3(4), 431–483 (1981)
Blass, A., Gurevich, Y.: The underlying logic of Hoare logic, Current Trends in Theoretical Computer Science. In: Entering the 21st Century, World Scientific, pp. 409–436 (2001)
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
Ivanov, I., Nikitchenko, M.: Inference rules for the partial Floyd-Hoare logic based on composition of predicate complement. In: Ermolayev, V., Suárez-Figueroa, M.C., Yakovyna, V., Mayr, H.C., Nikitchenko, M., Spivakovsky, A. (eds.) ICTERI 2018. CCIS, vol. 1007, pp. 71–88. Springer, Cham (2019). https://doi.org/10.1007/978-3-030-13929-2_4
Nikitchenko, M., Shkilniak, O., Shkilniak S.: Program logics based on algebras with the composition of predicate complement. In: 9th International Conference on Advanced Computer Information Technologies (ACIT), Ceske Budejovice, Czech Republic, pp. 285–288 (2019)
Nikitchenko, M., Shkilniak, S.: Mathematical Logic and Theory of Algorithms. VPC Кyivskyi Universytet, Кyiv (2008). in Ukrainian
Nikitchenko, M., Shkilniak, S.: Applied Logic. VPC Кyivskyi Universytet, in Ukrainian, Кyiv (2013)
Nikitchenko, M., Shkilniak, O., Shkilniak, S.: Pure first-order logics of quasiary predicates. Prob. Program. 2–3, 73–86 (2016). in Ukrainian
Nikitchenko, M., Shkilniak, S.: Algebras and logics of partial quasiary predicates. Algebra Discrete Math. 23(2), 263–278 (2017)
Shkilniak, O.: Relations of logical consequence of logics of partial predicates with composition of predicate complement. Prob. Program. 3, 11–27 (2019). in Ukrainian
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. Open Computer Science (former Central European Journal of Computer Science) 2(3), 194–213 (2012)
Nikitchenko, M., Ivanov, I., Korniłowicz, A., Kryvolap, A.: Extended Floyd-Hoare logic over relational nominative data. In: Bassiliades, N., Ermolayev, V., Fill, H.-G., Yakovyna, V., Mayr, H.C., Nikitchenko, M., Zholtkevych, G., Spivakovsky, A. (eds.) ICTERI 2017. CCIS, vol. 826, pp. 41–64. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-76168-8_3
Nikitchenko, M., Ivanov, I., Skobelev, V.: Proving properties of programs on hierarchical nominative data. Comput. Sci. J. Moldova 24(3(72)), 371–398 (2016)
Kleene, S.: Introductions to Metamathematics. Amsterdam (North-Holland), New York - Toronto (Van Nostrand) (1952)
Korniłowicz, A., Ivanov, I., Nikitchenko, M.: Kleene algebra of partial predicates. Formalized Math. 26, 11–20 (2018)
Gallier, J.: Logic for Computer Science: Foundations of Automatic Theorem Proving, 2nd edn. Dover, New York (2015)
Hintikka, J.: Modality and quantification. In: Models for Modalities. Synthese Library (Monographs on Epistemology, Logic, Methodology, Philosophy of Science, Sociology of Science and of Knowledge, and on the Mathematical Methods of Social and Behavioral Sciences), vol. 23, pp. 57–70. Springer, Dordrecht (1969). https://doi.org/10.1007/978-94-010-1711-4_4
Kornilowicz, A., Kryvolap, A., Nikitchenko, M., Ivanov, I.: Formalization of the nominative algorithmic algebra in Mizar. In: Świątek, J., Borzemski, L., Wilimowska, Z. (eds.) ISAT 2017, AISC, vol. 656, pp. 176–186. Springer, Cham (2018)
Nikitchenko, M., Shkilniak, O., Shkilniak, S., Mamedov, T.: Completeness of the First-Order logic of partial quasiary predicates with the complement composition. Comput. Sci. J. Moldova 27(2(80)), 162–187 (2019)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Nikitchenko, M., Shkilniak, O., Shkilniak, S. (2020). Program-Oriented Logics of Renominative Level with Extended Renomination and Equality. 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-39459-2_4
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)