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.
Cite
CITATION STYLE
Artëmov, S., & Krupski, V. (1994). Referential data structures and labeled modal logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 813 LNCS, pp. 23–33). Springer Verlag. https://doi.org/10.1007/3-540-58140-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
