Referential data structures and labeled modal logic

  • Sergei Artëmov
  • Vladimir Krupski
Conference paper

DOI: 10.1007/3-540-58140-5_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 813)
Cite this paper as:
Artëmov S., Krupski V. (1994) Referential data structures and labeled modal logic. In: Nerode A., Matiyasevich Y.V. (eds) Logical Foundations of Computer Science. LFCS 1994. Lecture Notes in Computer Science, vol 813. Springer, Berlin, Heidelberg

Abstract

We introduce reference structures — a basic logical model of a computer memory organization capable to store and utilize information about its addresses. The corresponding labeled modal logics are axiomatized and supplied with the completeness and decidability theorems. A labeled modal formula can be regarded as a description of a certain reference structure; the satisfiability algorithm gives a method of building and optimizing reference structures satisfying a given formula.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • Sergei Artëmov
    • 1
  • Vladimir Krupski
    • 2
  1. 1.Steklov Mathematical InstituteMoscowRussia
  2. 2.Department of MathematicsMoscow State UniversityMoscowRussia

Personalised recommendations