An axiomatic basis for computer programming
Communications of the ACM
Complementary Definitions of Programming Language Semantics
Complementary Definitions of Programming Language Semantics
Specification of Abstract Data Types in Modula
ACM Transactions on Programming Languages and Systems (TOPLAS)
Assignment and Procedure Call Proof Rules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Ten Years of Hoare's Logic: A Survey—Part I
ACM Transactions on Programming Languages and Systems (TOPLAS)
Making variables abstract: an equational theory for Russell
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Paths: an abstract alternative to pointers
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Pragmatic techniques for program analysis and verification
ICSE '79 Proceedings of the 4th international conference on Software engineering
Some thoughts arising from a language design effort
ACM SIGSOFT Software Engineering Notes - Proceedings of VERkshop III -- a formal verification workshop
A logical analysis of aliasing in imperative higher-order functions
Proceedings of the tenth ACM SIGPLAN international conference on Functional programming
Polymorphism and separation in hoare type theory
Proceedings of the eleventh ACM SIGPLAN international conference on Functional programming
A logical analysis of aliasing in imperative higher-order functions
Journal of Functional Programming
Hoare type theory, polymorphism and separation1
Journal of Functional Programming
A theory of indirection via approximation
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
| Hi-index | 0.00 |
This paper presents a new version of Hoare's logic including generalized procedure call and assignment rules which correctly handle aliased variables. Formal justifications are given for the new rules.