Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

You searched for id:"handle:10019.1/102879". One record found.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Stellenbosch University

1. Weideman, Nicolaas Hendrik. Static analysis of regular expressions.

Degree: MSc, 2017, Stellenbosch University

Stellenbosch University. Faculty of Science. Dept. of Mathematical Sciences (Computer Science)

ENGLISH ABSTRACT : Regular expressions are widely used throughout the programming community. In most cases, regular expressions allow for pattern matching tasks to be performed efficiently, but in some instances regular expression matching can be extremely slow. The exploit of the potential slowness of regular expression matching, is known as a regular expression denial of service attack. We investigate regular expression denial of service attacks, by approaching it from a computational complexity and automata theoretic point of view. A method for accurately modeling the matching time behaviour of a backtracking regular expression matcher, by using automata theoretic methods, is presented. We analyze our models by using the concept of ambiguity in nondeterministic finite-state automata. Our approach is evaluated on repositories of regular expressions often used in practice. Techniques for mitigating the vulnerability of backtracking regular expression matchers are investigated as a means to thwart regular expression denial of service attacks.

AFRIKAANSE OPSOMMING : Reguliere uitdrukkings word gereeld gebruik in die skryf van sagteware. In die meeste gevalle stel sulke uitdrukkings mens in staat om patroonherkenningsprobleme op ’n doeltreffende manier op te los. Daar is egter sommige situasies waar hierdie proses uiters tydrowend kan wees. Die uitbuiting van sulke kwesbaarhede staan as ’n diensontseggingaanval bekend. Ons ondersoek hierdie aanvalle vanuit die oogpunt van berekeningskompleksiteit en outomateteorie. ’n Metode word gegee om die herkenningstyd van ’n terugspoor herkenner van reguliere uitdrukkings akkuraat te modelleer. Ons analiseer die modelle deur gebruik te maak van die konsep van dubbelsinnigheid in nie-deterministiese eindigetoestand-outomate. Die metodes word getoets deur dit toe te pas op magasyne van reguliere uitdrukkings wat in die praktyk gebruik word. Tegnieke om die kwesbaarheid van terugspoor herkenners van reguliere uitdrukkings te verbeter word ondersoek, met die doelwit om diensontseggingaanvalle te voorkom.

Advisors/Committee Members: Van der Merwe, Andries Brink.

Subjects/Keywords: Computer programming language  – Regular expressions; UCTD; Automata theory; Computer programming language  – Denial-of-service attack (DoS attack); Computer programming language  – Backtracking matchers; Computer software  – Static analysis techniques

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Weideman, N. H. (2017). Static analysis of regular expressions. (Masters Thesis). Stellenbosch University. Retrieved from http://hdl.handle.net/10019.1/102879

Chicago Manual of Style (16th Edition):

Weideman, Nicolaas Hendrik. “Static analysis of regular expressions.” 2017. Masters Thesis, Stellenbosch University. Accessed January 21, 2018. http://hdl.handle.net/10019.1/102879.

MLA Handbook (7th Edition):

Weideman, Nicolaas Hendrik. “Static analysis of regular expressions.” 2017. Web. 21 Jan 2018.

Vancouver:

Weideman NH. Static analysis of regular expressions. [Internet] [Masters thesis]. Stellenbosch University; 2017. [cited 2018 Jan 21]. Available from: http://hdl.handle.net/10019.1/102879.

Council of Science Editors:

Weideman NH. Static analysis of regular expressions. [Masters Thesis]. Stellenbosch University; 2017. Available from: http://hdl.handle.net/10019.1/102879

.