scientific article; zbMATH DE number 17797
From MaRDI portal
Publication:3975138
Recommendations
Cited in
(13)- A Hoare-like proof system for analysing the computation time of programs
- scientific article; zbMATH DE number 3858393 (Why is no real title available?)
- scientific article; zbMATH DE number 18642 (Why is no real title available?)
- Similarity saturation for first order linear temporal logic with UNLESS
- The logic of ``initially and ``next: complete axiomatization and complexity
- VARIABLE TRUTH
- ``During cannot be expressed by ``after
- Does “N+1 times” prove more programs correct than “N times”?
- scientific article; zbMATH DE number 3846835 (Why is no real title available?)
- scientific article; zbMATH DE number 4139719 (Why is no real title available?)
- scientific article; zbMATH DE number 4153903 (Why is no real title available?)
- scientific article; zbMATH DE number 1786650 (Why is no real title available?)
- On the strength of temporal proofs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3975138)