Referential data structures and labeled modal logic
- 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
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.
Unable to display preview. Download preview PDF.