Results 1 
9 of
9
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.
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 15 (5 self)
 Add to MetaCart
. 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...
Observational Proofs by Rewriting
 J. Automated Reasoning
, 1995
"... Observational concepts are fundamental in formal methods since for proving the correctness of a program with respect to a specification it is essential to be able to abstract away from internal implementation details. Data objects can be viewed as equal if they cannot be distinguished by experiments ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Observational concepts are fundamental in formal methods since for proving the correctness of a program with respect to a specification it is essential to be able to abstract away from internal implementation details. Data objects can be viewed as equal if they cannot be distinguished by experiments with
Towards automated proofs of observational properties
 Discrete Mathematics in Theoretical Computer Science
, 2004
"... Observational theories are a generalization of firstorder theories where two objects are observationally equal if they cannot be distinguished by experiments with observable results. Such experiments, called contexts, are usually infinite. Therefore, we consider a special finite set of contexts, ca ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Observational theories are a generalization of firstorder theories where two objects are observationally equal if they cannot be distinguished by experiments with observable results. Such experiments, called contexts, are usually infinite. Therefore, we consider a special finite set of contexts, called covercontexts, “covering” all the observable contexts. Then, we show that to prove that two objects are observationally equal, it is sufficient to prove that they are equal (in the classical sense) under these covercontexts. We give methods based on rewriting techniques, for constructing such covercontexts for interesting classes of observational specifications.
Proving the Correctness of Formal User Interface Specifications
 IN PROCEEDINGS OF 2 ND EUROGRAPHICS WORKSHOP ON DESIGN, SPECIFICATION, VERIFICATION OF INTERACTIVE SYSTEMS DSVIS’95 (CHÂTEAU DE BONAS
, 1995
"... Formal grammars, task action grammars and attribute grammars are widely accepted approaches for the specification of dialogues of interactive systems. In this paper we present a formal specification technique  based on attribute grammars  coupling dialogue specifications with application and layou ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Formal grammars, task action grammars and attribute grammars are widely accepted approaches for the specification of dialogues of interactive systems. In this paper we present a formal specification technique  based on attribute grammars  coupling dialogue specifications with application and layout specifications. For this specification formalism a proof principle and an analyzing technique is provided and applied to a user interface specification of an ISDN telephone. Properties can be shown between the interaction of a user and the behaviour of the system. The used specification technique allows e.g. to show that there are dialogues such that a special action can be performed, e.g. a menuitem can be selected and e.g. that the application has a special state after a distinguished action.
Observational Proofs by Implicit Context Induction
, 1997
"... Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the powerful concept of Context Induction has been developed by Hennicker [Hen91]. We propose in this paper to embed Context Induction in the implicit induction framework ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Observability concepts contribute to a better understanding of software correctness. In order to prove observational properties, the powerful concept of Context Induction has been developed by Hennicker [Hen91]. We propose in this paper to embed Context Induction in the implicit induction framework of [BR95]. The proof system we obtain applies to conditional specifications. It allows for many rewriting techniques and for the refutation of false conjectures. Under reasonable assumptions it is refutationally complete. Moreover this proof system is operational: it has been implemented within the Spike prover and interesting computer experiments are reported.
Algebraic System Specification and Development: Survey and Annotated Bibliography  Second Edition 
, 1997
"... Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . ..."
Abstract
 Add to MetaCart
Data Types . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.5.4 Special Approaches . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50 4.6 Semantics of Programming Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.1 Semantics of Ada . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.6.2 Action Semantics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 52 4.7 Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.1 Early Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . . 53 4.7.2 Recent Algebraic Specification Languages . . . . . . . . . . . . . . . . . . . . . . . 55 4.7.3 The Common Framework Initiative. . . . . . . . . . . . . . . . . . . . . . . . . . . 56 5 Methodology 57 5.1 Development Phases . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57 5.1.1 Applica...