J.F. Sgaard-Andersen, S.J. Garland, J.V. Guttag, N.A. Lynch, and A. Pogosyants. Computer-assisted simulation proofs. In Proceedings of the Conference on Computer-Aided Verification, Heraklion, Crete, Greece, June 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....to input for LP, the Larch Prover of [13] A few simple examples were verified using the tool, including a spanning tree algorithm. In these examples the mechanically checkable proofs written in the translator were only two to three times longer than careful hand proofs. Sgaard Andersen et.al. [26] formalized a simple I O automata verification of a communication protocol using the LP verification system. They report that, after all the basic machinery of the I O automata model has been formalized, as well as the basic data types employed by the protocol, the use of LP even leads to a ....

J. Sgaard-Andersen, S. Garland, J. Guttag, N.A. Lynch, and A. Pogosyants. Computerassisted simulation proofs. In Courcoubetis [8], pages 305--319.

....of states or actions; instead, we use simulation to establish a relation between concrete and abstract executions and then translate properties of the latter into those of the former via that relation. In addition to this paper, the mechanization of simulation techniques is also treated in [7, 24, 31, 35]. Hoare triples were introduced in [19] But, as far as we know, using them as a relational formulation of translation of properties is new. Also new is the formulation and use of the Reduction Lemmas. The notions of events and causality are not new [21, 30] Indeed, a variety of non interleaving ....

J. Sgaard-Andersen, S. Garland, J. Guttag, N. Lynch, and A. Pogosyants, "Computer-Assisted Simulation Proofs", in [13], p. 305--319. The Computer Journal, Vol. 38, No. 2, 1995

....model checking [4] already provides a successful automatic approach to the verification of finite state systems. IOA were chosen as the vehicle for our study because they have become popular for specifying and verifying distributed algorithms both on paper [8, 2] and with machine assistance [10, 6, 13, 7]. The unique aspect of our work is the fact that we have formalized and verified the meta theory of IOA on top of which we carried out our case study. Thus IOA are objects in the logic, just like natural numbers or lists, which can be manipulated by operators such as parallel composition and ....

....typical example of the kind of mistake that formalized meta theory helps to avoid. Helmink et al. 6] follow the same approach: they verify a communication protocol using the Coq system [5] to discharge proof obligations set up by hand. An interesting compromise is the approach by Garland et al. [13, 7] based on the Larch Prover (LP) They formalize some of the meta theory (e.g. finite execution fragments and simulation maps) using the Larch Shared Language (LSL) They can then generate verification conditions automatically from LSL specifications and discharge them using LP. In contrast to our ....

Jrgen Sgaard-Andersen, Stephen Garland, John Guttag, Nancy Lynch, and Anya Pogosyants. Computer-assisted simulation proofs. In Fourth Conference on Computer-Aided Verification, volume 697 of Lect. Notes in Comp. Sci., pages 305--319. Springer-Verlag, 1993. This article was processed using the L a T E X macro package with LLNCS style 19

No context found.

J.F. Sgaard-Andersen, S.J. Garland, J.V. Guttag, N.A. Lynch, and A. Pogosyants. Computer-assisted simulation proofs. In Proceedings of the Conference on Computer-Aided Verification, Heraklion, Crete, Greece, June 1993.

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