1
Complexicity in analysing programs for termination | |
Author | Tan, Christine Uy |
Call Number | AIT RSPR no. CS-87-3 |
Subject(s) | Programming (Electronic computers)--Ability testing |
Note | A research study submitted in partial fulfillment of the requirements for the degree of Master of Science, School of Engineering and Technology |
Publisher | Asian Institute of Technology |
Abstract | Termination of programs is an important concern in programming. This research studies three methods for proving the termination of computer programs • The test case approach, loop approach, and exit approach are analyzed on the basis of their effectiveness in deciding termination and the complexity of applying the methods on programs having sequence, selection and iteration control structures. |
Year | 1987 |
Type | Research Study Project Report (RSPR) |
School | School of Engineering and Technology (SET) |
Department | Other Field of Studies (No Department) |
Academic Program/FoS | Computer Science (CS) |
Chairperson(s) | Venkatachalam, P.A. |
Examination Committee(s) | Huynh Ngoc Phien ;Vilas Wuwongse |
Scholarship Donor(s) | Government of Japan |
Degree | Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987 |