shivers-cfg: Implementation of Shivers' Control-Flow Analysis
In his 1991 dissertation, Olin Shivers introduces a concept of control flow graphs for functional languages, provides an algorithm to statically derive a safe approximation of the control flow graph and proves this algorithm correct. In our student research project, Shivers' algorithms and proofs are formalized using the theorem prover system Isabelle.
This package contains the Haskell prototype of the Isabelle formalization, together with some pretty printing and rendering facilities. It is provided as a reference, not as a ready-to-use library.
|Versions [RSS]||0.1, 0.1.1|
|Dependencies||base (>=4 && <5), containers, directory, HPDF, language-dot, mtl, pretty, process [details]|
|Uploaded||by JoachimBreitner at 2015-09-08T11:05:29Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||1556 total (1 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2015-09-30 [all 1 reports]