Software reliability via run-time result-checking

DOI10.1145/268999.269003MaRDI QIDQ4208876zbMATH OpenOpenAlexFDO

Authors Hal Wasserman, Manuel Blum

Publication date 4 November 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

built-in testingconcurrent error detectiondebuggingresult-checking

Mathematics Subject Classification ID

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

Recommendations

• Checking the correctness of memories
• Designing checkers for programs that run in parallel
• Designing programs that check their work
• A functional framework for result checking

Cited in

(10)

• Linear-time certifying algorithms for near-graphical sequences
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
• Problem identification using program checking
• A survey on delegated computation
• Convergence analysis of evolutionary algorithms in the presence of crash-faults and cheaters
• Certifying algorithms
• From search to computation: redundancy criteria and simplification at work
• Automatic result verification by complete run-time checking of computations
• Session-typed concurrent contracts
• Optimal length resolution refutations of difference constraint systems

This page was built for publication: Software reliability via run-time result-checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4208876)