D. Distefano, A. Rensink, and J.-P. Katoen. Model checking dynamic allocation and deallocation. CTIT Technical Report TR--CTIT--01--40, Faculty of Informatics, University of Twente, December 2001. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Who is Pointing When to Whom: On Model-Checking Pointer.. - Distefano, Rensink.. (2003) Self-citation (Distefano Rensink Katoen) (Correct)
No context found.
D. Distefano, A. Rensink, and J.-P. Katoen. Model checking dynamic allocation and deallocation. CTIT Technical Report TR--CTIT--01--40, Faculty of Informatics, University of Twente, December 2001.
Who is Pointing When to Whom: On Model-Checking Pointer.. - Distefano, Rensink.. (2003) Self-citation (Distefano Rensink Katoen) (Correct)
No context found.
D. Distefano, A. Rensink, and J.-P. Katoen. Model checking dynamic allocation and deallocation. CTIT Technical Report TR--CTIT--01--40, Faculty of Informatics, University of Twente, December 2001.
Model Checking Birth And Death - Distefano, Rensink, Katoen (2002) Self-citation (Distefano Rensink Katoen) (Correct)
....latter provides an intuition about the sort of behaviour that HABA can model. The main contribution of the paper is the proof of model checking property (Section 5) A discussion about related and future work completes the paper (Section 6) Proofs are reported in the long version of this paper [9]. 2. Allocational temporal logic Syntax. Let LVar be a countable set of logical variables ranged over by x, y, z, and Ent be a countable set of entities ranged over by e, e # , e 1 , Allocational Temporal Logic (A##TL) is an extension of propositional LTL [17] that allows existential ....
....# i . Thus, entity e is considered to be deallocated if e dom(#) Using these adapted definitions of N and #, a satisfaction relation for can be defined in terms of folded allocational sequences precisely in the same way as above. The two kinds of sequences are equivalent models for [9]. The use of reallocations yields a local notion of entity identity that in turn allows minimisation of models [16] 4 3. High level Allocational Buchi automata In this section, we introduce an extension of (generalised) Buchi automata. Highlevel Allocational Buchi automata (HABA) generate ....
[Article contains additional citation context not shown here]
D. Distefano, A. Rensink J.-P. Katoen. Model checking dynamic allocation and deallocation. Technical report TR-01-40, University of Twente, 2002. Available on line at http://fmt.cs.utwente.nl/ddino/papers/DSRK01-report.ps.gz
Model Checking for Dynamic Allocation and Deallocation.. - Distefano, Rensink.. (2002) (3 citations) (Correct)
No context found.
D. Distefano, A. Rensink, J.-P. Katoen. Model Checking for dynamic Allocation and Deallocation. Technical report TR-01-40, University of Twente, 2001.
Requirements-Level Semantics and Model Checking of.. - Eshuis, Jansen, Wieringa (2002) (Correct)
No context found.
Distefano D, Rensink A, Katoen J-P. Model checking dynamic allocation and deallocation. CTIT technical report TR-CTIT-0104, University of Twente, 2002
Model Checking For Dynamic - Allocation And Deallocation (Correct)
No context found.
D. Distefano, A. Rensink, J.-P. Katoen. Model Checking for dynamic Allocation and Deallocation. Technical report TR-01-40, University of Twente, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC