<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Analysis of a few methods on correctness based on program structure</title>
  </titleInfo>
  <name type="personal">
    <namePart>Pabelico, Rafael Ramos</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Venkatachalam, Paruvachi A.</namePart>
    <role>
      <roleTerm type="text">Chairperson</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Kanchit Malaivongs</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="personal">
    <namePart>Sadananda, Ramakoti</namePart>
    <role>
      <roleTerm type="text">Examination Committee</roleTerm>
    </role>
  </name>
  <name type="corporate">
    <namePart>Government of Australia</namePart>
    <role>
      <roleTerm type="text">Scholarship Donor</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <genre authority="marc">series</genre>
  <genre authority="marc">technical report</genre>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">th</placeTerm>
    </place>
    <place>
      <placeTerm type="text">Bangkok</placeTerm>
    </place>
    <publisher>Asian Institute of Technology</publisher>
    <dateIssued>1987</dateIssued>
    <issuance>continuing</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>78 p.</extent>
  </physicalDescription>
  <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.</abstract>
  <note>A research study summitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology</note>
  <note>Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987</note>
  <subject authority="lcsh">
    <topic>Computer programs</topic>
    <topic>Correctness</topic>
  </subject>
  <relatedItem type="series">
    <titleInfo>
      <title>Research studies project report ; no. CS-87-6</title>
    </titleInfo>
    <name type="corporate">
      <namePart>Asian Institute of Technology.</namePart>
      <namePart/>
    </name>
  </relatedItem>
  <identifier type="uri">http://203.159.5.9/ait-thesis/detail.php?q=B18969</identifier>
  <location>
    <url displayLabel="Full-Text">http://203.159.5.9/ait-thesis/detail.php?q=B18969</url>
  </location>
  <recordInfo>
    <recordCreationDate encoding="marc">241198</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260817162302.0</recordChangeDate>
  </recordInfo>
</mods>
