Pages that link to "Item:Q580955"
From MaRDI portal
The following pages link to Total correctness in nonstandard logics of programs (Q580955):
Displaying 14 items.
- Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics (Q687278) (← links)
- On the strength of temporal proofs (Q809066) (← links)
- Non-standard algorithmic and dynamic logic (Q1077159) (← links)
- Weak second order characterizations of various program verification systems (Q1124311) (← links)
- Temporal logics need their clocks (Q1186428) (← links)
- Algebraization of quantifier logics, an introductory overview (Q1189899) (← links)
- Hoare's logic for nondeterministic regular programs: A nonstandard approach (Q1822934) (← links)
- General correctness: A unification of partial and total correctness (Q2265798) (← links)
- Recursive programs and denotational semantics in absolute logics of programs (Q2639051) (← links)
- Unifying Recursion in Partial, Total and General Correctness (Q3055748) (← links)
- Semantical proofs of correctness for programs performing non-deterministic tests on real numbers (Q3060187) (← links)
- (Q3325017) (← links)
- (Q3696492) (← links)
- Reasoning in Dynamic Logic about Program Termination (Q5452190) (← links)