Software reliability via run-time result-checking
From MaRDI portal
Publication:4208876
DOI10.1145/268999.269003zbMath0904.68064OpenAlexW1980280740MaRDI QIDQ4208876
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/
Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of software (68N99)
Related Items (10)
Optimal length resolution refutations of difference constraint systems ⋮ 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 ⋮ Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs ⋮ Problem identification using program checking ⋮ Session-typed concurrent contracts ⋮ Linear-time certifying algorithms for near-graphical sequences ⋮ AUTOMATIC RESULT VERIFICATION BY COMPLETE RUN-TIME CHECKING OF COMPUTATIONS
This page was built for publication: Software reliability via run-time result-checking