Pages that link to "Item:Q1077159"
From MaRDI portal
The following pages link to Non-standard algorithmic and dynamic logic (Q1077159):
Displaying 15 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)
- Dynamic non-commutative logic (Q2268354) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- STRUCTURED NONSTANDARD DYNAMIC LOGIC (Q3345770) (← links)
- Dynamic Logic with Non-rigid Functions (Q3613414) (← links)
- A PROPERTY OF 2‐SORTED PEANO MODELS AND PROGRAM VERIFICATION (Q3677763) (← links)
- (Q3681934) (← links)
- Strong Semantical Characterization for Nondeterministic Programs (Q3814773) (← links)
- (Q4552494) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)