Formal Verification of UML-RT Capsules using Model Checking
Citations
14 citations
10 citations
1 citations
Cites background from "Formal Verification of UML-RT Capsu..."
...the queue and processes it by generating appropriate responses, and due to the run-to-completion semantic of the capsule only one message will be processed at a time[12]....
[...]
...This gives the capsules an outside view of a black box[12]....
[...]
References
7,184 citations
4,335 citations
4,159 citations
"Formal Verification of UML-RT Capsu..." refers background or methods in this paper
...For reasons of verification efficiency, Spin does not attempt to prove that a behavior is guaranteed; instead Spin attempts to show how a behavior claimed to be impossible can in fact be achieved (Holzmann 1997, p. 97)....
[...]
...Although it is not impossible to write stutter invariant properties that make use of the next operator (Holzmann 2003), an LTL formula which does not contain the next operator is guaranteed to be stutter invariant (Peled et al. 1995)....
[...]
...A design is transformed into a description suitable for the model 4LTL is described in more detail in Section 2.3.3....
[...]
...For a complete description of Spin, Promela and further examples see, e.g., Holzmann (2003), Ben-Ari (2008) and Holzmann (1997)....
[...]
...8 2.3.3 Property specification in Spin using LTL . . . . . . . . . 10 2.3.4 LTL property verification . . . . . . . . . . . . . . . . . . 11 2.3.5 Problem space reduction . . . . . . . . . . . . . . . . . . . 11...
[...]
3,409 citations
2,650 citations