PPT-An Extensible, Regular-Expression-Based Tool for Multi-Language Mutant Generation

Alex Groce Josie Holmes Darko Marinov August Shi Lingming Zhang ICSE Demo 2018 Gothenburg Sweden May 30 2018 CCF1409423 CCF1421503 CCF1566589 Mutation Testing Goal E valuate the quality of test suites. Introduce finite state automata. Able to capture state, events and dynamic behavior of “man-made systems”. Present logical properties. Textbook :. C. . Cassandras. and S. . Lafortune. , Introduction to Discrete Event Systems, Springer, 2007. RegExp. Regular Expression. A regular expression is a certain way to describe a pattern of characters. . Pattern-matching or keyword search.. Regular expressions are frequently used to test whether or not a string entered in an HTML form has a certain format.. Regular Expressions . and . Pattern . Matching. Overview. The Perl Approach (recursive backtracking) VS The . egrep. Approach (Thompson Multi-State NFA). Matching. :. 29 Character String, Perl: >60 seconds, Thompson NFA: 20 microseconds. Hira. . Waseem. Lexical Analysis . Input Buffering. Before discussing the problem of recognizing lexemes in the input, let us examine some ways that the simple but important task of reading the source program can be speeded. . Introduce finite state automata. Able to capture state, events and dynamic behavior of “man-made systems”. Present logical properties. Textbook :. C. . Cassandras. and S. . Lafortune. , Introduction to Discrete Event Systems, Springer, 2007. Formal definition of a regular expression.. Languages associated with regular expressions.. Introduction regular grammars. . Regular language and homomorphism. . The Chomsky Hierarchy . Regular Expression. Reading: Chapter 3. 2. Regular Expressions vs. Finite Automata. Offers a declarative way to express the pattern of any string we want to accept . E.g., . 01*+ 10*. Automata => more machine-like . < input: string , output: [accept/reject] >. lexical analyzer. parser. symbol table. source program. token. get next token. Important Issue: . . What are Responsibilities of each Box ?. Focus on Lexical Analyzer and Parser. 2. Why to separate Lexical analysis and parsing. Fall 2017. http://cseweb.ucsd.edu/classes/fa17/cse105-a/. Today's learning goals . Sipser Ch 1.2, 1.3. Decide whether or not a string is described by a given regular expression. Design a regular expression to describe a given language. Chapter 3 REGULAR LANGUAGES AND REGULAR GRAMMARS Learning Objectives At the conclusion of the chapter, the student will be able to: Identify the language associated with a regular expression Find a regular expression to describe a given language 1 Lemma Property for Regular Languages * Josue N. Rivera and Haiping Xu Computer and Information Science Department University of Massachusetts Dartmouth, Dartmouth, MA, USA Email: { josue.n.rivera, h aho@cs.columbia.edu. JerseySTEM. Math Club. March 5, 2017. Introduction. Regular expressions are a powerful notation for specifying patterns in text strings.. Regular expressions are used routinely in such applications as text editors, language translators, and Internet packet processors.. AntConc concordance tool. University of Bucharest. Digital Humanities Master. February 2020. Anca Dinu. Regular expressions. In corpus linguistics. much of what we want to do . with a tool. is pattern-matching over texts/corpora. 2. Regular Expressions vs. Finite Automata. Offers a declarative way to express the pattern of any string we want to accept . E.g., . 01*+ 10*. Automata => more machine-like . < input: string , output: [accept/reject] >.