Rolf Hennicker and Michel Bidoit. Observational logic. In A. M. Haeberer, editor, Algebraic Methodology and Software Technology, number 1584 in LNCS, pages 263-277. Springer, 1999. Proc. AMAST'99.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....if it is hidden; those with visible arguments and hidden result are called hidden constants. Behavioral operations are used in experiments to distinguish states; i.e. they define behavioral equivalence. Note that our models do not require all operations to be congruent (see Definition 5) as in [15, 18], since non congruent operations are needed for applications like length for lists implemented as sets, and the push operation in Example 2. Example 3 gives a spec equivalent to that in Example 1, with in as its only behavioral operation, thus illustrating the need for (P2) Our models also ....

....for a specification to be behavioral equivalent to another with fewer behavioral operations. The first definition of operations congruent over behavioral equivalence defined by a subset of operations seems to have been [1] similar ideas 5 also appear in [18, 19, 21] and in [6, 5] as well as in [15], which use the term behavioral coherence. We prefer the term congruent because the congruence rule of equational deduction is sound in hidden logic for an operation iff that operation is behaviorally congruent. Definition 5. An operation oe is Gamma behaviorally congruent for A iff oe is ....

[Article contains additional citation context not shown here]

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

....of t, say , is of special importance, then we may view the evaluation of t in two steps, as A t : A (A (var(t)f g) A) with the obvious meaning. 2. 2 Behavioral Speci cation and Satisfaction We generalize the hidden algebra of [9, 11, 19] to include variants such as observational logic [1, 3, 14] and coherent hidden algebra [6, 7] See [19] for a detailed presentation of variants, history, many other concepts, and proofs for some results mentioned here. Two important variants of behavioral logic are the xed data and the loose data, depending on whether or not the data universe is xed ....

R. Hennicker and M. Bidoit. Observational logic. In Proceedings, AMAST'98, volume 1548 of LNCS, pages 263-277. Springer, 1999.

.... and behavioral operations in 1992 by Bernot, Bidoit and Knapik [1] and non congruent operations in 1998 by Diaconescu [5] Defining operations congruent over behavioral equivalence by a subset of operations seems to have first occurred in [1] Similar ideas appear in [20,21,24] as well as [6,5,17], which use the term behavioral coherence, but we prefer the term congruent because the congruence rule of equational deduction is sound in behavioral logic for an operation iff that operation is behaviorally congruent. All these ideas were previously integrated in [24] while [14] gives some ....

....All these ideas were previously integrated in [24] while [14] gives some new examples, institutions, and results relating hidden algebra to information hiding. Hidden algebra models have a fixed subalgebra of data values, as distinct from the observational logic of Bidoit and Hennicker ([1,2,17], etc. and the semantics of CafeOBJ [6] This seems desirable because real applications use standard booleans and integers rather than arbitrary models of some theory; nevertheless, all results of this paper hold for the fully loose semantics, and there are applications where this is useful, ....

[Article contains additional citation context not shown here]

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

....have di#erent sets of observers for the same sort. The family of set theoretical equalities is always compatible, but it is easy to check that the family of observational equalities is not compatible in general. One may restrict the introduction of new observers to avoid this problem, see e.g. BH99] 3 Formal Testing from Algebraic Specifications Testing from algebraic specifications boils down to checking if axioms are satisfied by programs [Gau95] Oracles are usually active procedures which drive the necessary tests and interpret the results. Test cases are extracted from ....

M. Bidoit and R. Hennicker. Observational logic. Proc. AMAST'98, Manaus. Springer LNCS 1548, 263--277 (1999).

....(attributes observe states by returning visible values, while methods modify states) the visible subalgebra is a fixed algebra of data values. Hidden logic refers to close relatives of hidden algebra, including loose data logics like coherent hidden algebra [5] and observational logic [1, 13], and the original fixed data approach of hidden algebra [11] All our inference rules are sound for loose data logics, but fixed data logics are still needed for many applications; e.g. the alternating bit protocol can t be proved if 0,1 can be identified. Many more details of hidden logic ....

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

....formally. Behavioral abstraction is another development in algebraic speci cation which appears under various names in the literature such as hidden algebra in works by Goguen, Diaconescu and many others [17, 19, 23, 22, 42, 26] observational logic in works by Hennicker, Bidoit and many others [29, 7, 4, 3], coherent hidden algebra in Diaconescu [13] hidden logic in Ro su [39] and so on. Most of these approaches appeared as a need to extend algebraic speci cations to ease the process of specifying and verifying designs of systems and also for various other reasons, such as, to naturally handle in ....

R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263-277. Springer, 1999.

....thus greatly extending expressive power. Behavioral logic is a diverse research area containing many approaches, including the original hidden algebra of [9] and subsequent improvements in [14,19,18] the coherent hidden algebra of Diaconescu [6,7] the observational logic of Bidoit and Hennicker [1,2,24], and a new generalization of hidden algebra that tries to treat all these variants in a uniform way [35,21] These approaches fall into two broad categories, depending on whether or not a fixed data algebra is assumed for all models. All proof rules in use are sound for all these logics, but all ....

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil, Jan. 1999.

....This work was partially supported by the ESPRIT Working Group 29432 CoFI,bytheBayer. Forschungsstiftung, and by the German DFG project InopSys. Preliminary results of this study have been published in [9] and preliminary results about the observational logic institution have been published in [18]. 1 Introduction An important role in software specification and program development is played by observability and reachability concepts which deal with di#erent aspects of software systems. While observational approaches focus on the observable properties of a system, reachability notions are ....

....see, e.g. 34] Thereby two elements are considered to be observationally equal if they cannot be distinguished by a set of observable experiments. In this work we will follow the second approach. A flexible framework to formalize observable experiments is suggested (in a similar way) e.g. in [18], 16] and [32] where the operations of an algebraic signature are split into a set of observer operations for building observable experiments and the other operations which can be used, for instance, to manipulate (non visible) states of a system. In this study we will use the observational ....

