Expressiveness and the completeness of Hoare's logic
From MaRDI portal
(Redirected from Publication:800082)
Recommendations
Cites work
- scientific article; zbMATH DE number 3645075 (Why is no real title available?)
- scientific article; zbMATH DE number 3688676 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3713172 (Why is no real title available?)
- scientific article; zbMATH DE number 3713173 (Why is no real title available?)
- scientific article; zbMATH DE number 3595145 (Why is no real title available?)
- scientific article; zbMATH DE number 3248792 (Why is no real title available?)
- A New Incompleteness Result for Hoare's System
- An axiomatic basis for computer programming
- An axiomatic definition of the programming language Pascal
- CONSTRUCTIVE ALGEBRAS I
- Computable Algebra, General Theory and Theory of Computable Fields
- Corrigendum: Soundness and Completeness of an Axiom System for Program Verification
- Floyd's principle, correctness theories and program equivalence
- Hoare's logic for programming languages with two data types
- Model theory
- Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- Specifying the Semantics of while Programs: A Tutorial and Critique of a Paper by Hoare and Lauer
- Ten Years of Hoare's Logic: A Survey—Part I
- Theory of program structures: Schemes, semantics, verification
Cited in
(30)- On relative completeness of Hoare logics
- Expressive power and incompleteness of propositional logics
- The verification of modules
- scientific article; zbMATH DE number 1512073 (Why is no real title available?)
- Some general incompleteness results for partial correctness logics
- Completeness for recursive procedures in separation logic
- scientific article; zbMATH DE number 4060685 (Why is no real title available?)
- Semantical analysis of specification logic
- Fifty years of Hoare's logic
- Completeness of Hoare logic relative to the standard model
- Algebraic specifications of computable and semicomputable data types
- Completeness and expressiveness of pointer program verification by separation logic
- scientific article; zbMATH DE number 3888900 (Why is no real title available?)
- Average case optimality for linear problems
- Completeness of Hoare logic with inputs over the standard model
- scientific article; zbMATH DE number 3921949 (Why is no real title available?)
- Expressive completeness and decidability
- On the completeness of propositional Hoare logic
- scientific article; zbMATH DE number 3860376 (Why is no real title available?)
- First order Büchi automata and their application to verification of LTL specifications
- scientific article; zbMATH DE number 3942998 (Why is no real title available?)
- Proving program inclusion using Hoare's logic
- Two theorems about the completeness of Hoare's logic
- The axiomatic semantics of programs based on Hoare's logic
- On the notion of expressiveness and the rule of adaptation
- Weakly expressive models for Hoare logic
- Hoare's logic for programming languages with two data types
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs
- The \(\mathbf{M}\)-computations induced by accessibility relations in nonstandard models \(\mathbf{M}\) of Hoare logic
- Some questions about expressiveness and relative completeness in Hoare's logic
This page was built for publication: Expressiveness and the completeness of Hoare's logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800082)
