Model Checking Dynamic Allocation and Deallocation

Share/Save/Bookmark

Distefano, Dino and Rensink, Arend and Katoen, Joost-Pieter (2001) Model Checking Dynamic Allocation and Deallocation. [Report]

[img] PDF
Restricted to UT campus only

528kB
Abstract:This paper proposes Allocational Temporal Logic (ATL) as a formalism to express properties concerning the dynamic allocation (birth) and de-allocation (death) of entities, such as the objects in an object-based system. The logic is interpreted on History-Dependent Automata, extended with a symbolic representation for certain cases of unbounded allocation. The paper also presents a simple imperative language with primitive statements for (de)allocation, with an operational semantics, to demonstrate the kind of behaviour that can be modelled. The main contribution of the paper is a tableau-based model checking algorithm for ATL, along the lines of Lichtenstein and Pnueli's algorithm for LTL.
Item Type:Report
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/63091
Official URL:http://www.ub.utwente.nl/webdocs/ctit/1/0000007a.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page