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

@article{Abed2009AnAR,
  title={An Abstract Reachability Approach by Combining HOL Induction and Multiway Decision Graphs},
  author={Sa'ed Abed and Otmane A{\"i}t Mohamed and Ghiath Al Sammane},
  journal={Journal of Computer Science and Technology},
  year={2009},
  volume={24},
  pages={76-95}
}
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… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 38 REFERENCES

Verification of BDD Normalization

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

An introduction to requirements capture using PVS: Specification of a simple autopilot

R W.Butler
  • Technical report,
  • 1996
VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

Programming combinations of deduction and BDD-based symbolic calculation

J C.GordonM
  • LMS Journal of Computation and Mathematics,
  • 2002
VIEW 6 EXCERPTS
HIGHLY INFLUENTIAL

Formal verification of iterative algorithms in microprocessors

M Aagaard, R BJones, R Kaivola, K RKohatsu, C H.Seger
  • In Proc. the 37th Conference on Design Automation (DCA’00),
  • 2000
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL