Pages that link to "Item:Q2561482"

The following pages link to Axiomatic approach to total correctness of programs (Q2561482):

Displayed 10 items.

• Fair termination revisited - with delay (Q795499) ‎ (← links)
• Proving the correctness of regular deterministic programs: A unifying survey using dynamic logic (Q1139368) ‎ (← links)
• Axiomatic proofs of total correctness of programs (Q1257332) ‎ (← links)
• On proving the termination of algorithms by machine (Q1341666) ‎ (← links)
• Constructive design of a hierarchy of semantics of a transition system by abstract interpretation (Q1605224) ‎ (← links)
• Interprocedural shape analysis using separation logic-based transformer summaries (Q2233537) ‎ (← links)
• Fifty years of Hoare's logic (Q2280214) ‎ (← links)
• Current methods for proving program correctness (Q3911363) ‎ (← links)
• An axiomatic basis for proving total correctness of goto-programs (Q4082983) ‎ (← links)
• On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with Denotational Semantics (Q5097622) ‎ (← links)