01743nas|a2200241 i 450000500170000000800410001703500150005810000270007324500720010026000520017230000100022449000510023450001520028550200830043752006070052065000350112770000470116270000470120970000480125671000490130481000830135385600650143620260817162302.0241198s1987    th  uzm rtt  00|  a1eng d  a.b100802351 aPabelico, Rafael Ramos10aAnalysis of a few methods on correctness based on program structure  aBangkok :bAsian Institute of Technology,c1987  a78 p.1 aResearch studies project report ;vno. CS-87-6  aA research study summitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology  aResearch Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987  aVerification 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. 0aComputer programsxCorrectness1 aVenkatachalam, Paruvachi A., eChairperson0 aKanchit Malaivongs,eExamination Committee1 aSadananda, Ramakoti,eExamination Committee2 aGovernment of Australia, eScholarship Donor2 aAsian Institute of Technology.tResearch studies project report ;vno. CS-87-6  3Full-Textuhttp://203.159.5.9/ait-thesis/detail.php?q=B18969