A MuDDy Experience–ML Bindings to a BDD Library
Binary Decision Diagrams (BDDs) are a data structure used to efficiently represent boolean expressions on canonical form. BDDs are often the core data structure in model checkers. MuDDy is an ML interface (both for Standard ML and Objective Caml) to the BDD package BuDDy that is written in C. This combination of an ML interface to a high-performance C library is surprisingly fruitful. ML allows you to quickly experiment with high-level symbolic algorithms before handing over the grunt work to the C library. I show how, with a relatively little effort, you can make a domain specific language for concurrent finite state-machines embedded in Standard ML and then write various custom model-checking algorithms for this domain specific embedded language (DSEL).
KeywordsModel Check Reachable State Boolean Expression Symbolic Execution Binary Decision Diagram
- 4.Andersen, H.R.: An introduction to binary decision diagrams (1997), http://www.itu.dk/people/hra/bdd97-abstract.html
- 7.Day, N.A., Launchbury, J., Lewis, J.: Logical abstractions in Haskell. In: Proceedings of the 1999 Haskell Workshop, Utrecht University Department of Computer Science, Technical Report UU-CS-1999-28 (October 1999)Google Scholar
- 11.Syme, D., Granicz, A., Cisternino, A.: Expert F#. Apress (2007)Google Scholar