Chou, C.-T., Peled, D.: Verifying a model-checking algorithm. In: Tools and Algorithms for the Construction and Analysis of Systems, Passau, Germany, 1996. LNCS 1055. Berlin, Heidelberg, New York: Springer-Verlag, 1997, pp. 241--257  Home/Search   Document Not in Database   Summary   Related Articles   Check

....of large scale practical applications, such as protocol verification, where a great deal of the formal mathematics is highly complicated, but shallow and representationally simple. In applications such as this, there will be parts, such as reasoning about abstraction and refinement methods (see [1] for an example) where expressive power can be a great advantage. There will be other parts, such as verifying that the atomic state transitions of a system satisfy an invariant, where expressive power is less important and where the speed and effectiveness of basic inference mechanisms, such as ....

C.-T. Chou and D. Peled. Verifying a model-checking algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, number 1055 in LNCS, pages 241--257, Passau, Germany, 1996. Springer-Verlag.

....to this model. One might ask why not just use HOL (for example) The answer is that we are aiming to make Nuprl an effective tool for a wide range of formal problems related to protocol verification. For example, we want to be able to reason about abstraction and refinement methods (see [1] for an example) an area where expressive power can be a great advantage. Of course, there are verification tasks, such as checking that the atomic state transitions of a system preserve a property, where expressive power may be less important and where the speed and effectiveness of basic ....

C.-T. Chou and D. Peled. Verifying a model-checking algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of Lecture Notes in Computer Science, pages 241--257. Springer-Verlag, 1996.

.... methods based on binary decision diagrams have been shown to lack these two important features, e.g. 8] The correctness properties of the reduction algorithm itself (i.e. the preservation of safety and liveness properties) were verified independently with the help of the theorem prover HOL [13]. 3.4 Memory Management The size of the interleaving product that SPIN computes can, in the worst case, grow exponentially with the number of processes. Given the size of the product, expressed as the number of reachable system states R, we can place upperbounds on the amount of memory (space) ....

C-T. Chou, and D. Peled, "Verifying a Model-Checking Algorithm, " Proc. Tools and Algorithms for the Construction and Analysis of Systems (TACAS96), Passau, Germany, Lecture Notes in Computer Science 1,055, pp. 241-257. Springer-Verlag, Mar. 1996.

No context found.

Chou, C.-T., Peled, D.: Verifying a model-checking algorithm. In: Tools and Algorithms for the Construction and Analysis of Systems, Passau, Germany, 1996. LNCS 1055. Berlin, Heidelberg, New York: Springer-Verlag, 1997, pp. 241--257

No context found.

Chou, C.-T., Peled, D.: Verifying a model-checking algorithm. In: Tools and Algorithms for the Construction and Analysis of Systems, Passau, Germany, 1996. LNCS 1055. Berlin, Heidelberg, New York: Springer-Verlag, 1997, pp. 241--257

No context found.

C.-T. Chou and D. Peled. Verifying a Model-checking Algorithm. In Tools and Algorithms for the Construction and Analysis of Systems, volume 1055 of LNCS, pages 241-257. Springer-Verlag, 1996.

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