Benchmarking Regular Expression Matching

Alexander Roodt, Brendan Keith Mark Watling, Willem Bester, Brink van der Merwe, Sicheol Sung, Yo Sub Han

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we benchmark the matching time of regular expression matching engines when they use either the Thompson or Glushkov regular expressions to state machine conversion algorithms, with or without using memoisation while matching, and doing matching either by using a lockstep or a Spencer type scheduler. We conduct our empirical investigation by expanding on the virtual machine for regular expressions matching approach, introduced by Russ Cox.

Original languageEnglish
Title of host publicationImplementation and Application of Automata - 28th International Conference, CIAA 2024, Proceedings
EditorsSzilárd Zsolt Fazekas
PublisherSpringer Science and Business Media Deutschland GmbH
Pages316-331
Number of pages16
ISBN (Print)9783031711114
DOIs
Publication statusPublished - 2024
Event28th International Conference on Implementation and Application of Automata, CIAA 2024 - Akita, Japan
Duration: 2024 Sept 32024 Sept 6

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume15015 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference28th International Conference on Implementation and Application of Automata, CIAA 2024
Country/TerritoryJapan
CityAkita
Period24/9/324/9/6

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Benchmarking Regular Expression Matching'. Together they form a unique fingerprint.

Cite this