Toward a man-machine system for proving program correctness
- Author:
- Donald Irvin Good
Abstract
No abstract available.
Cited By
- Sarkar D and De Sarkar S (1989). Some Inference Rules for Integer Arithmetic for Verification of Flowchart Programs on Integers, IEEE Transactions on Software Engineering, 15:1, (1-9), Online publication date: 1-Jan-1989.
- Sarkar D and De Sarkar S (1989). A Set of Inference Rules for Quantified Formula Handling and Array Handling in Verification of Programs Over Integers, IEEE Transactions on Software Engineering, 15:11, (1368-1381), Online publication date: 1-Nov-1989.
- Sarkar D and De Sarkar S (1989). A Theorem Prover for Verifying Iterative Programs Over Integers, IEEE Transactions on Software Engineering, 15:12, (1550-1566), Online publication date: 1-Dec-1989.
Darringer J The application of program verification techniques to hardware verification Papers on Twenty-five years of electronic design automation, (373-379)- Darringer J The application of program verification techniques to hardware verification Proceedings of the 16th Design Automation Conference, (375-381)
- King J (1975). A new approach to program testing, ACM SIGPLAN Notices, 10:6, (228-233), Online publication date: 1-Jun-1975.
- Sintzoff M and Lamsweerde A (2019). Constructing correct and efficient concurrent programs, ACM SIGPLAN Notices, 10:6, (319-326), Online publication date: 1-Jun-1975.
- Gerhart S Correctness-preserving program transformations Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages, (54-66)
- King J A new approach to program testing Proceedings of the international conference on Reliable software, (228-233)
- Sintzoff M and Lamsweerde A Constructing correct and efficient concurrent programs Proceedings of the international conference on Reliable software, (319-326)
- Ragland L and Good D (1973). Remark on Algorithm 386 [A1]: Greatest Common Divisor of $n$ Integers and Multipliers, Communications of the ACM, 16:4, (257), Online publication date: 1-Apr-1973.
- Levitt K The application of program-proving techniques to the verification of synchronization processes Proceedings of the December 5-7, 1972, fall joint computer conference, part I, (33-47)
- London R The current state of proving programs correct Proceedings of the ACM annual conference - Volume 1, (39-46)
- Hull T, Enright W and Sedgwick A The correctness of numerical algorithms Proceedings of ACM conference on Proving assertions about programs, (66-73)
- Strong H and Walker S Properties preserved under recursion removal Proceedings of ACM conference on Proving assertions about programs, (97-103)
- Hull T, Enright W and Sedgwick A (2019). The correctness of numerical algorithms, ACM SIGPLAN Notices, 7:1, (66-73), Online publication date: 1-Jan-1972.
- Strong H and Walker S (1972). Properties preserved under recursion removal, ACM SIGPLAN Notices, 7:1, (97-103), Online publication date: 1-Jan-1972.
- Hull T, Enright W and Sedgwick A (1972). The correctness of numerical algorithms, ACM SIGACT News:14, (66-73), Online publication date: 1-Jan-1972.
- Strong H and Walker S (2019). Properties preserved under recursion removal, ACM SIGACT News:14, (97-103), Online publication date: 1-Jan-1972.
- Snowdon R (1972). PEARL, ACM SIGPLAN Notices, 7:3, (9-26), Online publication date: 1-Mar-1972.
Recommendations
Test data as an aid in proving program correctness
Proofs of program correctness tend to be long and tedious, whereas testing, though useful in detecting errors, usually does not guarantee correctness. This paper introduces a technique whereby test data can be used in proving program correctness. In ...
Test data as an aid in proving program correctness
POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languagesProofs of program correctness tend to be long and tedious whereas testing, though useful in detecting errors, usually does not guarantee correctness. This paper introduces a technique whereby test data can be used in proving program correctness. In ...
Proving Correctness of an Efficient Abstraction for Interrupt Handling
This paper presents an approach to the efficient abstraction of interrupt handling in microcontroller systems. Such systems usually operate in uncertain environments, giving rise to a high degree of nondeterminism in the corresponding formal models, ...