Show simple item record

Filtered Iterators For Safe and Robust Programs in RIFL

dc.date.accessioned2015-12-28T22:15:05Z
dc.date.accessioned2018-11-26T22:27:31Z
dc.date.available2015-12-28T22:15:05Z
dc.date.available2018-11-26T22:27:31Z
dc.date.issued2015-12-27
dc.identifier.urihttp://hdl.handle.net/1721.1/100542
dc.identifier.urihttp://repository.aust.edu.ng/xmlui/handle/1721.1/100542
dc.description.abstractWe present a new language construct, filtered iterators, for safe and robust input processing. Filtered iterators are designed to eliminate many common input-processing errors while enabling robust continued execution. The design is inspired by (a) observed common input-processing errors and (b) continued execution strategies that are implemented by developers fixing input validation errors. Filtered iterators decompose inputs into input units, atomically and automatically discarding units that trigger errors. Statistically significant results from a developer study highlight the difficulties that developers encounter when developing input-processing code using standard language constructs. These results also demonstrate the effectiveness of filtered iterators in eliminating many of these difficulties and enabling developers to produce safe and robust input-processing code.en_US
dc.format.extent111 p.en_US
dc.titleFiltered Iterators For Safe and Robust Programs in RIFLen_US


Files in this item

FilesSizeFormatView
MIT-CSAIL-TR-2015-036.pdf1.225Mbapplication/pdfView/Open

This item appears in the following Collection(s)

Show simple item record