K. Stahl, K. Baukus, Y. Lakhnech, and M. Ste#en. Divide, abstract, and modelcheck. In Proc. SPIN'99, LNCS 1680, pp. 57--76. Springer, 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Formal Verification of an Improved Sliding Window Protocol - Chkliaev, Hooman, de Vink (Correct)
....Stenning [20] only gave an informal manual proof for his protocol. A semi formal manual proof is also presented in [13] and some versions of the protocol have been model checked for small parameter values in [16] 12] 7] The combination of abstraction techniques and model checking in [19] allowed to verify the SW protocol for a relatively large window size of 16 (which is still a few orders less than a possible window size in TCP) The verifications [16] 12] 7] 19] assume data link channels, which can only lose messages. The protocols for such channels, called data link ....
.... for small parameter values in [16] 12] 7] The combination of abstraction techniques and model checking in [19] allowed to verify the SW protocol for a relatively large window size of 16 (which is still a few orders less than a possible window size in TCP) The verifications [16] 12] 7] [19] assume data link channels, which can only lose messages. The protocols for such channels, called data link protocols, are important (they include, e.g. HDLC, SLIP and PPP protocols) but they are only used for transmission of data over relatively short distances. In this paper, we study the ....
K. Stahl, K. Baukus, Y. Lakhnech, and M. Steffen. Divide, abstract, and model-check. In The 5th International SPIN Workshop on Theoretical Aspects of Model Checking, page ??? LNCS 1680, 1999.
Mechanical Abstraction of CSPz Processes - Mota, Borba, Sampaio (2002) (1 citation) (Correct)
....(See [4] for more details) The major advantage of our approach is that, unlike related work in the literature, we calculate the data abstraction from the process description itself. Notably, the most promising works on this research area assume some kind of data abstraction determined by the user [24,9,29,16]. The success of our strategy is directly related to how much the expansion of the Z part yields infinite regular behaviours [1] We deal with infinity in the following way: if the composition of schemas originate a stable behaviour from a certain state to infinite then we can obtain optimal ....
.... part is introduced via a functional characterisation of the com operations [2,3] Further, when the postcondition of some com operation is nondeterministic or is based on communication two approaches can used to compute the next state: one is based on testing [28] and another on theorem proving [16]. We have employed the testing approach on the WDT because it is less expensive and its nondeterminism is simple. The WDT was submitted to the prototype and we have confirmed our hypothesis stated in [2,3] which assumes that the WDT only needs two clock elements in its CLK given type: one for ....
[Article contains additional citation context not shown here]
K.Stahl, K.Baukus, Y.Lakhneich, and M.Steffen. Divide, Abstract, and Model Check. SPIN, pages 57-76, 1999.
Verification of a Wireless ATM Medium-Access Protocol - Sidorova, Steffen (2000) (1 citation) Self-citation (Ste) (Correct)
....straightforward, as they mainly perform data transformations. The WDLC layer, operating already on cell level, is reminiscent to conventional (non ATM) datalink protocols and responsible, per virtual channel, for error and owcontrolled cell transmission. It has independently been investigated [15] using abstraction, model checking, and theorem proving. The lowest level 2 Wireless ATM Network Demonstrator. 3 Hence the acronym M obile Access Scheme based on Contention and Reservation for ATM . 4 Over 300 pages of (graphical) SDL. 4 Layer Control Protocol Message Encapsulation ....
K. Stahl, K. Baukus, Y. Lakhnech, and M. Ste en. Divide, abstract, and modelcheck. In Dams et al. [8], pages 57-76.
Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2004) (Correct)
No context found.
K. Stahl, K. Baukus, Y. Lakhnech, and M. Ste#en. Divide, abstract, and modelcheck. In Proc. SPIN'99, LNCS 1680, pp. 57--76. Springer, 1999.
Verifying a Sliding Window Protocol in μCRL - Fokkink, Groote, Pang, Badban, .. (2003) (Correct)
No context found.
K. Stahl, K. Baukus, Y. Lakhnech, and M. Ste#en. Divide, abstract, and modelcheck. In Proc. SPIN'99, LNCS 1680, pp. 57--76. Springer, 1999.
Formal Verification of an Improved Sliding Window Protocol - Chkliaev, Hooman, de Vink (2002) (Correct)
No context found.
K. Stahl, K. Baukus, Y. Lakhnech, and M. Steffen. Divide, abstract, and model-check. In The 5th International SPIN Workshop on Theoretical Aspects of Model Checking, pages 57--76. LNCS 1680, 1999.
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