Sound and complete Hoare-like calculi based on copy rules
From MaRDI portal
Publication:1154253
DOI10.1007/BF00261258zbMath0464.68037MaRDI QIDQ1154253
Publication date: 1981
Published in: Acta Informatica (Search for Journal in Brave)
completenessprogramming languagessemanticssoundnessproceduresformal provabilityHoare-like calculilanguages of ALGOL-like programs
Other nonclassical logic (03B60) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract data types; algebraic specification (68Q65) General topics in the theory of software (68N01)
Related Items (9)
Ernst-Rüdiger Olderog: A Life for Meaning ⋮ Arithmetical completeness versus relative completeness ⋮ An observationally complete program logic for imperative higher-order functions ⋮ On termination problems for finitely interpreted ALGOL-like programs ⋮ A Hoare-like verification system for a language with an exception handling mechanism ⋮ Fifty years of Hoare's logic ⋮ Wythoff games, continued fractions, cedar trees and Fibonacci searches ⋮ On the notion of expressiveness and the rule of adaptation ⋮ Correctness of programs with Pascal-like procedures without global variables
This page was built for publication: Sound and complete Hoare-like calculi based on copy rules
