Observational Logic

Hennicker, Rolf; Bidoit, Michel

doi:10.1007/3-540-49253-4_20

Cited by 55 publications

(58 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The most important are hidden logic by Goguen and Malcolm [19], and observational logic by Bidoit and Hennicker [2,22]. There is also another observational logic due to Padawitz [33], called swinging types logic, but it is similar to the observational logic of Bidoit et al (see http:// ls5-www.cs.uni-dortmund.de/ ∼ peter/Swinging.html for more details).…”

Section: Conclusion and Related Workmentioning

confidence: 93%

Closure properties for the class of behavioral models

Martins

2007

Theoretical Computer Science

View full text Add to dashboard Cite

Hidden k-logics can be considered as the underlying logics of program specification. They constitute natural generalizations of k-deductive systems and encompass deductive systems as well as hidden equational logics and inequational logics. In our abstract algebraic approach, the data structures are sorted algebras endowed with a designated subset of their visible parts, called filter, which represents a set of truth values.We present a hierarchy of classes of hidden k-logics. The hidden k-logics in each class are characterized by three different kinds of conditions, namely, properties of their Leibniz operators, closure properties of the class of their behavioral models, and properties of their equivalence systems. Using equivalence systems, we obtain a new and more complete analysis of the axiomatization of the behavioral models. This is achieved by means of the Leibniz operator and its combinatorial properties.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 93%

Closure properties for the class of behavioral models

Martins

2007

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The most relevant to the topic of this paper are the variations developed by Goguen et al (hidden logics [24,25]) and by Bidoit and Hennicker (observational logics [28,3]). These approaches formalize behavioral validity (correctness) as follows: hidden logic is a variant of the equational logic in which some part of the specification is visible and another is hidden.…”

Section: Introductionmentioning

confidence: 99%

Behavioral equivalence of hidden k-logics: An abstract algebraic approach

Babenyshev¹,

Martins²

2016

Journal of Applied Logic

View full text Add to dashboard Cite

This work advances a research agenda which has as its main aim the application of Abstract Algebraic Logic (AAL) methods and tools to the specification and verification of software systems. It uses a generalization of the notion of an abstract deductive system to handle multi-sorted deductive systems which differentiate visible and hidden sorts. Two main results of the paper are obtained by generalizing properties of the Leibniz congruencethe central notion in AAL.In this paper we discuss a question we posed in [2] about the relationship between the behavioral equivalences of equivalent hidden logics. We also present a necessary and sufficient intrinsic condition for two hidden logics to be equivalent.

show abstract

“…These are institutions for which the satisfaction relation is 'stratified' (or parameterized in other words) by 'states of models'. These 'states of models' may be explicit valuations of variables (like in FOL), or implicit possible worlds (like in MPL), or combination of both (like in first order modal logic), or behavioral context (like in hidden algebra [8,12,13,16]), or something else. We show how we can extract canonically an institution out of a 'stratified' institution.…”

Section: Introductionmentioning

confidence: 99%