Elsevier

Information Processing Letters

Volume 21, Issue 5, 18 November 1985, Pages 233-238
Information Processing Letters

The unwind property for programs with bounded memory

https://doi.org/10.1016/0020-0190(85)90090-0Get rights and content

Abstract

For programs that can access unbounded memory (e.g., flowchart programs with recursion on simple variable parameters), the ‘unwind property’ is equivalent to the ‘truth-table property’. For programs restricted to bounded memory (e.g., flowchart programs with parameterless recursion), the two properties are not equivalent in general. We recapitulate all known results, give new results, and establish conditions under which the two properties are equivalent for program with bounded memory.

References (14)

There are more references available in the full text version of this article.
View full text