J. Coenen, W.-P. de Roever, and J. Zwiers. Assertional data reification proofs: Survey and perspective. In J. M. Morris and R. Shaw, editors, 4th Refinement Workshop, pages 97--114. Springer-Verlag, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

.... should not be too difficult, as the theoretical basis is well in place [31] and was evidently the source of the proof obligations in the first place) There are, in fact, at least four different refinement relations that apply to sequential nondeterministic systems (a brief summary appears in [16]) The refinement proof obligation uses the most common of these relations, but there is no clear reason why the others should not also be permitted. Theorems Z specifications often contain statements of theorems, but these are not formally part of Z. 3.6.3 Undefinedness The treatment of ....

J. Coenen, W.-P. de Roever, and J. Zwiers. Assertional data reification proofs: Survey and perspective. In Proceedings of the Fourth Refinement Workshop, 1991. (to appear).

....any implementation of OE ; also refines our normal form. The same holds for the concrete level refinement of OE ; Our solution is the least refined conjunctive refinement of the refinement calculus solution. An earlier but rather faulty attempt to solve the simulation problems appeared as [2]. Our first correct solution to the downward simulation problem for partial correctness was possible due to a suggestion by Ralph Back bridging a gap in our proof. However, the new proofs presented here do not depend anymore on his clue. We thank Rudolf Berghammer for providing the historical ....

J. Coenen, J. Zwiers, and W.-P. de Roever. Assertional data reification proofs: Survey and perspective. In J. Morris and R. Shaw, editors, Proceedings of the 4th Refinement Workshop, Workshops in Computing, pages 91--114. Springer-Verlag, 1991.

....specification S = Sigma; Phi; T; L) by adding a simple prophecy variable iff: P1: Sigma p Sigma Theta Sigma P (The state space is enlarged with an additional component. 2 This requirement is well known from definitions of a concept called forward , downward , or Lsimulation [HHS87, Jon91, CZdR91] K. Engelhardt and W. P. de Roever SA S p C SC Fig. 8. A prophecy variable. P2: Phi p = Pi Gamma1 [P] Phi) The initial states of S p are exactly all those states in Sigma p which correspond in their first component with an initial state of S. P3: s; p) s 0 ; p 0 ....

....work that ought to be done by the state automaton. This requirement is named in the following definition and e.g. fulfilled if the supplementary property is a liveness property. 3 This requirement is well known from definitions of a concept called backward , upward , or L Gamma1 simulation [HHS87, Jon91, CZdR91] Towards a Practitioners Approach to A L s Method 11 Definition 12. taken from [AL88a] A specification S having machine property M and supplementary property L is machine closed iff M = M L. 2.3.3. Abstract Safety Specifies Observable Liveness The requirement which A L impose on the ....

Jos Coenen, Job Zwiers, and Willem-Paul de Roever. Assertional data reification proofs: Survey and perspective. In J.M. Morris and R.C. Shaw, editors, Proceedings of the 4th Refinement Workshop, Workshops in Computing, pages 91--114. Springer-Verlag, 1991.

No context found.

J. Coenen, W.-P. de Roever, and J. Zwiers. Assertional data reification proofs: Survey and perspective. In J. M. Morris and R. Shaw, editors, 4th Refinement Workshop, pages 97--114. Springer-Verlag, 1991.

No context found.

J. Coenen, W.-P. de Roever, and J. Zwiers. Assertional data reification proofs: Survey and perspective. In J. M. Morris and R. Shaw, editors, 4th Refinement Workshop, pages 97--114. Springer-Verlag, 1991.

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