An inspection-based technique for verifying module correctness

dc.contributor.authorJones, Graeme Nealen_US
dc.date.accessioned2024-08-14T17:55:45Z
dc.date.available2024-08-14T17:55:45Z
dc.date.copyright1992en_US
dc.date.issued1992
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en
dc.description.abstractCurrent trends in programming methodology suggest that specification and verification should be as formal as possible. Yet, putting such methods into practice has proved difficult. We propose a mixture of formal and infor­mal techniques, and rely more on human review than on formal derivation. We extend current work on module verification, providing new theoretical re­sults as well as practical procedures designed for use in software inspections. Our underlying theory is for pairs of infinite, nondeterministic Mealy ma­chines. Module state machines (MSMs) are Mealy machines specialized for modeling software modules: the inputs are function calls and the outputs are return-value/exception pairs. We have defined three kinds of MSMs, corre­sponding to ( 1) declarative specifications using abstract state, (2) declarative specifications using concrete state, and (3) implementations. Both exceptions and nondeterminism are handled. Based on the Mealy machine theory, we have developed MSM verification procedures, specifically designed for proofs delivered in inspection meetings. Detailed examples of the three MSMs and the verification procedures are included.en
dc.format.extent71 pages
dc.identifier.urihttps://hdl.handle.net/1828/18334
dc.rightsAvailable to the World Wide Weben_US
dc.subjectUN SDG 17: Partnershipsen
dc.titleAn inspection-based technique for verifying module correctnessen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
JONES_Graeme_Neal_MSc_1992_528523.pdf
Size:
17.52 MB
Format:
Adobe Portable Document Format