1 code implementation • 12 Sep 2020 • Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur
We prove that our technique is optimal (i. e., it results in minimum memory footprint) for Bourdoncle's iteration strategy while computing the same result.
Programming Languages
2 code implementations • 12 Sep 2019 • Sung Kook Kim, Arnaud J. Venet, Aditya V. Thakur
The de facto approach for computing the approximation of this fixpoint uses a sequential algorithm based on weak topological order (WTO).
Programming Languages
