Revision as of 01:50, 8 January 2023 edit Citation bot (talk \| contribs) Bots 5,868,529 edits Add: class, eprint. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Headbomb \| #UCB_toolbar ← Previous edit		Revision as of 19:40, 27 January 2023 edit undo MrOllie (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 255,629 edits rv COI / citespam Next edit →
Line 38: === Robust algorithms === There exists algorithms that tolerate errors in the input.<ref>{{cite book \|last1=Carbin \|first1=Michael \|title=Proceedings of the 19th international symposium on Software testing and analysis - ISSTA '10 \|last2=Rinard \|first2=Martin C. \|chapter=Automatically identifying critical input regions and code in applications \|date=12 July 2010 \|pages=37–48 \|doi=10.1145/1831708.1831713 \|publisher=ACM \|isbn=9781605588230 \|s2cid=1147058 \|chapter-url=http://people.csail.mit.edu/rinard/paper/issta10.pdf}}</ref> or during the computation.<ref name="Danglot">{{cite journal \|last1=Danglot \|first1=Benjamin \|last2=Preux \|first2=Philippe \|last3=Baudry \|first3=Benoit \|last4=Monperrus \|first4=Martin \|title=Correctness attraction: a study of stability of software behavior under runtime perturbation \|journal=Empirical Software Engineering \|date=21 December 2017 \|volume=23 \|issue=4 \|pages=2086–2119 \|doi=10.1007/s10664-017-9571-8 \|url=https://hal.archives-ouvertes.fr/hal-01378523/document \|arxiv=1611.09187 \|s2cid=12549038 }}</ref> In that case, the computation eventually converges to the correct output. This phenomenon has been called "correctness attraction".<ref name="Danglot"/> ==See also==

Robustness (computer science): Difference between revisions