An axiomatic basis for computer programming
Communications of the ACM
Communications of the ACM
A program verifier
A Nonparametric Method for Fitting a Straight Line to a Noisy Image
IEEE Transactions on Pattern Analysis and Machine Intelligence
Tentative steps toward a development method for interfering programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
The coupling effect: fact or fiction
TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Investigations of the software testing coupling effect
ACM Transactions on Software Engineering and Methodology (TOSEM)
Experimental results from an automatic test case generator
ACM Transactions on Software Engineering and Methodology (TOSEM)
Programming with variable functions
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Communications of the ACM
A New Incompleteness Result for Hoare's System
Journal of the ACM (JACM)
The Vienna Definition Language
ACM Computing Surveys (CSUR)
Structured Programming with go to Statements
ACM Computing Surveys (CSUR)
Models and Measurements for Quality Assessment of Software
ACM Computing Surveys (CSUR)
Derivation of Invariant Assertions During Program Development by Transformation
ACM Transactions on Programming Languages and Systems (TOPLAS)
A technique for software module specification with examples
Communications of the ACM - Special 25th Anniversary Issue
Communications of the ACM
Communications of the ACM
A technique for software module specification with examples
Communications of the ACM
On the criteria to be used in decomposing systems into modules
Communications of the ACM
Experiment with an automatic theorem-prover having partial ordering inference rules
Communications of the ACM
Automating proofs of the absence of common runtime errors
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A proposal for a handbook for APL program verification
ACM SIGAPL APL Quote Quad
Software Evolution and Software Evolution Processes
Annals of Software Engineering
Evolution in software and related areas
IWPSE '01 Proceedings of the 4th International Workshop on Principles of Software Evolution
Splitting the Difference: The Historical Necessity of Synthesis in Software Engineering
IEEE Annals of the History of Computing
An Experimental Comparison of the Effectiveness of Branch Testing and Data Flow Testing
IEEE Transactions on Software Engineering
Soft-Ware 2002 Proceedings of the First International Conference on Computing in an Imperfect World
Proof of Imperative Programs in Type Theory
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
Scientific Decisions which Characterize VDM
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
Combining Generic and Domain Specific Reasoning by Using Contexts
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Formal verification of a real-time hardware design
DAC '83 Proceedings of the 20th Design Automation Conference
ICSE '79 Proceedings of the 4th international conference on Software engineering
ACM '76 Proceedings of the 1976 annual conference
The current state of proving programs correct
ACM '72 Proceedings of the ACM annual conference - Volume 1
ACM '72 Proceedings of the ACM annual conference - Volume 2
Operational semantics of programming languages
Proceedings of ACM conference on Proving assertions about programs
Formal specification and automatic programming
ICSE '76 Proceedings of the 2nd international conference on Software engineering
A generalized assertion language
ICSE '76 Proceedings of the 2nd international conference on Software engineering
SIGCSE '73 Proceedings of the third SIGCSE technical symposium on Computer science education
Specification techniques for data abstractions
Proceedings of the international conference on Reliable software
SELECT—a formal system for testing and debugging programs by symbolic execution
Proceedings of the international conference on Reliable software
Proceedings of the international conference on Reliable software
Verifying programs by algebraic and logical reduction
Proceedings of the international conference on Reliable software
A view of program verification
Proceedings of the international conference on Reliable software
Assertional checking and symbolic execution: An effective combination for debugging
ACM '79 Proceedings of the 1979 annual conference
A brief account: Implementation and applications of a Pascal program verifier (Position Statement)
ACM '78 Proceedings of the 1978 annual conference - Volume 2
The Early Search for Tractable Ways of Reasoning about Programs
IEEE Annals of the History of Computing
On the criteria to be used in decomposing systems into modules
Software pioneers
Verification of non-functional programs using interpretations in type theory
Journal of Functional Programming
ACM SIGPLAN Notices - Special issue on control structures in programming languages
Survey of existing programming aids
ACM SIGPLAN Notices
Building certified libraries for PCC: dynamic storage allocation
Science of Computer Programming - Special issue on 12th European symposium on programming (ESOP 2003)
The roots of structured programming
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
Verification of safety properties for concurrent assembly code
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming
Formal proof of a program: Find
Science of Computer Programming
Classics in software engineering
On the criteria to be used in decomposing systems into modules
Classics in software engineering
Structured programming with go to statements
Classics in software engineering
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Discovering properties about arrays in simple programs
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Reasoning about programs via operational semantics: requirements for a support system
Automated Software Engineering
A summary of progress toward proving program correctness
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
LOGOS and the software engineer
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
A synthesizer of inductive assertions
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Modular Verification of Recursive Programs
Languages: From Formal to Natural
Building certified libraries for PCC: dynamic storage allocation
ESOP'03 Proceedings of the 12th European conference on Programming
Writing and using program specifications
Proceedings of the FSE/SDP workshop on Future of software engineering research
Formally certified stable marriages
Proceedings of the 48th Annual Southeast Regional Conference
Using dynamic analysis to discover polynomial and array invariants
Proceedings of the 34th International Conference on Software Engineering
Ribbon proofs for separation logic
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Performance estimation using symbolic data
Theories of Programming and Formal Methods
Hi-index | 48.31 |
A proof is given of the correctness of the algorithm “Find.” First, an informal description is given of the purpose of the program and the method used. A systematic technique is described for constructing the program proof during the process of coding it, in such a way as to prevent the intrusion of logical errors. The proof of termination is treated as a separate exercise. Finally, some conclusions relating to general programming methodology are drawn.