Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In Proc. 22nd International Conference on Software Engineering (ICSE), pages 478--487, Limerick, Ireland, June 2000.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....analyzing speci cations. Objects and inheritance have also been added to declarative languages. For example, Prolog [17] extends Prolog. OOLP [2] aims to integrate objectoriented paradigm with logic programming by translating OOLP code into Prolog without meta interpretation. Keidar et al. [10] add inheritance to the IOA language [13] for modeling state machines, which enables reusing simulation proofs between state machines. This approach allows only a limited form of inheritance, subclassing for extension: subclasses can add new methods and specialize inherited methods, but they ....

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In Proc. 22nd International Conference on Software Engineering (ICSE), pages 478-487, Limerick, Ireland, June 2000.

....analyzing speci cations. Objects and inheritance have also been added to declarative languages. For example, Prolog [13] extends Prolog. OOLP [1] aims to integrate objectoriented paradigm with logic programming by translating OOLP code into Prolog without meta interpretation. Keidar et al. [8] add inheritance to the IOA language [11] for modeling state machines, which enables reusing simulation proofs between state machines. This approach allows only a limited form of inheritance, subclassing for extension: subclasses can add new methods and specialize inherited methods, but they ....

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In Proc. 22nd International Conference on Software Engineering (ICSE), pages 478-487, Limerick, Ireland, June 2000.

No context found.

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman. An inheritance-based technique for building simulation proofs incrementally. MIT-LCS-TR. 2000. In preparation.

....in pseudo code and proven correct operationally. However, due to their size and complexity, such algorithms were not previously modeled using formal methods nor were they assertionally verified. To manage the complexity of this project we have developed a formal inheritancebased methodology [30] for incrementally constructing specifications, algorithms, and proofs. In addition to making the project tractable, the use of this construct makes clear which parts of the algorithm implement which property. The modularity of this approach facilitates further modifications and alterations of the ....

....how the prestate is modified atomically to yield the post state. The precondition e#ect style is also known as a guarded command style: events have guards, or preconditions, and are triggered when the preconditions are enabled. We have developed a novel formal notion of inheritance for automata [30]. A child automaton is specified as a modification of the parent automaton s code. When presenting a child we first specify a signature extension which consists of new actions, labeled new, and modified actions. A modified action is labeled with the name of the action which it modifies as follows: ....

[Article contains additional citation context not shown here]

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman, An inheritance-based technique for building simulation proofs incrementally, ACM Transactions on Software Engineering and Methodology, 11 (2002), pp. 1--29. Previous version in ICSE 2000, pp. 478--487.

....in pseudocode and proven correct operationally. However, due to their size and complexity, such algorithms were not previously modeled using formal methods nor were they assertionally verified. To manage the complexity of this project we have developed a formal inheritancebased methodology [30] for incrementally constructing specifications, algorithms, and proofs. In addition to making the project tractable, the use of this construct makes clear which parts of the algorithm implement which property. The modularity of this approach facilitates further modifications and alterations of the ....

....how the prestate is modified atomically to yield the poststate. The precondition e#ect style is also known as a guarded command style: events have guards, or preconditions, and are triggered when the preconditions are enabled. We have developed a novel formal notion of inheritance for automata [30]. A child automaton is specified as a modification of the parent automaton s code. When presenting a child we first specify a signature extension which consists of new actions, labeled new, and modified actions. A modified action is labeled with the name of the action which it modifies as follows: ....

[Article contains additional citation context not shown here]

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman, An inheritance-based technique for building simulation proofs incrementally, ACM Trans. Software Engrg. and Methodology, 11 (2002), pp. 1--29.

....and complexity, such algorithms were not previously modeled using formal methods nor were they assertionally verified. 1. 4 New Modeling Methodology To manage the complexity of our design we have developed a formal methodology for incrementally constructing specifications, algorithms, and proofs [61, 62]. In addition to making the project tractable, the use of this construct makes clear which parts of the algorithm implement which property. The modularity of this approach facilitates further modifications and alterations of the design. Both the design and the new modeling methodology are ....

....is organized into two parts. The first part is comprised of two chapters: Chapter 2 reviews formal model, proof techniques, and notation. Chapter 3 presents the incremental modeling and verification formalism that we have developed; the presentation is based on the material published in [61, 62]. We employ this formalism for modeling and verifying our GCS design. The second part covers our design of the Virtually Synchronous Group Communication service; it constitutes the main part of the dissertation. Chapters 4 8 are based on the material published in [59, 60] In Chapter 4 we ....

[Article contains additional citation context not shown here]

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. ACM Transactions on Software Engineering and Methodology, 11(1):1--29, January 2002.

....and complexity, such algorithms were not previously modeled using formal methods nor were they assertionally verified. 1. 4 New Modeling Methodology To manage the complexity of our design we have developed a formal methodology for incrementally constructing specifications, algorithms, and proofs [61, 62]. In addition to making the project tractable, the use of this construct makes clear which parts of the algorithm implement which property. The modularity of this approach facilitates further modifications and alterations of the design. Both the design and the new modeling methodology are ....

