Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6874839 | Journal of Logical and Algebraic Methods in Programming | 2018 | 45 Pages |
Abstract
The condition under which a computation terminates, and the question of whether a computation terminates for a given initial state, have been the focus of much interest since the early days of computing. In this paper we argue that it is advantageous to study the property of termination in conjunction with the property of abort-freedom, i.e. the property of a program to execute without raising exceptional conditions; also, we model the two properties in a single mathematical framework, and illustrate how this integrated framework gives a better outcome than the separate analysis of the two aspects.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Nafi Diallo, Wided Ghardallou, Jules Desharnais, Ali Mili,