Program result checking: A new approach to making programs more reliable

DOI10.1007/3-540-56939-1_57zbMath1418.68089OpenAlexW1484639018MaRDI QIDQ4630244

No author found.

Publication date: 29 March 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-56939-1_57

zbMATH Keywords

minimum spanning tree problemHamilton cyclegraph isomorphisminteractive proofsoftware fault

Mathematics Subject Classification ID

Related Items (3)

Efficient and accurate computation of upper bounds of approximation errors ⋮ Certifying algorithms ⋮ Problem identification using program checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Non-deterministic exponential time has two-prover interactive protocols
• Self-testing/correcting with applications to numerical problems
• Designing programs that check their work
• Checking approximate computations over the reals

This page was built for publication: Program result checking: A new approach to making programs more reliable