AI SearchAnalysis of a few methods on correctness based on program structure
Call Number: AIT RSPR no. CS-87-6 Material type:
SeriesSeries: Asian Institute of Technology. Research studies project report ; no. CS-87-6Publication details: Bangkok : Asian Institute of Technology, 1987Description: 78 pSubject(s): Online resources: Dissertation note: Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987 Summary: 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.
| Cover image | Item type | Current library | Home library | Collection | Shelving location | Call number | Materials specified | Vol info | URL | Copy number | Status | Notes | Date due | Barcode | Item holds | Item hold queue priority | Course reserves | |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
22-AIT Thesis (Replacement)
|
Asian Institute of Technology Library AIT Publications | AIT RSPR no. CS-87-6 (Browse shelf(Opens below)) | 3 | Available | 30050120616809 | |||||||||||||
40-Archives
|
Asian Institute of Technology Library Archives | AIT RSPR no. CS-87-6 (Browse shelf(Opens below)) | Available | 30050120238596 |
A research study summitted in partial fulfillment of the requirements for the degree of Master of Engineering, School of Engineering and Technology
Research Studies Project Report (M. Sc.) - Asian Institute of Technology, 1987
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.
There are no comments on this title.