An Extension of the Direct Method for Verifying Programs
| dc.contributor.author | Kang, Andy N. C. | en |
| dc.contributor.author | Wang, Shih-Ho | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2013-06-19T14:37:12Z | en |
| dc.date.available | 2013-06-19T14:37:12Z | en |
| dc.date.issued | 1975 | en |
| dc.description.abstract | A direct method based on a finite set of path formulas which describe the input-output relations of a given program can be used to verify programs containing no overlapping loops. One major difficulty in verifying programs with overlapping loops using the above method is that too many path formulas (possibly infinite) needed to be considered. In this paper, we circumvent the above difficulty by applying the concept of modularity. The idea is to divide a program with overlapping loops into several small modules so that each module contains no overlapping loop. This can always be achieved if the program is in structured form. Then the path formulas will be derived for each module. By combining the path formulas for the modules, one can further obtain the path formulas for the given program and then use them to verify the program. | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier | http://eprints.cs.vt.edu/archive/00000802/ | en |
| dc.identifier.sourceurl | http://eprints.cs.vt.edu/archive/00000802/01/CS75022-R.pdf | en |
| dc.identifier.trnumber | CS75022-R | en |
| dc.identifier.uri | http://hdl.handle.net/10919/20291 | en |
| dc.language.iso | en | en |
| dc.publisher | Department of Computer Science, Virginia Polytechnic Institute & State University | en |
| dc.relation.ispartof | Historical Collection(Till Dec 2001) | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | An Extension of the Direct Method for Verifying Programs | en |
| dc.type | Technical report | en |
| dc.type.dcmitype | Text | en |
Files
Original bundle
1 - 1 of 1