Program result checking: a new approach to making programs more reliable
From MaRDI portal
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Number-theoretic algorithms; complexity (11Y16) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25)
Recommendations
Cites work
- Checking approximate computations over the reals
- Designing programs that check their work
- scientific article; zbMATH DE number 998060 (Why is no real title available?)
- scientific article; zbMATH DE number 4191094 (Why is no real title available?)
- scientific article; zbMATH DE number 4213418 (Why is no real title available?)
- scientific article; zbMATH DE number 176732 (Why is no real title available?)
- scientific article; zbMATH DE number 177898 (Why is no real title available?)
- Non-deterministic exponential time has two-prover interactive protocols
- Self-testing/correcting with applications to numerical problems
Cited in
(3)
This page was built for publication: Program result checking: a new approach to making programs more reliable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4630244)