Compositional characterization of observable program properties
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 431765 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3938547 (Why is no real title available?)
- scientific article; zbMATH DE number 3959364 (Why is no real title available?)
- scientific article; zbMATH DE number 17826 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 3995030 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Constructive versions of Tarski's fixed point theorems
- Sometime = always + recursion always. On the equivalence of the intermittent and invariant assertions methods for proving inevitability properties of programs
- Strictness analysis for higher-order functions
- The Category-Theoretic Solution of Recursive Domain Equations
Cited in
(4)
This page was built for publication: Compositional characterization of observable program properties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4020510)