....is organized into two parts. The first part is comprised of two chapters: Chapter 2 reviews formal model, proof techniques, and notation. Chapter 3 presents the incremental modeling and verification formalism that we have developed; the presentation is based on the material published in [61, 62]. We employ this formalism for modeling and verifying our GCS design. The second part covers our design of the Virtually Synchronous Group Communication service; it constitutes the main part of the dissertation. Chapters 4 8 are based on the material published in [59, 60] In Chapter 4 we ....

[Article contains additional citation context not shown here]

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In 22nd International Conference on Software Engineering (ICSE), pages 478--487. ACM, June 2000.

....inheritance by specialization and subclassing for extension, simulation proofs, re nements, incremental proof techniques, proof reuse. Pre print of article in ACM Transactions on Software Engineering and Methodology (TOSEM) 11(1) pages 1 29, January 2002. Preliminary version appeared in [26]. This work was supported by Air Force Aerospace Research (OSR) contracts F49620 00 1 0097 and F49620 00 1 0327, NTT contract MIT9904 12, and NSF grants CCR 9909114 and EIA 9901592. The work of the fourth author was additionally supported by the NSF Grant CCR 9988304 and the NSF Career Award ....

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman. An inheritance-based technique for building simulation proofs incrementally. In 22nd International Conference on Software Engineering (ICSE), pages 478-487, June 2000.

....keywords and phrases: inheritance by specialization and subclassing for extension, simulation proofs, re nements, incremental proof techniques, proof reuse. A preliminary abstract of this work appears in the proceedings of the International Conference on Software Engineering, ICSE 2000 [25]. This work was supported by Air Force Aerospace Research (OSR) contracts F49620 00 1 0097 and F49620 00 1 0327, Nippon Telegraph and Telephone (NTT) contract MIT990412, and NSF grants CCR 9909114 and EIA 9901592. The work of the fourth author was additionally supported by the NSF Grant ....

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman. An inheritance-based technique for building simulation proofs incrementally. In 22nd International Conference on Software Engineering (ICSE), pages 478-487, June 2000.

....how this process in I 5 can influence and complement IOA. We are also pursuing the specification of the se mantics of interface. There is still no way to specify the meaning of the inheritance in I 5 without using the component types classes semantics. Inheritance in IOA has been analyzed in [9], and interface extension seems to map nicely to I 5 s interface inheritance, as well as specialization describes implementation inheritance, but additional work is needed to fully understand the correspondence and its implications. ....

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An Inheritance-Based Technique for Building Simulation Proofs Incrementally. In Proceedings of the 22nd. International Conference on Software Engineering, ICSE'2000 (to appear), Limerick, Ireland, 2000.

....of correctness are all precise and formal. Our project is the rst to use formal methods for modeling a Virtually Synchronous GCS and to provide an assertional proof of its correctness. In order to manage the complexity of the design, we have developed a novel, inheritance based methodology [KKLS00] This methodology allows for incremental construction of formal speci cations, algorithms, and, very importantly, proofs. In addition to making the design tractable, the use of this methodology makes it evident which part of the algorithm implements which property. We now discuss each of the ....

....in pseudocode and proven correct operationally. However, due to their size and complexity, such algorithms were not previously modeled using formal methods nor were they assertionally veri ed. To manage the complexity of this project we have developed a formal inheritance based methodology [KKLS00] for incrementally constructing speci cations, algorithms, and proofs. In addition to making the project tractable, the use of this construct makes clear which parts of the algorithm implement which property. The modularity of this approach facilitates further modi cations and alterations of the ....

[Article contains additional citation context not shown here]

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In 22nd International Conference on Software Engineering (ICSE), pages 478-487, June 2000.

.... shortcoming by specifying separate properties as separate abstract automata, and by incrementally constructing the algorithm that implements them # in each step adding support for an additional property # using a novel inheritance based construct, recently introduced to the I O automaton model [12]. This paper informally argues the algorithm s correctness; a formal correctness proof by simulation is included in the full paper [11] 2. Formal Model and Notation In the I O automaton model (cf. 15] Ch. 8) a system component is described as a state machine, called an I O automaton. The ....

....a pre : block with preconditions on the states in which the action is enabled, and an eff : block which speci Thetaes how the pre state is modi Thetaed atomically to yield the post state. We use a novel inheritance based formal concept, recently introduced into the I O automaton model [12]. A child automaton is speci Thetaed as a modi Thetacation of the parent automaton s code. When presenting a child we Thetarst specify a signature extension which consists of new actions (labeled new) and modi Thetaed actions (a modi Thetaed action is labeled with the name of the action which it ....

[Article contains additional citation context not shown here]

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman. An inheritance-based technique for building simulation proofs incrementally. MIT-LCS-TR. 2000. In preparation.

No context found.

Idit Keidar, Roger Khazan, Nancy Lynch, and Alex Shvartsman. An inheritancebased technique for building simulation proofs incrementally. In Proc. 22nd International Conference on Software Engineering (ICSE), pages 478--487, Limerick, Ireland, June 2000.

No context found.

I. Keidar, R. Khazan, N. Lynch, and A. Shvartsman. An inheritance-based technique for building simulation proofs incrementally. In Proc. 22nd International Conference on Software Engineering (ICSE), pages 478--487, Limerick, Ireland, June 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