Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comput Sci Technol

Search In Journal Title:

Abbravation: Journal of Computer Science and Technology

Search In Journal Abbravation:

Publisher

Springer US

Search In Publisher:

DOI

10.1016/0020-7403(74)90090-3

Search In DOI:

ISSN

1860-4749

Search In ISSN:
Search In Title Of Papers:

An Abstract Reachability Approach by Combining HOL

Authors: Sa’ed Abed Otmane Ait Mohamed Ghiath AlSammane
Publish Date: 2009/03/01
Volume: 24, Issue: 1, Pages: 76-95
PDF Link

Abstract

In this paper we provide a necessary infrastructure to define an abstract state exploration in the HOL theorem prover Our infrastructure is based on a deep embedding of the Multiway Decision Graphs MDGs theory in HOL MDGs generalize Reduced Ordered Binary Decision Diagrams ROBDDs to represent and manipulate a subset of firstorder logic formulae The MDGs embedding is based on the logical formulation of an MDG as Directed Formulae DF Then the MDGs operations are defined and the correctness proof of each operation is provided The MDG reachability algorithm is then defined as a conversion that uses our MDG theory within HOL Finally a set of experimentations over benchmark circuits has been conducted to ensure the applicability and to measure the performance of our approach


Keywords:

References


.
Search In Abstract Of Papers:
Other Papers In This Journal:


Search Result: