GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
Communications of the ACM
A program verifier
Mechanical translation of set theoretic problem specifications into efficient RAM code-A case study
Journal of Symbolic Computation
Denotational abstract interpretation of logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Disjunctive program analysis for algebraic data types
ACM Transactions on Programming Languages and Systems (TOPLAS)
Test data as an aid in proving program correctness
Communications of the ACM
Automatic data structure choice in a language of very high level
Communications of the ACM
Data flow analysis of applicative programs using minimal function graphs
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic data structure choice in a language of very high level
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Inference rules for program annotation
ICSE '78 Proceedings of the 3rd international conference on Software engineering
Proof-oriented and applicative valuations in definitions of algorithms
FPCA '81 Proceedings of the 1981 conference on Functional programming languages and computer architecture
Static determination of dynamic properties of generalized type unions
Proceedings of an ACM conference on Language design for reliable software
Constructing correct and efficient concurrent programs
Proceedings of the international conference on Reliable software
Test data as an aid in proving program correctness
POPL '76 Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages
Multiple evaluators in an extensible programming system
AFIPS '72 (Fall, part II) Proceedings of the December 5-7, 1972, fall joint computer conference, part II
Optimization of very high level languages-I
Computer Languages
Program Verification: State of the Art, Problems, and Results. I
Cybernetics and Systems Analysis
| Hi-index | 0.04 |
The proof that a program verifies some property is carried out by the valuation of the program in a model characterizing that property. Specific models are given for sufficient conditions of the correctness of types, locations and asynchronous computations; a hypothetical programming language is used, which includes functions and locations and allows their recursive composition. The application of the method in studying termination or correctness problems is discussed on particular programs.