Show simple item record

dc.contributor.authorFulton, Nathan
dc.date.accessioned2013-10-24T19:01:46Z
dc.date.available2013-10-24T19:01:46Z
dc.date.created2013-04-11
dc.date.issued2013-10-24
dc.identifier.urihttp://hdl.handle.net/123456789/432
dc.description.abstractProgrammers often wish to validate or sanitize user input. One common approach to this problem is the use of regular expressions. Unvalidated or insufficiently sanitized user input can cause security problems. Therefore, a compile-time guarantee that input sanitation algorithms are implemented and used correctly could ensure the absence of certain sorts of vulnerabilities. This thesis presents $\lcs$, a typed lambda calculus which captures the essential properties necessary to achieve such a guarantee.en_US
dc.description.sponsorshipCarthage College Mathematics Departmenten_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesSenior Thesis;
dc.subjectinput sanitationen_US
dc.subjectlambda calculusen_US
dc.subjectprogrammingen_US
dc.titleA Typed Lambda Calculus for Input Sanitationen_US
dc.typeThesisen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record