Some theorems we should prove
Mathematical techniques can be used to produce precise, provably complete documentation for computer systems. However, such documents are highly detailed; oversights and other errors arc quite common. To detect the “early” errors in a document, one must attempt to prove certain simple theorems. This paper gives some examples of such theorems.
Unable to display preview. Download preview PDF.
- [HKPS1]Heninger, K.L., Kallander, J., Parnas, D.L., Shore, J.E., “Software Requirements for the A-7E Aircraft”, NRL Memorandum Report 3876, United States Naval Research Laboratory, Washington D.C., November 1978, 523 pp.Google Scholar
- [Pa2]Parnas, D.L., “Predicate Logic for Software Engineering”, CRL Report 241, McMaster University, TRIO (Telecommunications Research Institute of Ontario), February 1992, 8 pgs. To appear in IEEE Transactions on Software Engineering.Google Scholar
- [PMI3]Parnas, D.L., Madey, J., Iglewski, M., “Formal Documentation of Well-Structured Programs”, CRL Report 259, McMaster University, TRIO (Telecommunications Research Institute of Ontario), September 1992, 37 pgs.Google Scholar
- [PM4]Pamas, D.L., Madey, J., “Functional Documentation for Computer Systems Engineering (Version 2)”, CRL Report 237, McMaster University, Hamilton Canada, TRIO (Telecommunications Research Institute of Ontario), September 1991,14 pgs.Google Scholar
- [Pa5]Parnas, D.L., “Tabular Representation of Relations”, CRL Report 260, McMaster University, TRIO (Telecommunications Research Institute of Ontario), October 1992, 12 pgs.Google Scholar
- [PAM6]Parnas, D.L., Asmis, G.J.K., Madey, J., “Assessment of Safety-Critical Software in Nuclear Power Plants”, Nuclear Safety. vol. 32, no. 2, April–June 1991, pgs. 189–198.Google Scholar