| Author | Pabelico, Rafael Ramos |
| Call Number | AIT RSPR no. CS-87-6 |
| Subject(s) | Computer programs--Correctness
|
| Note | A research study summitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology |
| Publisher | Asian Institute of Technology |
| Abstract | Verification and testing techniques have been discussed and
compared in the past from the viewpoint of their effectiveness in
determining program correctness. This paper analyzes and compares
a testing method, a formal verification method and symbolic
execution based on the structures of the programs to which they
are applied. It is shown that the program structures affect the
complexity of these methods. Also, improvements and aids to these
methods are also presented. The time complexities of these
methods were estimated based on some tree models into which
programs can be transformed. |
| 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, Paruvachi A. |
| Examination Committee(s) | Kanchit Malaivongs ;Sadananda, Ramakoti
|
| Scholarship Donor(s) | Government of Australia |
| Degree | Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987 |