zkincaid / duet

Duet: static analysis for unbounded concurrency
http://duet.cs.toronto.edu
MIT License
23 stars 16 forks source link

Almost commuting #15

Closed ahumenberger closed 4 years ago

ahumenberger commented 4 years ago

As a first step I implemented the naive abstraction algorithm which explores all partitions of the LTS (see PhasedSegmentation.make_naive).

Since I'm not familiar with best practices in OCaml, I don't know if it makes sense to wrap the functions in almostCommuting.mli in modules, or if this is an overkill.