In this paper, we exploit advanced automata-based algorithms and propose several non-trivial improvements of the framework. To alleviate the complementation ...
Abstract. In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The analysis starts with a ter-.
In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The analysis starts with a termination proof of a sample path.
Bibliographic details on Advanced automata-based algorithms for program termination checking.
In this paper, we exploit advanced automata-based algorithms and propose several non-trivial improvements of the framework. To alleviate the complementation ...
Duration: 16:43
Posted: Jul 15, 2018
Posted: Jul 15, 2018
In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The analysis starts with a termination proof of a sample path.
In 2014, Heizmann et al. proposed a novel framework for program termination analysis. The analysis starts with a termination proof of a sample path.
Advanced automata-based algorithms for program termination checking. YF Chen, M Heizmann, O Lengál, Y Li, MH Tsai, A Turrini, L Zhang. Proceedings of the 39th ...
Advanced Automata-Based Algorithms for Program Termination Checking. In ACM SIGPLAN NOTICES Vol. 53 (pp. 135-150). doi:10.1145/3192366.3192405. DOI: 10.1145 ...