Partial non-underflow and non-overflow of an arithmetic stack
Dave Goodwin · The Computer Journal · 1980
This paper continues analysis of the model of arithmetic stack behaviour set up in Goodwin (1977). There conditions computable at high level language compile time were given under which run time stack overflow or underflow could not occur. Because the conditions are strict, it is worth considering the question ‘Is it possible for no overflow nor underflow to occur, even if the conditions do not apply?’ A number of results are presented here, including an algorithm for finding the smallest stack size, if any, which permits an infinity of different program runs to take place.