Pages that link to "Item:Q4170195"
From MaRDI portal
The following pages link to Programming Language Constructs for Which It Is Impossible To Obtain Good Hoare Axiom Systems (Q4170195):
Displaying 32 items.
- An observationally complete program logic for imperative higher-order functions (Q387994) (← links)
- Verification of object-oriented programs: a transformational approach (Q439944) (← links)
- Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control (Q444460) (← links)
- SMT-based model checking for recursive programs (Q518396) (← links)
- Reasoning about procedures as parameters in the language L4 (Q583874) (← links)
- Semantics of algorithmic languages (Q760200) (← links)
- Wythoff games, continued fractions, cedar trees and Fibonacci searches (Q761983) (← links)
- Proving program inclusion using Hoare's logic (Q789887) (← links)
- Correctness of programs with Pascal-like procedures without global variables (Q790607) (← links)
- Average case optimality for linear problems (Q796299) (← links)
- Expressiveness and the completeness of Hoare's logic (Q800082) (← links)
- Verification conditions are code (Q855274) (← links)
- Specifications in an arbitrary institution (Q1108775) (← links)
- Arithmetical completeness versus relative completeness (Q1117212) (← links)
- Hierarchical development of programming languages (Q1161053) (← links)
- On termination problems for finitely interpreted ALGOL-like programs (Q1161274) (← links)
- Some natural structures which fail to possess a sound and decidable Hoare-like logic for their while-programs (Q1163369) (← links)
- A Hoare-like verification system for a language with an exception handling mechanism (Q1176241) (← links)
- Semantics and reasoning with free procedures (Q1193855) (← links)
- Program invariants as fixedpoints (Q1254848) (← links)
- Stratified least fixpoint logic (Q1331926) (← links)
- Completeness of Hoare-calculi revisited (Q1836976) (← links)
- On the notion of expressiveness and the rule of adaptation (Q1838825) (← links)
- Fifty years of Hoare's logic (Q2280214) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Completeness of Hoare Logic Relative to the Standard Model (Q2971129) (← links)
- Ernst-Rüdiger Olderog: A Life for Meaning (Q3449620) (← links)
- The Birth of Model Checking (Q3512430) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)
- Completeness of algorithmic logic (Q3909986) (← links)
- Complexity of proving program correctness (Q5096233) (← links)
- On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) (← links)
