1996
DOI: 10.1007/3-540-60973-3_93
|View full text |Cite
|
Sign up to set email alerts
|

Consistency and refinement for partial specification in Z

Abstract: This paper discusses theoretical background for the use of Z as a language for partial specification, in particular techniques for checking consistency between viewpoint specifications. The main technique used is unification, i.e. finding a (candidate) least common refinement. The corresponding notion of consistency between specifications turns out to be different from the known notions of consistency for single Z specifications. A key role is played by correspondence relations between the data types used in t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
27
0
1

Year Published

1996
1996
2002
2002

Publication Types

Select...
6
1

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(28 citation statements)
references
References 13 publications
0
27
0
1
Order By: Relevance
“…Arguments for aspect-oriented system design can be found in the literature [7,12,15]. Aspect-oriented specification has been studied in the context of multi-paradigm specification techniques, where it is assumed that the different notations can be translated into a common (state-based) framework [6,7,26].…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Arguments for aspect-oriented system design can be found in the literature [7,12,15]. Aspect-oriented specification has been studied in the context of multi-paradigm specification techniques, where it is assumed that the different notations can be translated into a common (state-based) framework [6,7,26].…”
Section: Discussionmentioning
confidence: 99%
“…Boiten et al have a related notion [7]. In their work, two specifications are called consistent if they have a common refinement.…”
Section: Definition 10 (Composability) Two Component Specifications γmentioning
confidence: 99%
“…8Section 9 1 So far so good. We can specify a system that contains non-determinism in some of the operations in its user interface (e.g.…”
Section: Re Nementmentioning
confidence: 99%
“…The three regions of an operation represent: (1) states where the operation is divergent because no constraints are made on the after state (the unconstrained region), (2) states outside the usual pre-condition but which aren't divergent (the empty region), and (3) the remaining states where some but not all after states are allowed (the interesting region). For a full discussion the reader should consult 19].…”
Section: The Ring Condition Interpretationmentioning
confidence: 99%
“…For any two viewpoints, it is possible to construct a candidate unification, which is the least common refinement if one exists, [1] . Two conditions characterise whether the candidate is a refinement.…”
Section: (A)mentioning
confidence: 99%