Thematische Bibliographien / Regex matching

Inhaltsverzeichnis

Zeitschriftenartikel
Dissertationen
Bücher
Buchteile
Konferenzberichte

Auswahl der wissenschaftlichen Literatur zum Thema „Regex matching“

Autor: Grafiati

Veröffentlicht am 28. Juni 2021

Zuletzt aktualisiert am 29. Juli 2025

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Regex matching" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Regex matching"

Barrière, Aurèle, and Clément Pit-Claudel. "Linear Matching of JavaScript Regular Expressions." Proceedings of the ACM on Programming Languages 8, PLDI (2024): 1336–60. http://dx.doi.org/10.1145/3656431.

Der volle Inhalt der Quelle

Annotation:

Modern regex languages have strayed far from well-understood traditional regular expressions: they include features that fundamentally transform the matching problem. In exchange for these features, modern regex engines at times suffer from exponential complexity blowups, a frequent source of denial-of-service vulnerabilities in JavaScript applications. Worse, regex semantics differ across languages, and the impact of these divergences on algorithmic design and worst-case matching complexity has seldom been investigated. This paper provides a novel perspective on JavaScript's regex semantics b

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Moseley, Dan, Mario Nishio, Jose Perez Rodriguez, et al. "Derivative Based Nonbacktracking Real-World Regex Matching with Backtracking Semantics." Proceedings of the ACM on Programming Languages 7, PLDI (2023): 1026–49. http://dx.doi.org/10.1145/3591262.

Der volle Inhalt der Quelle

Annotation:

We develop a new derivative based theory and algorithm for nonbacktracking regex matching that supports anchors and counting, preserves backtracking semantics, and can be extended with lookarounds. The algorithm has been implemented as a new regex backend in .NET and was extensively tested as part of the formal release process of .NET7. We present a formal proof of the correctness of the algorithm, which we believe to be the first of its kind concerning industrial implementations of regex matchers. The paper describes the complete foundation, the matching algorithm, and key aspects of the impl

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Zhang, Ling, Shaleen Deep, Avrilia Floratou, Anja Gruenheid, Jignesh M. Patel, and Yiwen Zhu. "Exploiting Structure in Regular Expression Queries." Proceedings of the ACM on Management of Data 1, no. 2 (2023): 1–28. http://dx.doi.org/10.1145/3589297.

Der volle Inhalt der Quelle

Annotation:

Regular expression, or regex, is widely used to extract critical information from a large corpus of formatted text by finding patterns of interest. In tasks like log processing, the speed of regex matching is crucial. Data scientists and developers regularly use regex libraries that implement optimized regular expression matching using modern automata theory. However, computing state transitions in the underlying regex evaluation engine can be inefficient when a regex query contains a multitude of string literals. This inefficiency is further exasperated when analyzing large data volumes. This

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Turoňová, Lenka, Lukáš Holík, Ondřej Lengál, Olli Saarikivi, Margus Veanes, and Tomáš Vojnar. "Regex matching with counting-set automata." Proceedings of the ACM on Programming Languages 4, OOPSLA (2020): 1–30. http://dx.doi.org/10.1145/3428286.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Le Glaunec, Alexis, Lingkun Kong, and Konstantinos Mamouras. "Regular Expression Matching using Bit Vector Automata." Proceedings of the ACM on Programming Languages 7, OOPSLA1 (2023): 492–521. http://dx.doi.org/10.1145/3586044.

Der volle Inhalt der Quelle

Annotation:

Regular expressions (regexes) are ubiquitous in modern software. There is a variety of implementation techniques for regex matching, which can be roughly categorized as (1) relying on backtracking search, or (2) being based on finite-state automata. The implementations that use backtracking are often chosen due to their ability to support advanced pattern-matching constructs. Unfortunately, they are known to suffer from severe performance problems. For some regular expressions, the running time for matching can be exponential in the size of the input text. In order to provide stronger guarante

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Nepeivoda, Antonina Nikolaevna, Yulia Andreevna Belikova, Kirill Konstantinovich Shevchenko, et al. "REDoS Detection in “Domino” Regular Expressions by Ambiguity Analysis." Proceedings of the Institute for System Programming of the RAS 35, no. 3 (2023): 109–24. http://dx.doi.org/10.15514/ispras-2023-35(3)-8.

Der volle Inhalt der Quelle

Annotation:

The Regular Expression Denial of Service (REDoS) problem refers to a time explosion caused by the high computational complexity of matching a string against a regex pattern. This issue is prevalent in popular regex engines, such as PYTHON, JAVASCRIPT, and C++. In this paper, we examine several existing open-source tools for detecting REDoS and identify a class of regexes that can create REDoS situations in popular regex engines but are not detected by these tools. To address this gap, we propose a new approach based on ambiguity analysis, which combines a strong star-normal form test with an a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Purtzel, Steven, and Matthias Weidlich. "SuSe: Summary Selection for Regular Expression Subsequence Aggregation over Streams." Proceedings of the ACM on Management of Data 3, no. 3 (2025): 1–27. https://doi.org/10.1145/3725359.

