From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.9 required=5.0 tests=BAYES_00,FREEMAIL_FROM autolearn=unavailable autolearn_force=no version=3.4.4 X-Received: by 10.66.190.36 with SMTP id gn4mr18266843pac.17.1428438953673; Tue, 07 Apr 2015 13:35:53 -0700 (PDT) X-Received: by 10.140.27.130 with SMTP id 2mr294356qgx.6.1428438953625; Tue, 07 Apr 2015 13:35:53 -0700 (PDT) Path: border1.nntp.dca1.giganews.com!nntp.giganews.com!l13no2212028iga.0!news-out.google.com!k20ni30qgd.0!nntp.google.com!z60no209502qgd.0!postnews.google.com!glegroupsg2000goo.googlegroups.com!not-for-mail Newsgroups: comp.lang.ada Date: Tue, 7 Apr 2015 13:35:53 -0700 (PDT) Complaints-To: groups-abuse@google.com Injection-Info: glegroupsg2000goo.googlegroups.com; posting-host=87.91.37.131; posting-account=hya6vwoAAADTA0O27Aq3u6Su3lQKpSMz NNTP-Posting-Host: 87.91.37.131 User-Agent: G2/1.0 MIME-Version: 1.0 Message-ID: <44b2e375-8993-4a7e-b81a-6a7b512d2e3e@googlegroups.com> Subject: BDD package in Ada. From: Vincent DIEMUNSCH Injection-Date: Tue, 07 Apr 2015 20:35:53 +0000 Content-Type: text/plain; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Xref: number.nntp.giganews.com comp.lang.ada:192761 Date: 2015-04-07T13:35:53-07:00 List-Id: Hello everybody, Binary Decisions Diagram [1] is a key technology in computer science, for t= he verification of software and hardware designs. Donald Knuth calls BDDs = "one of the only really fundamental data structures that came out in the la= st twenty-five years" and mentions that Bryant's 1986 paper was for some ti= me one of the most-cited papers in computer science. There are many BDD libraries in C/C++, there are libraries in Lisp, Python,= Java, Lua, OCaml, Prolog... all available on the Internet [2], but I could= n't find one in Ada. I am pretty sure that there must be excellent BDD libr= aries in Ada used in the Defense Industry, but it seems that no one is publ= ic. So I hesitate between developping a binding to an existing C library, and t= hus having access to the best and fastest implementations, or developping o= ne myself, but the result might be less efficient, although easier to use f= rom Ada and more portable. Any piece of advice to give me ? Would some of you be interested in using i= t ? In contributing to the development as an Open Source ?=20 Regards, Vincent Diemunsch [1] - http://en.wikipedia.org/wiki/Binary_decision_diagram [2] - https://github.com/johnyf/tool_lists/blob/master/bdd.md