X. Qian and A. Goldberg. Referential opacity in nondeterministic data refinement. ACM LoPLaS, 2(1--4):233--241, 1993. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Complete Calculus for the Multialgebraic and Functional.. - Walicki, Meldal (1995) (11 citations) (Correct)
....implies the possibility of two terms returning the same result, but it does not guarantee that the same results actually will be produced. This leads to particular difficulties in treating properly such notions as, for example, observability [Hennessy 1980, Nipkow 1987] and implementation [Qian 1993]. Equality in our view should be a necessary equality which must hold in every evaluation of a program (specification) It does not correspond to set equality, but to identity of 1 element sets. Thus the simple formula t=s will be considered true (in a multistructure M) iff both t and s are ....
....3. 3) For a discussion of the consequences of allowing variables to be interpreted nondeterministically, see [Walicki 1994a,Walicki 1994b] We consider the loss of referential transparency implied by such a reinterpretation of equality to be an intrinsic feature of nondeterminism [e.g. Qian 1993] And as a consequence our proof system only allows a restricted form of substitutivity. Observe that operators with no arguments (which in theories of deterministic operations always denote constants) need not be constant at all in neq . An operator such as c: #S will have distinct meanings ....
Qian, X., Goldberg, A., "Referential Opacity In Nondeterministic Data Refinement", ACM LoPLaS , vol. 2, no. 1-4, 233-241, 1993.
A Complete Calculus for the Multialgebraic and Functional.. - Walicki, Meldal (1995) (11 citations) (Correct)
....implies the possibility of two terms returning the same result, but it does not guarantee that the same results actually will be produced. This leads to particular difficulties in treating properly such notions as, for example, observability [Hennessy 1980, Nipkow 1987] and implementation [Qian 1993]. Equality in our view should be a necessary equality which must hold in every evaluation of a program (specification) It does not correspond to set equality, but to identity of 1 element sets. Thus the simple formula t=s will be considered true (in a multistructure M) iff both t and s are ....
....3. 3) For a discussion of the consequences of allowing variables to be interpreted nondeterministically, see [Walicki 1994a,Walicki 1994b] We consider the loss of referential transparency implied by such a reinterpretation of equality to be an intrinsic feature of nondeterminism [e.g. Qian 1993] And as a consequence our proof system only allows a restricted form of substitutivity. Observe that operators with no arguments (which in theories of deterministic operations always denote constants) need not be constant at all in L neq . An operator such as c: #S will have distinct meanings ....
Qian, X., Goldberg, A., "Referential Opacity In Nondeterministic Data Refinement", ACM LoPLaS , vol. 2, no. 1-4, 233-241, 1993.
Abstraction Barriers in Equational Proof - Hannay (1998) (Correct)
....the data type. Our result is that this is indeed possible, provided one incorporates the appropriate abstraction barrier in the calculus itself. It suffices to restrict the congruence (monotonicity) axiom to contexts without designated hidden symbols, i.e. imposing referential opacity, see [11, 16] for other uses of referential opacity. Without such an abstraction barrier, the resulting set of equations may be inconsistent since (the axioms for) hidden operators might not respect the intended equality predicate. Several proof system schemata for structured specifications exist, see [7] for ....
X. Qian and A. Goldberg. Referential opacity in nondeterministic data refinement. ACM LoPLaS, 2(1--4):233--241, 1993.
Structured Specifications and Implementation of.. - Micha Walicki.. (1995) (1 citation) (Correct)
....t is considered deterministic and underspecified. To get rid of this problem, we ffl need a syntactic means of distinguishing between deterministic and possibly nondeterministic operations, and ffl restrict the congruence requirement E4 to deterministic operations. This was suggested already in [QG93] and will apply to all different approaches which we will consider in the following sections. Notice that the second point implies that we introduce a distinction between underspecified and (possibly) nondeterministic operations the former ones respect congruence. In the present example, we ....
X. Qian, A. Goldberg. Referential Opacity in Nondeterministic Data Refinement. ACM LoPLaS, vol. 2, no. 1-4: 233-241, (1993).
Referential Opacity in Equational Reasoning - Hannay (1998) (Correct)
No context found.
X. Qian and A. Goldberg. Referential opacity in nondeterministic data refinement. ACM LoPLaS, 2(1--4):233--241, 1993.
Referential Opacity in Equational Reasoning - Hannay (1998) (Correct)
No context found.
X. Qian and A. Goldberg. Referential opacity in nondeterministic data refinement. ACM LoPLaS, 2(1--4):233--241, 1993.
Structured Specifications and Implementation of.. - Walicki, Broy (1995) (1 citation) (Correct)
No context found.
X. Qian, A. Goldberg. Referential Opacity in Nondeterministic Data Refinement. ACM LoPLaS,vol. 2, no. 1-4: 233-241, (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