Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 143 for “"Regular expressions"”.

  1. Automated Grading and Feedback of Regular Expressions

    … developed a technique to evaluate assignments on regular expressions (regexes). Every student is different and so is their solution, thus making it hard to have a single approach to grade it all. Hence, in addition to the existing techniques, we offer a new way of evaluating regexes. We call this …

    rit Repository record for Automated Grading and Feedback of Regular Expressions (opens in a new tab)

  2. Usage and refactoring studies of python regular expressions

    <p>Though regular expressions provide a powerful search technique that is baked into every major language, is incorporated into a myriad of essential tools, and has been a fundamental aspect of Computer Science since the 1960's, no one has ever formally studied how they are used in practice, or how …

    iastate Repository record for Usage and refactoring studies of python regular expressions (opens in a new tab)

  3. Formally Verified Algorithms for Temporal Logic and Regular Expressions

    … form of linear traces. **Temporal logic** and **regular expressions** are two core formalisms used to specify properties of such data. This thesis extends these formalisms to enable the expression of richer classes of properties in a succinct manner together with algorithms that can handle them …

    rice Repository record for Formally Verified Algorithms for Temporal Logic and Regular Expressions (opens in a new tab)

  4. Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic

    … automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well …

    qucosa-diss

  5. Exploring the Process and Challenges of Programming with Regular Expressions

    Regular expressions (regexes) are a powerful mechanism for solving string-matching problems and are supported by all modern programming languages. While regular expressions are highly expressive, they are also often perceived to be highly complex and hard to read. While existing studies have …

    vt Repository record for Exploring the Process and Challenges of Programming with Regular Expressions (opens in a new tab)

  6. An Investigation into the performance of regular expressions within SPARQL query language

    … to search through literals/strings by using a Regular Expression (Regex) filter. This adds a very handy and expressive utility, which allows users to search through strings or filter certain URIs. However, Regex is computationally expensive as well as resource intensive in that, for example, …

    soton Download PDF for An Investigation into the performance of regular expressions within SPARQL query language (opens in a new tab)

  7. A technique for converting NFA's and DFA's to regular expressions in Lex

    In the design and creation of compilers, a compiler-writer is called upon to make assumptions and declarations about how their language's syntax performs and behaves. Lex is a software tool used to create grammar rules. A flat file is read as input to lex, and the corresponding C code is output. …

    rowan Repository record for A technique for converting NFA's and DFA's to regular expressions in Lex (opens in a new tab)

  8. BVAP: Energy and Memory Efficient Automata Processing for Regular Expressions with Bounded Repetitions

    Regular pattern matching is pervasive in applications such as text processing, malware detection, network security, and bioinformatics. Recent studies have demonstrated specialized in-memory automata processors with superior energy and memory efficiencies than existing computing platforms. Yet, …

    rice Repository record for BVAP: Energy and Memory Efficient Automata Processing for Regular Expressions with Bounded Repetitions (opens in a new tab)

  9. Generating regular expressions from natural language specifications: A semantics-based approach and an empirical study

    … forms. In this thesis, we focus on generating regular expressions from natural language, an important task of the program-synthesis problem. In particular, we study the task in two aspects. First, we address the issue of Program Aliasing, and propose a semantics-based approach named SemRegex. …

    uiuc Repository record for Generating regular expressions from natural language specifications: A semantics-based approach and an empirical study (opens in a new tab)

  10. Semantics, analysis and security of backtracking regular expression matchers

    Regular expressions are ubiquitous in computer science. Originally defined by Kleene in 1956, they have become a staple of the computer science undergraduate curriculum. Practical applications of regular expressions are numerous, ranging from compiler construction through smart text editors to …

    birmingham Download PDF for Semantics, analysis and security of backtracking regular expression matchers (opens in a new tab)

  11. Improving Software Quality for Regular Expression Matching Tools Using Automated Combinatorial Testing

    Regular expression matching tools (grep) match regular expressions to lines of text. However, because of the complexity that regular expressions can reach, it is challenging to apply state of the art automated testing frameworks to grep tools. Combinatorial testing has shown to be an effective …

    lancaster Download PDF for Improving Software Quality for Regular Expression Matching Tools Using Automated Combinatorial Testing (opens in a new tab)

  12. A Forensic Web Log Analysis Tool: Techniques and Implementation

    … analyzing log files based on a concept that uses regular expressions, and a variety of solutions to problems associated with existing tools. The implementation is designed to detect critical web application security flaws gleaned from event data contained within the access log files of the …

    concordia Download PDF for A Forensic Web Log Analysis Tool: Techniques and Implementation (opens in a new tab)

  13. Text Identification by Example

    … the data that they are interested in. Building a regular expression to match the text they are interested in will automate the process, but regular expressions are hard to create and certainly are not feasible for non-programmers to construct. Text Identification by Example (TIBE) makes it easier …

    byu Repository record for Text Identification by Example (opens in a new tab) Download PDF for Text Identification by Example (opens in a new tab)

  14. CSA-X: Modularized Constrained Multiple Sequence Alignment

    … where researchers used anchor points, regular expressions, or context-free-grammars to specify the constraints, wherein alignments produced are forced to align around segments that match the constraints. In this thesis, we propose CSA-X, a modularized program of constrained multiple …

    sask Repository record for CSA-X: Modularized Constrained Multiple Sequence Alignment (opens in a new tab)

  15. Underlying structures in automata

    … are considered. Some important theorems about regular sets and acceptance are presented as well as the concept of reduction.</p><p>Chapter IV first presents some theorems about regular sets. Next, regular expressions and transition graphs are described, then shown to be related. Finally, the …

    ut-knoxville Repository record for Underlying structures in automata (opens in a new tab)

  16. A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs

    … traces and mining specifications in the form of regular expressions from execution traces. Though the architectures in CPUs have extensively improved over the years to execute such computationally intensive tasks, further enhancements have been impeded due to increased heat dissipation. This has …

    waterloo Repository record for A Study on the Acceleration of Arrival Curve Construction and Regular Specification Mining using GPUs (opens in a new tab)

  17. On Automation of Code Transformations for Concept Inventory Misconceptions

    … interms of expressiveness, when compared to the regular expressions that were used in initialversion of the EvoParsons system. Our second contribution is to implement code trans-formations modeling novice programmers’ misconceptions that have been identified in theComputing Education research …

    usf Repository record for On Automation of Code Transformations for Concept Inventory Misconceptions (opens in a new tab)

  18. Sequence-based software specification

    … systematic investigation of stimulus histories, regular expression "rules" can be discovered and mapped to responses. These rules can be used to partition the set of all stimulus histories, providing an arguably complete, consistent, and correct black box specification. Computable predicates and …

    utk-theses Repository record for Sequence-based software specification (opens in a new tab)

Page 1 of 8