opam-version: "2.0"
maintainer: "Damien Pous <Damien.Pous@ens-lyon.fr>"
homepage: "http://perso.ens-lyon.fr/damien.pous/safa/"
license: "LGPL-3.0-only"
build: [make]
install: [make "install"]
remove: [make "uninstall"]
depends: [
  "ocaml" {>= "4.02.0"}
  "ocamlfind" {build}
  "ocamlbuild" {build}
]
synopsis: "Symbolic Algorithms for Finite Automata"
description: """
This OCaml library contains symbolic algorithms for checking language
equivalence or inclusion of automata with a large alphabet, using
symbolic representations (BDDs).

It is described in the following paper, in Proc. POPL'15
http://doi.acm.org/10.1145/2676726.2677007
https://hal.archives-ouvertes.fr/hal-01021497v2/document

This library can be used to obtain symbolic algorithms for Kleene
algebra with tests (KAT), see library [symkat]"""
authors: "Damien Pous <Damien.Pous@ens-lyon.fr>"
url {
  src: "http://perso.ens-lyon.fr/damien.pous/safa/safa-1.3.tgz"
  checksum: "md5=95a3998f980822be429c56f49fd3fad6"
}
