Results 1  10
of
11
RFC 3066: Tags for the identification of languages (replaces
, 1766
"... The language µCharts is one of many Statechartlike languages, a family of visual languages that are used for designing reactive systems. We introduce a logic for reasoning about and constructing refinements for µcharts. The logic itself is interesting and important because it allows reasoning abo ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The language µCharts is one of many Statechartlike languages, a family of visual languages that are used for designing reactive systems. We introduce a logic for reasoning about and constructing refinements for µcharts. The logic itself is interesting and important because it allows reasoning about µcharts in terms of partial relations rather than the more traditional traces approach. The method of derivation of the logic is also worthy of report. A Zbased model for the language µCharts is constructed and the existing logic and refinement calculus of Z is used as the basis for the logic of µCharts. As well as describing the logic we introduce some of the ways such a logic can be specifications into concrete realisations of reactive systems. A refinement theory for Statechartlike languages is an important contribution because it allows us to formally investigate and reason about properties of the object language µCharts. In particular, we can conjecture and
A Logic for SchemaBased Program Development
, 2002
"... We show how a theory of specification refinement and program development can be constructed as a conservative extension of our existing logic for Z. The resulting system can be set up as a development method for Z, or as a generalisation of a refinement calculus (with a novel semantics). In addition ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We show how a theory of specification refinement and program development can be constructed as a conservative extension of our existing logic for Z. The resulting system can be set up as a development method for Z, or as a generalisation of a refinement calculus (with a novel semantics). In addition to the technical development we illustrate how the theory can be used in practice. 1.
Six theories of operation refinement for partial relation semantics Moshe Deutsch
, 2002
"... In this paper we analyse total correctness operation refinement on a partial relation semantics for specification. In particular we show that three theories: a relational completion approach, a prooftheoretic approach and a functional models approach, are all equivalent. This result holds whether or ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
In this paper we analyse total correctness operation refinement on a partial relation semantics for specification. In particular we show that three theories: a relational completion approach, a prooftheoretic approach and a functional models approach, are all equivalent. This result holds whether or not preconditions are taken to be minimal or fixed conditions for establishing the postcondition. Keyword: Specification Language; Specification Logic; Refinement; 1
A Deep Embedding of Z_C in Isabelle/HOL
, 2001
"... This report describes a deep embedding of the logic ZC [HR00] in Isabelle /HOL. The development is based on a general theory of de Bruijn terms. Wellformed terms, propositions and judgements are represented as inductive sets. The embedding is used to prove elementary properties of ZC such as uniquen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This report describes a deep embedding of the logic ZC [HR00] in Isabelle /HOL. The development is based on a general theory of de Bruijn terms. Wellformed terms, propositions and judgements are represented as inductive sets. The embedding is used to prove elementary properties of ZC such as uniqueness of types, type inhabitation and that elements of judgements are wellformed propositions 1 De Bruijn Terms The representation of logical syntax in Isabelle/HOL will be based on a polymorphic datatype dbterm of de Bruijn terms. This development follows the example of A. Gordon [Gor94] who constructed a similar theory for the HOL system. The datatype dbterm is independent of ZC and can be used as a foundation for deep embeddings in general. For other HOL representations of terms see [Owe95] and [Von95].
µCharts and Z: hows, whys and wherefores
 in W. Grieskamp, T. Santen & B. Stoddart, eds, ‘Integrated Formal Methods 2000: Proceedings of the 2nd
, 2000
"... . In this paper we show, by a series of examples, how the  chart formalism can be translated into Z. We give reasons for why this an interesting and sensible thing to do and what it might be used for. 1 Introduction In this paper we show, by a series of examples, how the chart formalism (as gi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
. In this paper we show, by a series of examples, how the  chart formalism can be translated into Z. We give reasons for why this an interesting and sensible thing to do and what it might be used for. 1 Introduction In this paper we show, by a series of examples, how the chart formalism (as given in [9]) can be translated into Z. We also discuss why this is a useful and interesting thing to do and give some examples of work that might be done in the future in this area which combines Z and charts. It might seem obvious that we should simply express the denotational semantics given in [9] directly in Z and then do our proofs. After all, the semantics is given in set theory and so Z would be adequate for the task. However, our aim is to produce versions of charts that are recognisably Z models, i.e. using the usual state and operation schema constructs and some schema calculus in natural wayschart states and transitions appear as Z state and operation schemas respectively...
Logic and Refinement for Charts
"... We introduce a logic for reasoning about and constructing refinements for \muCharts, a rational simplification and reconstruction of Statecharts. The method of derivation of the logic is that a semantics for the language is constructed in Z and the existing logic and refinement calculus of Z is the ..."
Abstract
 Add to MetaCart
We introduce a logic for reasoning about and constructing refinements for \muCharts, a rational simplification and reconstruction of Statecharts. The method of derivation of the logic is that a semantics for the language is constructed in Z and the existing logic and refinement calculus of Z is then used to induce the logic and refinement calculus of \muCharts, proceeding by a series of definitions and conservative extensions and hence generating a sound logic for \muCharts, given that the soundness of the Z logic has already been established.
Firing Conditions
, 2003
"... In this note, we revise the preconditions as \ ring conditions" approach to operation re nement and data re nement for Z. 1 ..."
Abstract
 Add to MetaCart
In this note, we revise the preconditions as \ ring conditions" approach to operation re nement and data re nement for Z. 1
Using Formal Models to Design User Interfaces A Case Study
"... The use of formal models for user interface design can provide a number of benefits. It can help to ensure consistency across designs for multiple platforms, prove properties such as reachability and completeness and, perhaps most importantly, can help incorporate the user interface design process i ..."
Abstract
 Add to MetaCart
The use of formal models for user interface design can provide a number of benefits. It can help to ensure consistency across designs for multiple platforms, prove properties such as reachability and completeness and, perhaps most importantly, can help incorporate the user interface design process into a larger, formallybased, software development process. Often, descriptions of such models and examples are presented in isolation from realworld practice in order to focus on particular benefits, small focused examples or the general methodology. This paper presents a case study of developing the user interface to a new software application using a particular pair of formal models, presentation models and presentation interaction models. The aim of this study was to practically apply the use of formal models to the design process of a UI for a new software application. We wanted to determine how easy it would be to integrate such models into our usual development process and to find out what the benefits, and difficulties, of using such models were. We will show how we used the formal models within a usercentred design process, discuss what effect they had on this process and explain what benefits we perceived from their use.
Two Semantic Embeddings of Z Schemas in Isabelle/HOL
, 2001
"... This report investigates two semantic embeddings of Z schemas in Isabelle/HOL. The first represents Z values as elements of a type class with polymorphic type constructors and overloaded operators. In contrast, the second embedding uses a Z universe: all Z values are represented as elements of a sin ..."
Abstract
 Add to MetaCart
This report investigates two semantic embeddings of Z schemas in Isabelle/HOL. The first represents Z values as elements of a type class with polymorphic type constructors and overloaded operators. In contrast, the second embedding uses a Z universe: all Z values are represented as elements of a single monomorphic HOL type.
on A Calculus for Schemas in Z
"... The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas. We describe these schemas and illustrate their various common uses in Z. We also present a collection of logical laws for manipulating these schemas. These laws are capable of supporting reasoning ab ..."
Abstract
 Add to MetaCart
The popularity and flexibility of the Z notation can largely be attributed to its notion of schemas. We describe these schemas and illustrate their various common uses in Z. We also present a collection of logical laws for manipulating these schemas. These laws are capable of supporting reasoning about the Z schema calculus in its full generality. This is demonstrated by presenting some theorems about the removability of schemas from Z specifications, together with outline proofs. We survey briefly models against which this logical system may be proven sound, and other related logics for Z. c ○ 1999 Academic Press 1.