Skip to content
ilyasergey edited this page Mar 11, 2012 · 12 revisions

This is the Github project page for a experimental implementation of k-CFA and Pushdown k-CFA with optional Abstract Garbage Collection for a subset of Scheme programming language. The analysis is developed by as a systematic abstraction of a small-step CESK semantics for extended lambda-calculus in A-normal form.

Two different abstractions are supported: traditional polyvariant k-CFA with store-allocated continuations and a CFA2-model, based on the introspective pushdowns system.

All of this is the topic of an ICFP 2012 submission titled "Introspective Pushdown Analysis of Higher-order Programs".

Examples

For example programs look at the folder benchmarks of the project.

License

The sources are released under CRAPL license (see http://matt.might.net/articles/crapl/).

If you have questions or concerns about the CRAPL, or you need more information about this license, please contact Prof. Matthew Might (http://matt.might.net/).

Clone this wiki locally