Der volle Inhalt der Quelle

Annotation:

Regular expressions (RegEx) are an essential tool for pattern matching over streaming data, e.g., in network and security applications. The evaluation of RegEx queries becomes challenging, though, once subsequences are incorporated, i.e., characters in a sequence may be skipped during matching. Since the number of subsequence matches may grow exponentially in the input length, existing RegEx engines fall short in finding all subsequence matches, especially for queries including Kleene closure. In this paper, we argue that common applications for RegEx queries over streams do not require the en

APA, Harvard, Vancouver, ISO und andere Zitierweisen

De Santo, Noé, Aurèle Barrière, and Clément Pit-Claudel. "A Coq Mechanization of JavaScript Regular Expression Semantics." Proceedings of the ACM on Programming Languages 8, ICFP (2024): 1003–31. http://dx.doi.org/10.1145/3674666.

Der volle Inhalt der Quelle

Annotation:

We present an executable, proven-safe, faithful, and future-proof Coq mechanization of JavaScript regular expression (regex) matching, as specified by the latest published edition of ECMA-262 section 22.2. This is, to our knowledge, the first time that an industrial-strength regex language has been faithfully mechanized in an interactive theorem prover. We highlight interesting challenges that arose in the process (including issues of encoding, corner cases, and executability), and we document the steps that we took to ensure that the result is straightforwardly auditable and that our understa

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Le Glaunec, Alexis, Lingkun Kong, and Konstantinos Mamouras. "HybridSA: GPU Acceleration of Multi-pattern Regex Matching using Bit Parallelism." Proceedings of the ACM on Programming Languages 8, OOPSLA2 (2024): 1699–728. http://dx.doi.org/10.1145/3689771.

Der volle Inhalt der Quelle

Annotation:

Multi-pattern matching is widely used in modern software for applications requiring high throughput such as protein search, network traffic inspection, virus or spam detection. Graphics Processor Units (GPUs) excel at executing massively parallel workloads. Regular expression (regex) matching is typically performed by simulating the execution of deterministic finite automata (DFAs) or nondeterministic finite automata (NFAs). The natural implementations of these automata simulation algorithms on GPUs are highly inefficient because they give rise to irregular memory access patterns. This paper p

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Vigneshwari G, Jaya. "SAFE SAVOR." International Scientific Journal of Engineering and Management 04, no. 05 (2025): 1–9. https://doi.org/10.55041/isjem03832.

Der volle Inhalt der Quelle

Annotation:

Abstract - Food allergies are a considerable public-health consideration everywhere, particularly for people depending on online-shopping for groceries. Mistakes in labeling, information that is not structured, and not mentioning all the ingredients in the products' listing are partial reasons that lead to consumers being accidentally exposed to allergens. This thesis is to present Safe Savor, a Chrome-Extension created to identify allergens, their derivatives, and cross-reactive ingredients via studying products' ingredients section in real time on electronic commerce sites like Walmart. The

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Mehr Quellen

Dissertationen zum Thema "Regex matching"

Horký, Michal. "Rychlejší než grep pomocí čítačů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2021. http://www.nusl.cz/ntk/nusl-445473.

Der volle Inhalt der Quelle

Annotation:

Vyhledávání regulárních výrazů má ve vývoji softwaru nezastupitelné místo. Rychlost vyhledávání může ovlivnit použitelnost softwaru, a proto je na ni kladen velký důraz. Pro určité druhy regulárních výrazů mají standardní přístupy pro vyhledávání vysokou složitost. Kvůli tomu jsou náchylné k útokům založeným na vysoké náročnosti vyhledávání regulárních výrazů (takzvané ReDoS útoky). Regulární výrazy s omezeným opakováním, které se v praxi často vyskytují, jsou jedním z těchto druhů. Efektivní reprezentace a rychlé vyhledávání těchto regulárních výrazů je možné s použítím automatu s čítači. V t

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Carlsson, Emil. "Matching in MySQL : A comparison between REGEXP and LIKE." Thesis, Linnéuniversitetet, Institutionen för datavetenskap, fysik och matematik, DFM, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-20598.

Der volle Inhalt der Quelle

Annotation:

When needing to search for data in multiple datasets there is a risk that not all da-tasets are of the same type. Some might be in XML-format; others might use a re-lational database. This could frighten developers from using two separate datasets to search for the data in, because of the fact that crafting different search methods for different datasets can be time consuming. One option that is greatly overlooked is the usage of regular expressions. If a search expression is created it can be used in a majority of database engines as a “WHERE” statement and also in other form of data sources

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Bücher zum Thema "Regex matching"

