Abstract
We here extend our earlier work on the theory of partially defined computer instructions and guards to cover partially defined computer expressions and programs. The notion of the relevant region of an expression is generalized to conditional relevant regions, and we specify upper bounds on these for expressions built up from simpler ones. We then proceed to specify upper bounds on the input and output regions of programs containing goto statements, even though the state transformations of such programs are not necessarily computable. This is then combined with our earlier commutativity results to obtain a general condition under which two simple sections of such a program commute with each other, and therefore may be interchanged, or possibly done in parallel.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
