Certification of computational results

DOI10.1109/12.392843zbMath1053.68519OpenAlexW2147078347MaRDI QIDQ4421218

Gerald M. Masson, Gregory F. Sullivan, Dwight S. Wilson

Publication date: 1995

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2060/19940031557

zbMATH Keywords

fault detectionfault tolerance

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of software (68N99)

Related Items (6)

Checker for data structures which sort elements ⋮ Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) ⋮ Certifying algorithms ⋮ Efficient authenticated data structures for graph connectivity and geometric search problems ⋮ Checking the convexity of polytopes and the planarity of subdivisions ⋮ AUTOMATIC RESULT VERIFICATION BY COMPLETE RUN-TIME CHECKING OF COMPUTATIONS

This page was built for publication: Certification of computational results