$IDE^{al}$ is a generic and efficient data-flow framework for Java. $IDE^{al}$ can be instantiated for various data-flow problems, e.g., typestate analysis for the detection of misuses of application programming interfaces (API), linear constant propagation or mining of API uses. For more details see our OOPSLA2017 publication.
We recently re-designed and re-implemented based on Synchronized Pushdown Systems (SPDS). SPDS are an efficient replace for $k$-limited access paths or access graphs. $IDE^{al}$ originally relied on access graphs.
The implementation based on SPDS is found here.
https://github.com/CROSSINGTUD/WPDS
The implementation based on access graphs is found here:
