Results 1 
5 of
5
A Structure Preserving Encoding of Z in Isabelle/HOL
 Theorem Proving in HigherOrder Logics, LNCS 1125
, 1996
"... . We present a semantic representation of the core concepts of the specification language Z in higherorder logic. Although it is a "shallow embedding" like the one presented by Bowen and Gordon, our representation preserves the structure of a Z specification and avoids expanding Z sch ..."
Abstract

Cited by 34 (7 self)
 Add to MetaCart
. We present a semantic representation of the core concepts of the specification language Z in higherorder logic. Although it is a "shallow embedding" like the one presented by Bowen and Gordon, our representation preserves the structure of a Z specification and avoids expanding Z schemas. The representation is implemented in the higherorder logic instance of the generic theorem prover Isabelle. Its parser can convert the concrete syntax of Z schemas into their semantic representation and thus spare users from having to deal with the representation explicitly. Our representation essentially conforms with the latest draft of the Z standard and may give both a clearer understanding of Z schemas and inspire the development of proof calculi for Z. 1 Introduction Implementations of proof support for Z [Spi 92, Nic 95] can roughly be divided into two categories. In direct implementations, the rules of the logic are directly represented by functions of the prover's implementation...
Declarative Reflection and its Application as a Pattern Language
, 2001
"... The paper presents the reection facilities of the specification language Slamsl. Slamsl is an object oriented specification language where class methods are specified by pre and postconditions. The reflection capabilities permit managing these pre and postconditions in specifications what means th ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
The paper presents the reection facilities of the specification language Slamsl. Slamsl is an object oriented specification language where class methods are specified by pre and postconditions. The reflection capabilities permit managing these pre and postconditions in specifications what means that semantic reflection is possible. The range of interesting applications is very wide: formal specification of interfaces and abstract classes, specification of component based software, formalization of design pattern, using Slamsl as a pattern language, etc. The paper discusses the last two advantages in some detail.
A Tactic Language for Ergo
 Formal Methods Pacific ’97
, 1997
"... A new version of the Ergo theorem prover is under development. It uses a single tactic language, based on Angel, for tactic programming, user interface, and proof representation. This paper describes the language as it is used in each of these cases, and explains the details of its implementation ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
A new version of the Ergo theorem prover is under development. It uses a single tactic language, based on Angel, for tactic programming, user interface, and proof representation. This paper describes the language as it is used in each of these cases, and explains the details of its implementation in QuProlog. An example from classical propositional calculus is included. 1 Introduction Ergo is an interactive proof tool that has been designed and implemented at the SVRC over the last ten years. It is implemented in QuProlog (Robinson and Hagen, 1997), and is designed to be extensible, so that users can add new theories, tactics and user interfaces. Ergo 5 is currently under development. Having no inbuilt object logic, it is a generic prover that can be instantiated by providing a collection of axiomatic and/or definitional theories. The core of Ergo 5 provides support for (uninterpreted) sequents with named tuples of arbitrary terms as antecedents and single terms as consequents...
Logical Frameworks as a Basis for Verification Tools: A Case Study
, 1995
"... Widespread acceptance and use of formal methods in software development hinges on the availability of powerful tools. Tools must be both reliable and offer real assistance to the user. Logical frameworks are a suitable medium to build such tools, since they provide a means to show the faithfulness ..."
Abstract
 Add to MetaCart
Widespread acceptance and use of formal methods in software development hinges on the availability of powerful tools. Tools must be both reliable and offer real assistance to the user. Logical frameworks are a suitable medium to build such tools, since they provide a means to show the faithfulness and adequacy of the implementation, and at the same time provide the flexibility needed to build sufficiently automated tools. We present ZinIsabelle, a deep semantic embedding of the specification language Z and a deductive system for Z in the generic theorem prover Isabelle. Z is based on ZermeloFraenkel set theory and firstorder predicate logic, extended by a notion of schemas. Isabelle supports a fragment of higherorder predicate logic, in which object logics such as Z can be encoded as theories. We illustrate the use of ZinIsabelle with a data refinement proof. We assess to what extent such proofs need to and can be automated to make implementations in logical frameworks such as ...
Towards a Structure Preserving Encoding of Z in HOL
, 1986
"... We present a semantic representation of the core concepts of the specification language Z in higherorder logic. Although it is a "shallow embedding" like the one presented by Bowen and Gordon, our representation preserves the structure of a Z specification and avoids expanding Z schemas. ..."
Abstract
 Add to MetaCart
We present a semantic representation of the core concepts of the specification language Z in higherorder logic. Although it is a "shallow embedding" like the one presented by Bowen and Gordon, our representation preserves the structure of a Z specification and avoids expanding Z schemas. The representation is implemented in the higherorder logic instance of the generic theorem prover Isabelle. Its powerful parsing and prettyprinting mechanisms can convert the concrete syntax of Z schemas into their semantic representation behind the scenes. Our representation essentially conforms with the latest draft of the Z standard and may give both a clearer understanding of Z schemas and inspire the development of proof calculi for Z. 1 Introduction Implementations of proof support for Z [Spi92b, Nic95] can roughly be divided into two categories. In direct implementations, the rules of the logic are directly represented by functions of the prover's implementation language. These implementat...