Pages that link to "Item:Q1159460"
From MaRDI portal
The following pages link to A complete logic for reasoning about programs via nonstandard model theory. I (Q1159460):
Displaying 10 items.
- Output concepts for accelerated Turing machines (Q609032) (← links)
- The axiomatic semantics of programs based on Hoare's logic (Q800712) (← links)
- Temporal logics need their clocks (Q1186428) (← links)
- Stability of weak second-order semantics (Q1825629) (← links)
- Is ``Some-other-time'' sometimes better than ``Sometime'' for proving partial correctness of programs? (Q1825630) (← links)
- Changing a Semantics: Opportunism or Courage? (Q3454820) (← links)
- On the Completeness of Dynamic Logic (Q3617722) (← links)
- (Q4510742) (← links)
- Reasoning in Dynamic Logic about Program Termination (Q5452190) (← links)
- Does “N+1 times” prove more programs correct than “N times”? (Q5887528) (← links)
