A Formalisation of Java Strings for Program Specification and Verification

Bubel, Richard; Hähnle, Reiner; Geilmann, Ulrich

doi:10.1007/978-3-642-24690-6_8

Cited by 2 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Regular expressions are often used by the analysis to describe the legal strings, but none of this work addresses applications that use regular expressions. String analysis has also been used to verify sanitization routines, such as to confirm that every blacklisted character has been removed from a given string [36,5,31]; such work is complementary to ours.…”

Section: Related Workmentioning

confidence: 97%

A type system for regular expressions

Spishak

Dietl

Ernst

2012

Proceedings of the 14th Workshop on Formal Techniques for Java-Like Programs

View full text Add to dashboard Cite

Regular expressions are used to match and extract text. It is easy for developers to make syntactic mistakes when writing regular expressions, because regular expressions are often complex and different across programming languages. Such errors result in exceptions at run time, and there is currently no static support for preventing them.This paper describes practical experience designing and using a type system for regular expressions. This type system validates regular expression syntax and capturing group usage at compile time instead of at run time -ensuring the absence of PatternSyntaxExceptions from invalid syntax and IndexOutOfBoundsExceptions from accessing invalid capturing groups.Our implementation is publicly available and supports the full Java language. In an evaluation on five open-source Java applications (480kLOC), the type system was easy to use, required less than one annotation per two thousand lines, and found 56 previouslyunknown bugs.

show abstract

Section: Related Workmentioning

confidence: 97%