M. Nilsson, Regular Model Checking, Uppsala University, Thesis, 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Beyond Parameterized Verification: Automated Verification of .. - Bozzano, Delzanno (Correct)
....by applying the theory of well quasi ordering. This way, we do not have to apply manual abstractions to describe individual processes. This is an important aspect to take into account when comparing our practical results for single server systems (i.e. the rst experiments) with those obtained in [24, 26], in which an idealized version of the ticket al..gorithm has been automatically veri ed using the regular model checking method (actually, a real comparison is dicult here because the veri ed model is not described in [24, 26] The previous features also distinguish our approach from the veri ....
.... single server systems (i.e. the rst experiments) with those obtained in [24, 26] in which an idealized version of the ticket al..gorithm has been automatically veri ed using the regular model checking method (actually, a real comparison is dicult here because the veri ed model is not described in [24, 26]) The previous features also distinguish our approach from the veri cation with invisible invariants method of [28, 6] As an example, invisible invariants have been applied to automatically verify a restricted version of the parameterized bakery algorithm in which a special reducing process is ....
M. Nilsson. Regular Model Checking. PhD Thesis, IT
Test Vector Generation for UML Models with Abstractions - Votintseva (2002) (Correct)
No context found.
M. Nilsson, Regular Model Checking, Uppsala University, Thesis, 2000.
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