Pages that link to "Item:Q1077159"

The following pages link to Non-standard algorithmic and dynamic logic (Q1077159):

Displaying 8 items.

• Total correctness in nonstandard logics of programs (Q580955) (← links)
• On the strength of temporal proofs (Q809066) (← links)
• Semantical analysis of specification logic (Q913527) (← links)
• Some general incompleteness results for partial correctness logics (Q1110500) (← links)
• Weak second order characterizations of various program verification systems (Q1124311) (← links)
• Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
• Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
• Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)