scientific article; zbMATH DE number 3999893
From MaRDI portal
Publication:4726228
zbMath0617.03012MaRDI QIDQ4726228
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Does “N+1 times” prove more programs correct than “N times”?, A simple dynamic logic, Recursive programs and denotational semantics in absolute logics of programs, Weak second order characterizations of various program verification systems, Temporal logics need their clocks, Peano arithmetic as axiomatization of the time frame in logics of programs and in dynamic logics, Total correctness in nonstandard logics of programs, On the strength of temporal proofs