Assignment and Procedure Call Proof Rules
From MaRDI portal
Publication:3922131
DOI10.1145/357114.357119zbMath0468.68006OpenAlexW2084291524MaRDI QIDQ3922131
Publication date: 1980
Published in: ACM Transactions on Programming Languages and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/357114.357119
Specification and verification (program logics, model checking, etc.) (68Q60) General topics in the theory of software (68N01)
Related Items (11)
Secure mechanical verification of mutually recursive procedures ⋮ A sharp proof rule for procedures in WP semantics ⋮ A proof technique for communicating sequential processes ⋮ Semantical analysis of specification logic ⋮ Proof obligations for blocks and procedures ⋮ Mechanical verification of mutually recursive procedures ⋮ Fifty years of Hoare's logic ⋮ A logical analysis of aliasing in imperative higher-order functions ⋮ On the notion of expressiveness and the rule of adaptation ⋮ An algebraic approach to the syntax and semantics of languages with subscripted variables ⋮ Calculating sharp adaptation rules.
This page was built for publication: Assignment and Procedure Call Proof Rules
