Does “N+1 times” prove more programs correct than “N times”? (Q5887528): Difference between revisions

@@ Property / cites work @@
+Q3309036
@@ Property / cites work: Q3309036 / rank @@
+Normal rank
@@ Property / cites work @@
+A complete logic for reasoning about programs via nonstandard model theory. I
+Normal rank
@@ Property / cites work @@
+Q4054648
@@ Property / cites work: Q4054648 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5551122
@@ Property / cites work: Q5551122 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4726228
@@ Property / cites work: Q4726228 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4190096
@@ Property / cites work: Q4190096 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3956390
@@ Property / cites work: Q3956390 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-standard algorithmic and dynamic logic
@@ Property / cites work: Non-standard algorithmic and dynamic logic / rank @@
+Normal rank
@@ Property / cites work @@
+The temporal semantics of concurrent programs
@@ Property / cites work: The temporal semantics of concurrent programs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5556395
@@ Property / cites work: Q5556395 / rank @@
+Normal rank
@@ Property / cites work @@
+STRUCTURED NONSTANDARD DYNAMIC LOGIC
@@ Property / cites work: STRUCTURED NONSTANDARD DYNAMIC LOGIC / rank @@
+Normal rank
@@ Property / cites work @@
+Q3698302
@@ Property / cites work: Q3698302 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Logic of “To‐morrow”<sup>1</sup>
@@ Property / cites work: On the Logic of “To‐morrow”<sup>1</sup> / rank @@
+Normal rank