Results 11  20
of
69
Prelogical Relations
, 1999
"... this paper but which have some intriguing connections to some of our results and techniques, are [32] and [20]. We believe that the concept of prelogical relation would have a beneficial impact on the presentation and understanding of their results ..."
Abstract

Cited by 26 (5 self)
 Add to MetaCart
this paper but which have some intriguing connections to some of our results and techniques, are [32] and [20]. We believe that the concept of prelogical relation would have a beneficial impact on the presentation and understanding of their results
On Behavioural Abstraction and Behavioural Satisfaction in HigherOrder Logic
, 1996
"... The behavioural semantics of specifications with higherorder logical formulae as axioms is analyzed. A characterization of behavioural abstraction via behavioural satisfaction of formulae in which the equality symbol is interpreted as indistinguishability, which is due to Reichel and was recently g ..."
Abstract

Cited by 25 (5 self)
 Add to MetaCart
(Show Context)
The behavioural semantics of specifications with higherorder logical formulae as axioms is analyzed. A characterization of behavioural abstraction via behavioural satisfaction of formulae in which the equality symbol is interpreted as indistinguishability, which is due to Reichel and was recently generalized to the case of firstorder logic by Bidoit et al, is further generalized to this case. The fact that higherorder logic is powerful enough to express the indistinguishability relation is used to characterize behavioural satisfaction in terms of ordinary satisfaction, and to develop new methods for reasoning about specifications under behavioural semantics. 1 Introduction An important ingredient in the use of algebraic specifications to describe data abstractions is the concept of behavioural equivalence between algebras, which seems to appropriately capture the "black box" character of data abstractions, see e.g. [GGM76], [GM82], [ST87] and [ST95]. Roughly speaking (since there ...
Proving the correctness of algebraically specified software modularity and observability issues
 In Proc. of AMAST2, Second Conference of Algebraic Methodology and Software Technology
, 1991
"... We investigate how far modularity and observability issues can contribute to a better understanding of software correctness. We detail the impact of modularity on the semantics of algebraic specifications and we show that, with the stratified loose semantics, software correctness can be established ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
(Show Context)
We investigate how far modularity and observability issues can contribute to a better understanding of software correctness. We detail the impact of modularity on the semantics of algebraic specifications and we show that, with the stratified loose semantics, software correctness can be established on a module per module basis. We discuss observability issues and we introduce an observational semantics where sort observation is refined by specifying that some operations do not allow observations. Then the stratified loose approach and our observational semantics are integrated together. As a result, we obtain a framework (modular observational specifications) where the definition of software correctness is adequate, i.e. fits with actual software correctness. 1
A Complete Calculus for the Multialgebraic and Functional Semantics of Nondeterminism
, 1995
"... : The current algebraic models for nondeterminism focus on the notion of possibility rather than necessity, and con sequently equate (nondeterministic) terms that one intuitively would not consider equal. Furthermore, existing models for nondeterminism depart radically from the standard models for ( ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
: The current algebraic models for nondeterminism focus on the notion of possibility rather than necessity, and con sequently equate (nondeterministic) terms that one intuitively would not consider equal. Furthermore, existing models for nondeterminism depart radically from the standard models for (equational) specifications of deterministic operators. One would prefer that a specification language for nondeterministic operators be based on an extension of the standard model concepts, preferably in such a way that the reasoning system for (possibly nondeterministic) operators becomes the standard equational one whenever restricted to the deterministic operators  the objective should be to minimize the departure from the standard frameworks. In this paper we define a specification language for nondeterministic operators and multialgebraic semantics. The first complete reasoning system for such specifications is introduced. We also define a transformation of specifications of nondeterm...
Extended ML: Past, present and future
 PROC. 7TH WORKSHOP ON SPECIFICATION OF ABSTRACT DATA TYPES, WUSTERHAUSEN. SPRINGER LNCS 534
, 1991
"... An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development. ..."
Abstract

Cited by 23 (9 self)
 Add to MetaCart
An overview of past, present and future work on the Extended ML formal program development framework is given, with emphasis on two topics of current active research: the semantics of the Extended ML specification language, and tools to support formal program development.
On the integration of observability and reachability concepts
 Foundations of Software Science and Computation Structures, LNCS
, 2002
"... 2 Institut f"ur Informatik, LudwigMaximiliansUniversit"at M"unchen, Germany ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
2 Institut f&quot;ur Informatik, LudwigMaximiliansUniversit&quot;at M&quot;unchen, Germany
Proving Behavioural Theorems with Standard FirstOrder Logic
 In Proc. of ALP'94
, 1994
"... . Behavioural logic is a generalization of firstorder logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general su#cient conditions under which the behavioural validity of some firstorder formula with respect ..."
Abstract

Cited by 17 (5 self)
 Add to MetaCart
(Show Context)
. Behavioural logic is a generalization of firstorder logic where the equality predicate is interpreted by a behavioural equality of objects (and not by their identity). We establish simple and general su#cient conditions under which the behavioural validity of some firstorder formula with respect to a given firstorder specification is equivalent to the standard validity of the same formula in a suitably enriched specification. As a consequence any proof system for firstorder logic can be used to prove the behavioural validity of firstorder formulas. 1 Introduction Observability plays a prominent role in formal software development, since it provides a suitable basis for defining adequate correctness concepts. For instance, for proving the correctness of a program with respect to a given specification, many examples show that it is essential to abstract from internal implementation details and to rely only on the observable behaviour of the program. A similar situation is the not...
On the Duality between Observability and Reachability
 PROC. 4TH INT. CONF. FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS'01
, 2001
"... Observability and reachability are important concepts in formal software development. While observability concepts allow to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper ..."
Abstract

Cited by 12 (5 self)
 Add to MetaCart
Observability and reachability are important concepts in formal software development. While observability concepts allow to specify the required observable behavior of a program or system, reachability concepts are used to describe the underlying data in terms of datatype constructors. In this paper, we show that there is a duality between observability and reachability, both from a methodological and from a formal point of view. In particular, we establish a correspondence between observer operations and datatype constructors, observational algebras and constructorbased algebras, and observational and inductive properties of specifications. Our study is based on the observational logic institution [11] and on a novel treatment of reachability which introduces the constructorbased logic institution. Both institutions are tailored to capture the semantically correct realizations of a specification from the observational and reachability points of view. The duality between the observability and reachability concepts is then formalized in a categorytheoretic setting.
Structuring Specifications intheLarge and intheSmall: HigherOrder Functions, Dependent Types and Inheritance in SPECTRAL
 PROC. COLLOQ. ON COMBINING PARADIGMS FOR SOFTWARE DEVELOPMENT, JOINT CONF. ON THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT (TAPSOFT
"... ..."
The BehaviorRealization Adjunction and Generalized Homomorphic Relations
 COMP. SCI
, 1996
"... A model theory for proving correctness of abstract data types is developed within the framework of the behaviorrealization adjunction. To allow for incomplete specifications, proofofcorrectness ... ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
A model theory for proving correctness of abstract data types is developed within the framework of the behaviorrealization adjunction. To allow for incomplete specifications, proofofcorrectness ...