EEMCS EPrints Service
|
||||||||||||||||||||||||||||||||
|
Distefano, D.S. and Katoen, J.P. and Rensink, A.
(2004)
Who is pointing when to whom?
In: Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 16-18 Dec 2004, Chennai, India.
pp. 250-262.
Lecture notes in Computer Science 3328.
Springer.
ISBN 3-540-24058-6
Full text available as:
Official URL: http://dx.doi.org/10.1007/b104325 AbstractThis paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each other via pointers. Our logic is focused on specifying properties about the dynamic evolution (such as creation, adaptation, and removal) of such pointer structures. The semantics is based on automata on infinite words, extended with appropriate means to model evolving pointer structures in an abstract manner. A tableau-based model-checking algorithm is proposed to automatically verify these automata against formulae in our logic.
Export this item as: To request a copy of the PDF please email us request copy To correct this item please ask your editor Repository Staff Only: edit this item |
||||||||||||||||||||||||||||||||