-
Notifications
You must be signed in to change notification settings - Fork 1.1k
/
opam
32 lines (30 loc) · 1.05 KB
/
opam
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
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.4.tgz"
checksum: [
"sha256=bcc544e40ae573019fb240d4d819bf779318f0747968fd3c7b9995b327ad082c"
"md5=0b656277d7c80c04db7b0de26ef24244"
]
}