Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover

Amjad, Hasan

doi:10.1007/10930755_11

Cited by 16 publications

(17 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The closest work in approach to our own is that of Joyce and Seger [12] , Gordon [10,11] and later Amjad [9] .…”

Section: Combination Of Model Checking Algorithms and Theorem Proversmentioning

confidence: 99%

“…Amjad [9] demonstrated how the BDD-based symbolic model checking algorithms for the propositional µ-calculus (L µ ) can be embedded in the HOL theorem prover. This approach allows results returned from the model checker to be treated as theorems in HOL.…”

Section: Combination Of Model Checking Algorithms and Theorem Proversmentioning

confidence: 99%

“…The first is a formal logic representation using data type definitions [9,10] , while the latter is a graphical representation using trees and graphs [28,29] . The choice between the two approaches depends on the formalization objectives [30] .…”

Section: Multiway Decision Graphsmentioning

confidence: 99%

See 2 more Smart Citations

An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs

Abed

Mohamed

Al-Sammane

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

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 first-order 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.

show abstract

“…The closest work in approach to our own is that of Joyce and Seger [12] , Gordon [10,11] and later Amjad [9] .…”

Section: Combination Of Model Checking Algorithms and Theorem Proversmentioning

confidence: 99%

Section: Combination Of Model Checking Algorithms and Theorem Proversmentioning

confidence: 99%

See 1 more Smart Citation

An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs

Abed

Mohamed

Al-Sammane

2009

J. Comput. Sci. Technol.

View full text Add to dashboard Cite

show abstract

“…The condition first tests the atomic proposition StoB REQ, and if true moves to state 1 (which as we see is represented in HOL as [4]). The conditional theorem at this leaf reflects this transition.…”

Section: Compiling the Formal Semanticsmentioning

confidence: 99%

“…Hasan Amjad has built a symbolic model checker for OBE properties that uses BDD representation judgements applied to our semantics to calculate the truthvalue of PSL properties with respect to Kripke structures. This is described elsewhere [4].…”

Section: Introductionmentioning

confidence: 99%

Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving

Gordon

Hurd

Slind

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The Accellera Property Specification Language (PSL) is designed for the formal specification of hardware. The Reference Manual contains a formal semantics, which we previously encoded in a machine readable version of higher order logic. In this paper we describe how to 'execute' the formal semantics using proof scripts coded in the HOL theorem prover's metalanguage ML. The goal is to see if it is feasible to implement useful tools that work directly from the official semantics by mechanised proof. Such tools will have a high assurance of conforming to the standard. We have implemented two experimental tools: an interpreter that evaluates whether a finite trace w, which may be generated by a simulator, satisfies a PSL formula f (i.e. w |= f ), and a compiler that converts PSL formulas to checkers in an intermediate format suitable for translation to HDL for inclusion in simulation test-benches. Although our tools use logical deduction and are thus slower than hand-crafted implementations, they may be speedy enough for some applications. They can also provide a reference for more efficient implementations.

show abstract

Shallow Lazy Proofs

Amjad

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Programming a Symbolic Model Checker in a Fully Expansive Theorem Prover

Cited by 16 publications

References 18 publications

An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs

An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs

Executing the Formal Semantics of the Accellera Property Specification Language by Mechanised Theorem Proving

Shallow Lazy Proofs

Contact Info

Product

Resources

About