Results 1  10
of
22
Observational logic
 IN ALGEBRAIC METHODOLOGY AND SOFTWARE TECHNOLOGY (AMAST'98
, 1999
"... We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required ..."
Abstract

Cited by 52 (10 self)
 Add to MetaCart
We present an institution of observational logic suited for statebased systems specifications. The institution is based on the notion of an observational signature (which incorporates the declaration of a distinguished set of observers) and on observational algebras whose operations are required to be compatible with the indistinguishability relation determined by the given observers. In particular, we introduce a homomorphism concept for observational algebras which adequately expresses observational relationships between algebras. Then we consider a flexible notion of observational signature morphism which guarantees the satisfaction condition of institutions w.r.t. observational satisfaction of arbitrary firstorder sentences. From the proof theoretical point of view we construct a sound and complete proof system for the observational consequence relation. Then we consider structured observational specifications and we provide a sound and complete proof system for such specifications by using a general, institutionindependent result of [6].
Behavioural Theories and The Proof of Behavioural Properties
, 1996
"... Behavioural theories are a generalization of firstorder theories where the equality predicate symbol is interpreted by a behavioural equality of objects (and not by their identity). In this paper we first consider arbitrary behavioural equalities determined by some (partial) congruence relation and ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
Behavioural theories are a generalization of firstorder theories where the equality predicate symbol is interpreted by a behavioural equality of objects (and not by their identity). In this paper we first consider arbitrary behavioural equalities determined by some (partial) congruence relation and we show how to reduce the behavioural theory of any class of algebras to (a subset of) the standard theory of some corresponding class of algebras. This reduction is the basis of a method for proving behavioural theorems whenever an axiomatization of the behavioural equality is provided. Then we focus on the important special case of (partial) observational equalities where two elements are observationally equal if they cannot be distinguished by observable computations over some set of input values. We provide general conditions under which an obvious infinite axiomatization of the observational equality can be replaced by a finitary one and we provide methodological guidelines for finding such...
Observational Proofs with Critical Contexts
 In Fundamental Approaches to Software Engineering
, 1998
"... Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker [10]. We propose in this paper to embed Context Induction in the implicit induction framework of [8]. The ..."
Abstract

Cited by 24 (3 self)
 Add to MetaCart
Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the concept of Context Induction has been developed by Hennicker [10]. We propose in this paper to embed Context Induction in the implicit induction framework of [8]. The proof system we obtain applies to conditional specifications. It allows for many rewriting techniques and for the refutation of false observational conjectures. Under reasonable assumptions our method is refutationally complete, i.e. it can refute any conjecture which is not observationally valid. Moreover this proof system is operational: it has been implemented within the Spike prover and interesting computer experiments are reported.
Coalgebra semantics for hidden algebra: parameterized objects and inheritance
 the 12th Workshop on Algebraic Development Techniques
, 1998
"... Abstract. The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to provide a semantic foundation for the object paradigm. This paper focuses on the coalgebraic aspect of hidden algebra, concerned with signatures of destructors at the syntactic level and wi ..."
Abstract

Cited by 19 (0 self)
 Add to MetaCart
Abstract. The theory of hidden algebras combines standard algebraic techniques with coalgebraic techniques to provide a semantic foundation for the object paradigm. This paper focuses on the coalgebraic aspect of hidden algebra, concerned with signatures of destructors at the syntactic level and with finality and coffee constructions at the semantic level. Our main result shows the existence of cofree constructions induced by maps between coalgebraic hidden specifications. Their use in giving a semantics to parameterised objects and inheritance is then illustrated. The cofreeness result for hidden algebra is generalised to abstract coalgebra and a universal construction for building object systems over existing subsystems is obtained. Finally, existence of final/cofree constructions for arbitrary hidden specifications is discussed. 1
Inductive Theorem Proving for Design Specifications
 J. Symbolic Computation
, 1997
"... We present a number of new results on inductive theorem proving for design specifications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the specification. We show how the automatic support for program verification is enhanced i ..."
Abstract

Cited by 12 (9 self)
 Add to MetaCart
We present a number of new results on inductive theorem proving for design specifications based on Horn logic with equality. Induction is explicit here because induction orderings are supposed to be part of the specification. We show how the automatic support for program verification is enhanced if the specification satisfies a bunch of rewrite properties, summarized under the notion of canonicity. The enhancement is due to inference rules and corresponding strategies whose soundness is implied by the specification's canonicity. The second main result of the paper provides a method for proving canonicity by using the same rules, which are applied in proofs of conjectures about the specification and the functionallogic programs it contains. Contents 1 Introduction 2 1.1 Expander . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.2 Proof by term rewriting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
A Hidden Herbrand Theorem: Combining the Object and Logic Paradigms
 Principles of Declarative Programming
, 1998
"... : The benefits of the object, logic (or relational), functional, and constraint paradigms ..."
Abstract

Cited by 11 (3 self)
 Add to MetaCart
: The benefits of the object, logic (or relational), functional, and constraint paradigms
Interconnection of Object Specifications
 Formal Methods and Object Technology
, 1996
"... ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, and ap ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
ing yet further from reality, we might proscribe the simultaneous effect of two or more methods on an object's state; doing so, we impose a monoid structure on the fixed set of methods proper to an object class. Applying methods one after the other corresponds to multiplication in the monoid, and applying no methods corresponds to the identity of the monoid. A monoid is a set M with an associative binary operation ffl M : M \ThetaM ! M , usually referred to as `multiplication', which has an identity element e M 2 M . If M = (M; ffl M ; e M ) is a monoid, we often write just M for M, and e for e M ; moreover for m;m 0 2 M , we usually write mm 0 instead of m ffl M m 0 . For example, A , the set of lists containing elements of A, together with concatenation ++ : A \ThetaA ! A and the empty list [ ] 2 A , is a monoid. This example is especially important for the material in later sections. A monoid homomorphism is a structure preserving map between the carriers of ...
Modular Swinging Types
, 1999
"... . Swinging types [18] provide an integrated framework for specifying software on the basis of manysorted logic in terms of "static" functions and relations as well as "dynamic" transition systems. Swinging types combine equational, Horn and modal logic for the purpose of using evaluation and pr ..."
Abstract

Cited by 8 (8 self)
 Add to MetaCart
. Swinging types [18] provide an integrated framework for specifying software on the basis of manysorted logic in terms of "static" functions and relations as well as "dynamic" transition systems. Swinging types combine equational, Horn and modal logic for the purpose of using evaluation and proof rules from all three logics for rapid prototyping and verification. A swinging specification separates from each other visible sorts that denote domains of data identified by their structure; hidden sorts that denote domains of data identified by their behavior in response to observers; predicates (least relations) that represent inductive (ly provable) properties; and predicates (greatest relations) that represent complementary "coinductive" properties. The paper at hand deals with structured specifications with swinging components. Vertical structuring is supported by a deductionoriented refinement criterion that admits, for instance, to implement visible sorts by hidden s...
ObjectOriented Hybrid Systems of Coalgebras plus Monoid Actions
 Algebraic Methodology and Software Technology (AMAST
, 1996
"... . Hybrid systems combine discrete and continuous dynamics. We introduce a semantics for such systems consisting of a coalgebra together with a monoid action. The coalgebra captures the (discrete) operations on a state space that can be used by a client (like in the semantics of ordinary (nontempora ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
. Hybrid systems combine discrete and continuous dynamics. We introduce a semantics for such systems consisting of a coalgebra together with a monoid action. The coalgebra captures the (discrete) operations on a state space that can be used by a client (like in the semantics of ordinary (nontemporal) objectoriented systems). The monoid action captures the influence of time on the state space, where the monoids that we consider are the natural numbers monoid (N; 0; +) of discrete time, and the positive reals monoid (R0 ; 0; +) of real time. Based on this semantics we develop a hybrid specification formalism with timed method applications: it involves expressions like s:meth@ff, with the following meaning: in state s let the state evolve for ff units of time (according to the monoid action), and then apply the (coalgebraic) method meth. In this formalism we specify various (elementary) hybrid systems, investigate their correctness, and display their behaviour in simulations. We furthe...
Action Refinement  An Application of Process Theory on ObjectOriented Specification
, 1995
"... In hierarchical system design, refinement allows to incrementally increase the level of detail in the system description. Several notions of refinement have been investigated in process theory and in objectoriented frameworks. From a process algebraic viewpoint, an object as the basic unit of st ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In hierarchical system design, refinement allows to incrementally increase the level of detail in the system description. Several notions of refinement have been investigated in process theory and in objectoriented frameworks. From a process algebraic viewpoint, an object as the basic unit of structure and control can be understood as a process. Then action reification  the replacement of actions by transactions in objectoriented specification  corresponds to action refinement in process algebra where actions are replaced by process terms. Questions of distributed control, synchronisation, and serialisability translate naturally from the objectoriented framework into process theory and vice versa. In both frameworks, correctness critera exist which prevent the use of refinements if they would cause serious problems in synchronisation and distributed control. We compare an objectoriented and a process algebraic approach for action refinement, both based on an event structure semantics. We show how restrictions ensuring correct refinement known from the process algebraic framework can be applied in the objectoriented approach. Moreover, results from process theory on the preservation of system properties under refinement now become accessible for verification in the objectoriented setting. All concepts are illustrated by a small case study.