Results 1 
5 of
5
Inductive datatypes in HOL  lessons learned in FormalLogic Engineering
 Theorem Proving in Higher Order Logics: TPHOLs ’99, LNCS 1690
, 1999
"... Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and most other implementations, Isabelle/HOL datatypes may be mutually and indirect recursive, even infinitely branching. We also su ..."
Abstract

Cited by 50 (7 self)
 Add to MetaCart
(Show Context)
Isabelle/HOL has recently acquired new versions of definitional packages for inductive datatypes and primitive recursive functions. In contrast to its predecessors and most other implementations, Isabelle/HOL datatypes may be mutually and indirect recursive, even infinitely branching. We also support inverted datatype definitions for characterizing existing types as being inductive ones later. All our constructions are fully definitional according to established HOL tradition. Stepping back from the logical details, we also see this work as a typical example of what could be called "FormalLogic Engineering". We observe that building realistic theorem proving environments involves further issues rather than pure logic only. 1
Faithful mapping of model classes to mathematical structures’, Int. Workshop Specification and Verification of ComponentBased Systems
, 2007
"... Abstraction techniques are indispensable for the specification and verification of the functional behavior of programs. In objectoriented specification languages like JML, a powerful abstraction technique is the use of model classes, that is, classes that are only used for specification purposes an ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
(Show Context)
Abstraction techniques are indispensable for the specification and verification of the functional behavior of programs. In objectoriented specification languages like JML, a powerful abstraction technique is the use of model classes, that is, classes that are only used for specification purposes and that provide objectoriented interfaces for essential mathematical concepts such as sets or relations. While the use of model classes in specifications is natural and powerful, they pose problems for verification. Program verifiers map model classes to their underlying logics. Flaws in a model class or the mapping can easily lead to unsoundness and incompleteness. This article proposes an approach for the faithful mapping of model classes to mathematical structures provided by the theorem prover of the program verifier at hand. Faithfulness means that a given model class semantically corresponds to the mathematical structure it is mapped to. Our approach enables reasoning about programs specified in terms of model classes. It also helps in writing consistent and complete modelclass specifications as well as in identifying and checking redundant specifications. 1
From I/O Automata to Timed I/O Automata  A solution to the `Generalized Railroad Crossing' in Isabelle/HOLCF
"... The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about realtime systems. A number of case studies using timed I/O automata has been carried out, among them a treatment of the socalled Generalized Railroad Crossing (GRC). An already e ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
The model of timed I/O automata represents an extension of the model of I/O automata with the aim of reasoning about realtime systems. A number of case studies using timed I/O automata has been carried out, among them a treatment of the socalled Generalized Railroad Crossing (GRC). An already existing formalization of the metatheory of I/O automata within Isabelle/HOLCF allows for fully formal toolsupported verication using I/O automata. We present a modication of this formalization which accomodates for reasoning about timed I/O automata. The guiding principle in choosing the parts of the metatheory of timed I/O automata to formalize has been to provide all the theory necessary for formalizing the solution to the GRC. This leads to a formalization of the GRC, in which not only the correctness proof itself has been formalized, but also the underlying metatheory of timed I/O automata, on which the correctness proof is based.
A Complete Formalization of the `Generalized Railroad Crossing' with Timed I/O Automata in Isabelle/HOLCF
"... The Generalized Railroad Crossing (GRC) has been designed as a benchmark for the comparison of formal methods for the specification and verification of realtime systems. One of the solutions to the GRC is based on the LynchVaandrager timed automaton model, parts of which have subsequently been for ..."
Abstract
 Add to MetaCart
The Generalized Railroad Crossing (GRC) has been designed as a benchmark for the comparison of formal methods for the specification and verification of realtime systems. One of the solutions to the GRC is based on the LynchVaandrager timed automaton model, parts of which have subsequently been formalized by Archer and Heitmeyer using PVS. We present a more extensive formalization of the GRC in Isabelle/HOLCF. The distinguishing feature of our formalization is its completeness in the sense that not only the correctness proof itself has been formalized, but also the underlying metatheory of timed I/O automata, on which the correctness proof is based. Large parts of this formalization were created by `upgrading' the necessary parts of an existing formalization of untimed I/O automata in Isabelle/HOLCF.