Forskning ved Københavns Universitet - Københavns Universitet

Forside

A MuDDy Experience-ML Bindings to a BDD Library

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

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).
OriginalsprogEngelsk
TitelDomain-Specific Languages, IFIP TC 2 Working Conference, DSL 2009
RedaktørerWalid Mohamed Taha
Antal sider12
Vol/bind5658
ForlagSpringer
Publikationsdato2009
Sider45-57
ISBN (Trykt)978-3-642-03033-8
DOI
StatusUdgivet - 2009
BegivenhedDomain-Specific Languages, IFIP TC 2 Working Conference - Oxford, Storbritannien
Varighed: 15 jul. 200917 jul. 2009

Konference

KonferenceDomain-Specific Languages, IFIP TC 2 Working Conference
LandStorbritannien
ByOxford
Periode15/07/200917/07/2009
NavnLecture notes in computer science
Vol/bind5658

ID: 19345434