Formalization of Properties of Functional Programs
Journal of the ACM (JACM)
Another recursion induction principle
Communications of the ACM
Letters to the editor: go to statement considered harmful
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Correspondence between ALGOL 60 and Church's Lambda-notation: part I
Communications of the ACM
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
Recursive definitions of partial functions and their computations
Recursive definitions of partial functions and their computations
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
Verifying the correctness of compiler transformations on basic blocks using abstract interpretation
PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Continuation-Based Program Transformation Strategies
Journal of the ACM (JACM)
Inductive methods for proving properties of programs
Communications of the ACM
Communications of the ACM
ACM-SE 20 Proceedings of the 20th annual Southeast regional conference
Threshold evaluation and the semantics of call by value, assignment and generic procedures
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A mathematical approach to language design
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A semantic model for parallel systems with scheduling
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The functional power of parameter passage mechanism
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Specification and verification of abstract database types
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
On the theory of programming logics
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Parameter-passing mechanisms and nondeterminism
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
An approach to program verification
DAC '76 Proceedings of the 13th Design Automation Conference
Operational and mathematical semantics for recursive polyadic program schemata
ACM SIGPLAN Notices - Abstracts in programming language-related research
ACM SIGPLAN Notices
ACM SIGPLAN Notices
The roots of structured programming
SIGCSE '78 Papers of the SIGCSE/CSA technical symposium on Computer science education
Theory of linear equations applied to program transformation
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Automatic program synthesis in second-order logic
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
On the completeness of the inductive assertion method
Journal of Computer and System Sciences
Survey: A survey of state vectors
Computer Science Review
Properties complementary to program self-reference
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
| Hi-index | 48.25 |
Following the fixpoint theory of Scott, the semantics of computer programs are defined in terms of the least fixpoints of recursive programs. This allows not only the justification of all existing verification techniques, but also their extension to the handling, in a uniform manner of various properties of computer programs, including correctness, termination, and equivalence.