Weak refinement in Z

Derrick, John; Boiten, Eerke Albert; Bowman, Howard; Steen, Maarten

doi:10.1007/bfb0027298

Cited by 20 publications

(6 citation statements)

References 9 publications

(9 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generalizations of data refinement, e.g. weak refinement [10] and coupled refinement [14] have also suggested more general types of diagrams.…”

Section: Introductionmentioning

confidence: 98%

Completeness of ASM Refinement

Schellhorn

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

ASM refinements are verified using generalized forward simulations which allow to refine m abstract operations to n concrete operations with arbitrary m and n. One main difference to data refinement is that ASM refinement considers infinite runs and termination. Since backward simulation does not preserve termination in general, the standard technique of adding history information to the concrete level is not applicable. The powerset construction also adds infinite runs and is therefore not applicable too. This paper shows that a completeness proof is nevertheless possible by adding infinite prophecy information, effectively moving nondetermism to the initial state. Adding such prophecy information can be done on the semantic level, but also by a simple syntactic transformation that removes the choose construct of ASMs. The completeness proof is also ported to give a completeness proof for IO automata.

show abstract

“…Generalizations of data refinement, e.g. weak refinement [10] and coupled refinement [14] have also suggested more general types of diagrams.…”

Section: Introductionmentioning

confidence: 98%

Completeness of ASM Refinement

Schellhorn

2008

Electronic Notes in Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The treatment of input and output parameters of operations is, however, slightly different leading to a different treatment of refinement [16]. The relationship between the Z and LOTOS refinement relations in the context of consistency checking in ODP is discussed in [7,6], where the latter develops refinement relations for Z specifications that contain internal operations.…”

Section: Discussionmentioning

confidence: 99%

Translating LOTOS to Object-Z

Derrick¹,

Boiten²,

Bowman³

et al. 1997

Electronic Workshops in Computing

Self Cite

View full text Add to dashboard Cite

This paper presents a translation between the formal description technique LOTOS and the object-oriented specification language Object-Z. The need for such a translation lies in the use of formal methods in viewpoint specification, and in particular in the Open Distributed Processing standard. The use of viewpoints as a set of partial interlocking specifications brings an obligation to check the consistency of these partial specifications, and to do so we need to relate specifications written in differing languages. The work presented here supports the consistency checking of viewpoints written using formal methods by defining a translation from full LOTOS to Object-Z. A common semantic model is provided for the languages, and we verify the translation with respect to this model. The translation is illustrated with a small example.

show abstract

“…For a further discussion of this issue, which is central in the re nement of internal operations, cf. 16]. An additional argument for sticking to this interpretation is that the re nement rules for Z were originally derived from just such a behavioural characterisation (cf.…”

Section: Operation Re Nementmentioning

confidence: 99%

“…For this purpose, we need to impose a behavioural interpretation on Z speci cations, and relate development relations used in the process algebra world to re nement and possibly other development relations for Z. First results of these investigations are reported in 17,16,15].…”

Section: Behavioural Interpretationsmentioning

confidence: 99%