Results 1 
6 of
6
Hierarchical Verification Using an MDGHOL Hybrid Tool
"... We describe a hybrid formal hardware verification tool that links the HOL interactive proof system and the MDG automated hardware verification tool. It supports a hierarchical verification approach that mirrors the hierarchical structure of designs. We obtain advantages of both verification paradi ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We describe a hybrid formal hardware verification tool that links the HOL interactive proof system and the MDG automated hardware verification tool. It supports a hierarchical verification approach that mirrors the hierarchical structure of designs. We obtain advantages of both verification paradigms. We illustrate its use by considering a component of a communications chip. Verification with the hybrid tool is significantly faster and more tractable than using either tool alone.
Proving Existential Theorems when Importing Results from MDG to HOL
 TPHOLS 2001 SUPPLEMENTAL PROCEEDINGS, INFORMATIC RESEARCH REPORT EDIINFRR0046
, 2001
"... An existential theorem, for the specification or implementation of hardware, states that for any inputs there must exist at least one output which is consistent with it. It is proved to prevent an inconsistent model being produced and it is required to formally import the verification result from on ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
An existential theorem, for the specification or implementation of hardware, states that for any inputs there must exist at least one output which is consistent with it. It is proved to prevent an inconsistent model being produced and it is required to formally import the verification result from one verification system to another system. In this paper
Embedding and Verification of an MDGHDL Translator in HOL
"... We investigate the verification of a translation phase of the Multiway Decision Graphs (MDG) verification system using the Higher Order Logic (HOL) theorem prover. In this paper, we deeply embed the semantics of a subset of the MDGHDL language and its Table subset into HOL. We define a set of funct ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We investigate the verification of a translation phase of the Multiway Decision Graphs (MDG) verification system using the Higher Order Logic (HOL) theorem prover. In this paper, we deeply embed the semantics of a subset of the MDGHDL language and its Table subset into HOL. We define a set of functions which translate this subset MDGHDL language to its Table subset. A correctness theorem for this translator, which quantifies over its syntactic structure, has been proved. This theorem states that the semantics of the MDGHDL program is equivalent to the semantics of its Table subset.
Providing a Formal Linkage between MDG and HOL
, 2002
"... We describe an approach for formally verifying the linkage between a symbolic state enumeration system and a theorem proving system. This involves the following three stages of proof. Firstly we prove theorems about the correctness of the translation part of the symbolic state system. It interface ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
We describe an approach for formally verifying the linkage between a symbolic state enumeration system and a theorem proving system. This involves the following three stages of proof. Firstly we prove theorems about the correctness of the translation part of the symbolic state system. It interfaces between low level decision diagrams and high level description languages. We ensure that the semantics of a program is preserved in those of its translated form. Secondly we prove linkage theorems: theorems that justify introducing a result from a state enumeration system into a proof system. Finally we combine the translator correctness and linkage theorems. The resulting new linkage theorems convert results to a high level language from the low level decision diagrams that the result was actually proved about in the state enumeration system.They justify importing lowlevel external verification results into a theorem prover. We use a linkage between the HOL system and a simplified version of the MDG system to illustrate the ideas and consider a small example that integrates two applications from MDG and HOL to illustrate the linkage theorems.
HOLMDG: A Hybrid Tool for Formal Verification
, 2000
"... . We describe a hardware verification tool called HOLMDG. This tool combines the HOL theorem prover with an automated verification package, namely MDG. The aim of such a combination is to bring together the strength of theorem proving and the automation of MDG. Moreover, the presented hybrid tool o ..."
Abstract
 Add to MetaCart
. We describe a hardware verification tool called HOLMDG. This tool combines the HOL theorem prover with an automated verification package, namely MDG. The aim of such a combination is to bring together the strength of theorem proving and the automation of MDG. Moreover, the presented hybrid tool offers facilities for a hierarchical verification approach. 1. Introduction Formal verification methods fall in one of three categories: theorem proving, decision diagrams based methods and symbolic simulation. In this work, we focus on combining the first two categories. In theorem proving methods, the design's behavior as well as its structure are described in some formal logic. Then the design structure is proved to conform to the expected behavior using a set of axioms and inference rules. Theorem provers generally provide very powerful reasoning and abstraction mechanisms. This makes it possible to deal with complex designs. Nevertheless, theorem provers require a deep understanding of...
Formally Linking MDG and HOL Based on a Verified MDG System
"... We describe an approach for formally linking a symbolic state enumeration system and a theorem proving system based on a veri ed version of the former. It has been realized using a simpli ed version of the MDG system and the HOL system. Firstly, we have veri ed aspects of correctness of a simp ..."
Abstract
 Add to MetaCart
We describe an approach for formally linking a symbolic state enumeration system and a theorem proving system based on a veri ed version of the former. It has been realized using a simpli ed version of the MDG system and the HOL system. Firstly, we have veri ed aspects of correctness of a simpli ed version of the MDG system. We have made certain that the semantics of a program is preserved in those of its translated form. Secondly, we have provided a formal linkage between the MDG system and the HOL system based on importing theorems. The MDG veri cation results can be formally imported into HOL to form a HOL theorem. Thirdly, we have combined the translator correctness theorems and importing theorems. This allows the MDG veri cation results to be imported in terms of a high level language (MDGHDL) rather than a low level language. We also summarize a general method to prove existential theorems for the design. The feasibility of this approach is demonstrated in a case study that integrates two applications: hardware veri cation (in MDG) and usability veri cation (in HOL). A single HOL theorem is proved that integrates the two results.