McDonough, James. RegEx in ABAP: Pattern Matching with Regular Expressions. Rheinwerk Publishing Inc., 2015.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Aroraa, Gaurav. Learn C# in 7 days: Get up and running with C# 7 with async main, tuples, pattern matching, LINQ, regex, indexers, and more. Packt Publishing - ebooks Account, 2017.

Den vollen Inhalt der Quelle finden

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Buchteile zum Thema "Regex matching"

Holík, Lukáš, Juraj Síč, Lenka Turoňová, and Tomáš Vojnar. "Fast Matching of Regular Patterns with Synchronizing Counting." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30829-1_19.

Der volle Inhalt der Quelle

Annotation:

AbstractFast matching of regular expressions with bounded repetition, aka counting, such as $$\texttt {(ab)\{50,100\}}$$ ( ab ) { 50 , 100 } , i.e., matching linear in the length of the text and independent of the repetition bounds, has been an open problem for at least two decades. We show that, for a wide class of regular expressions with counting, which we call synchronizing, fast matching is possible. We empirically show that the class covers nearly all counting used in usual applications of regex matching. This complexity result is based on an improvement and analysis of a recent matching

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Alevoor, Praveen, Pratik Sarda, and Kalpesh Kapoor. "On Decidability and Matching Issues for Regex Languages." In Advances in Intelligent Systems and Computing. Springer India, 2013. http://dx.doi.org/10.1007/978-81-322-0740-5_18.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Fujinami, Hiroya, and Ichiro Hasuo. "Efficient Matching with Memoization for Regexes with Look-around and Atomic Grouping." In Programming Languages and Systems. Springer Nature Switzerland, 2024. http://dx.doi.org/10.1007/978-3-031-57267-8_4.

Der volle Inhalt der Quelle

Annotation:

AbstractRegular expression (regex) matching is fundamental in many applications, especially in web services. However, matching by backtracking—preferred by most real-world implementations for its practical performance and backward compatibility—can suffer from so-called catastrophic backtracking, which makes the number of backtracking super-linear and leads to the well-known ReDoS vulnerability. Inspired by a recent algorithm by Davis et al. that runs in linear time for (non-extended) regexes, we study efficient backtracking matching for regexes with two common extensions, namely look-around a

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Regex matching"

Deaton, Sean, David Brownfield, Leonard Kosta, Zhaozhong Zhu, and Suzanne J. Matthews. "Real-time regex matching with apache spark." In 2017 IEEE High-Performance Extreme Computing Conference (HPEC). IEEE, 2017. http://dx.doi.org/10.1109/hpec.2017.8091063.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Haghighat, Mohammad Hashem, and Jun Li. "Toward Fast Regex Pattern Matching Using Simple Patterns." In 2018 IEEE 24th International Conference on Parallel and Distributed Systems (ICPADS). IEEE, 2018. http://dx.doi.org/10.1109/padsw.2018.8644606.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Liu, Haoming, Lu Sun, Shaofeng Dong, Enlin Zhang, Wei Hu, and Jinsong Zhan. "Realization of regex expression matching algorithm based on list storage." In Ninth International Symposium on Sensors, Mechatronics, and Automation System (ISSMAS 2023), edited by Lijia Pan and Zaifa Zhou. SPIE, 2024. http://dx.doi.org/10.1117/12.3014985.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pan, Lian, Hao Yao, Zhipeng Li, and Yuyang Ren. "A code error correction system for PDF documents using regex and similarity matching." In 2022 IEEE 10th Joint International Information Technology and Artificial Intelligence Conference (ITAIC). IEEE, 2022. http://dx.doi.org/10.1109/itaic54216.2022.9836781.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Pant, Dipendra, Dhiraj Pokhrel, and Prakash Poudyal. "Automatic Software Engineering Position Resume Screening using Natural Language Processing, Word Matching, Character Positioning, and Regex." In 2022 5th International Conference on Advanced Systems and Emergent Technologies (IC_ASET). IEEE, 2022. http://dx.doi.org/10.1109/ic_aset53395.2022.9765916.

Der volle Inhalt der Quelle

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Kang, M. B., and K. A. Thole. "Flowfield Measurements in the Endwall Region of a Stator Vane." In ASME 1999 International Gas Turbine and Aeroengine Congress and Exhibition. American Society of Mechanical Engineers, 1999. http://dx.doi.org/10.1115/99-gt-188.

Der volle Inhalt der Quelle

Annotation:

A first stage stator vane experiences high heat transfer rates particularly near the end wall where strong secondary flows occur. In order to improve numerical predictions of the complex endwall flow at low speed conditions, benchmark quality experimental data are required. This study documents the flowfield in the endwall region of a stator vane that has been scaled up by a factor of nine while matching an engine exit Reynolds number of Reex = 1.2·106. Laser Doppler velocimeter (LDV) measurements of all three components of the mean and fluctuating velocities are presented for several flow pla

APA, Harvard, Vancouver, ISO und andere Zitierweisen

Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!