[Article contains additional citation context not shown here]

R. Hennicker and M. Bidoit. Observational logic. In Armando Haeberer, editor, Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil, volume 1548 of LNCS, pages 263--277. Springer, 1999.

....This work was partially supported by the ESPRIT Working Group 29432 CoFI, by the Bayer. Forschungsstiftung, and by the German DFG project InopSys. Preliminary results of this study have been published in [9] and preliminary results about the observational logic institution have been published in [18]. Email addresses: bidoit lsv.ens cachan.fr (Michel Bidoit) hennicke informatik.uni muenchen.de (Rolf Hennicker) Alexander.Kurz cwi.nl (Alexander Kurz) Preprint submitted to Elsevier Science 19 September 2002 1 Introduction An important role in software speci cation and program ....

....see, e.g. 34] Thereby two elements are considered to be observationally equal if they cannot be distinguished by a set of observable experiments. In this work we will follow the second approach. A exible framework to formalize observable experiments is suggested (in a similar way) e.g. in [18], 16] and [32] where the operations of an algebraic signature are split into a set of observer operations for building observable experiments and the other operations which can be used, for instance, to manipulate (non visible) states of a system. In this study we will use the observational ....

[Article contains additional citation context not shown here]

R. Hennicker and M. Bidoit. Observational logic. In Armando Haeberer, editor, Proc. 7th Int. Conf. Algebraic Methodology and Software Technology (AMAST'98), Amazonia, Brazil, volume 1548 of LNCS, pages 263-277. Springer, 1999.

.... language [1] Observability concepts are used to specify the desired observable properties of a program or software system (see, e.g. 17, 18, 15, 16, 7] Particular institutions which formalize the syntactic and semantic aspects of observability were introduced in [9] hidden algebra) and in [10] (observational logic) In [4] we have shown that by dualization of observational logic one obtains a novel treatment of reachability, called the constructor based logic institution. Both frameworks capture, either from the observability or from the reachability point of view, the idea that the ....

....observable experiments which can be applied to examine states. Then two states are observationally equal if they cannot be distinguished by these experiments. If there is no constructor symbol, this intuitive idea can easily be formalized as done in the observational logic framework, see [10]. However, if we integrate observability and reachability concepts, we have to be careful with respect to the role of constructors in observable experiments. For instance, in the container example, the observable context isin(z container ; x) represents a set of observable experiments on ....

[Article contains additional citation context not shown here]

R. Hennicker and M. Bidoit. Observational logic. In Proc. AMAST'98, LNCS 1548, pages 263-277. Springer, 1999.

....point of view. In particular, we establish a correspondence between observer operations and data type constructors, observational algebras and constructor based algebras, and observational and inductive properties of specifications. Our study is based on the observational logic institution [7] and on a novel treatment of reachability which introduces the institution of constructor based logic. The duality between both concepts is formalised in a category theoretic setting. 1 Introduction An important role in software specification and program development is played by observability ....

....it is a model of SP. Based on these assumptions we will study algebraic frameworks for observability and for reachability which are appropriate to compare both concepts. In more detail we obtain the following results: First, in Section 2, we give an overview of the observational logic institution [7] which we will use as the basis for formalising observability. Then, in Section 3, we discuss reachability and we introduce a new institution, called constructor based logic, to express reachability issues in accordance with the above working hypothesis. For this purpose we introduce, in ....

[Article contains additional citation context not shown here]

R. Hennicker and M. Bidoit. Observational logic. In Armando Haeberer, editor, Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of LNCS. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In A. M. Haeberer, editor, Algebraic Methodology and Software Technology, number 1584 in LNCS, pages 263-277. Springer, 1999. Proc. AMAST'99.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Algebraic Methodology and Software Technology, volume 1548 of Lecture Notes in Computer Science, pages 263--277, 1999.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263--277. Springer, 1999.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263--277. Springer, 1999.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Algebraic Methodology and Software Technology, volume 1548 of Lecture Notes in Computer Science, pages 263--277, 1999.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Proceedings, AMAST'98, volume 1548 of LNCS, pages 263--277. Springer, 1999.

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263--277. Springer, 1999. 27

No context found.

R. Hennicker and M. Bidoit. Observational logic. In Proceedings of AMAST'98, volume 1548 of LNCS, pages 263--277. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263-277. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and Software Technology (AMAST'98), volume 1548 of Lecture Notes in Computer Science, pages 263--277. Springer, 1999.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In A. M. Haeberer, editor, Algebraic Methodology and Software Technology, number 1584 in LNCS, pages 263{ 277. Springer, 1999. Proc. AMAST'99.

No context found.

Rolf Hennicker and Michel Bidoit. Observational logic. In Algebraic Methodology and SoftwareTechnology #AMAST'98#,volume 1548 of Lecture Notes in Computer Science, pages 263#277. Springer, 1999.

First 50 documents

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