{"id":"https://openalex.org/W2381033076","doi":"https://doi.org/10.1145/2906363.2907053","title":"Scalable DFA Compilation for High-Performance Regular-Expression Matching","display_name":"Scalable DFA Compilation for High-Performance Regular-Expression Matching","publication_year":2016,"publication_date":"2016-05-13","ids":{"openalex":"https://openalex.org/W2381033076","doi":"https://doi.org/10.1145/2906363.2907053","mag":"2381033076"},"language":"en","primary_location":{"id":"doi:10.1145/2906363.2907053","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2906363.2907053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053745443","display_name":"Jan van Lunteren","orcid":null},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Jan van Lunteren","raw_affiliation_strings":["IBM Research - Zurich R\u00fcschlikon, Switzerland"],"affiliations":[{"raw_affiliation_string":"IBM Research - Zurich R\u00fcschlikon, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053745443"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":null,"apc_paid":null,"fwci":0.946,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.72597329,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"10","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9926999807357788,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10911","display_name":"Chemical Synthesis and Analysis","score":0.9671000242233276,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8667098879814148},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.7828193306922913},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.713009238243103},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.6957217454910278},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.6010327339172363},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.5882635116577148},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.5809667110443115},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5798428058624268},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5062674283981323},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.47787919640541077},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.45341193675994873},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.43702957034111023},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.42971330881118774},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.4180782437324524},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.382085382938385},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3454456925392151},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31209129095077515},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24490967392921448},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.14630553126335144},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.12197580933570862},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08219829201698303}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8667098879814148},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.7828193306922913},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.713009238243103},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.6957217454910278},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.6010327339172363},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.5882635116577148},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.5809667110443115},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5798428058624268},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5062674283981323},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.47787919640541077},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.45341193675994873},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.43702957034111023},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.42971330881118774},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.4180782437324524},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.382085382938385},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3454456925392151},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31209129095077515},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24490967392921448},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.14630553126335144},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.12197580933570862},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08219829201698303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2906363.2907053","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2906363.2907053","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 19th International Workshop on Software and Compilers for Embedded Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.5799999833106995,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1707172707","https://openalex.org/W1980938256","https://openalex.org/W2002089154","https://openalex.org/W2003250112","https://openalex.org/W2030102079","https://openalex.org/W2036765207","https://openalex.org/W2054276572","https://openalex.org/W2073709434","https://openalex.org/W2078792382","https://openalex.org/W2079329309","https://openalex.org/W2083826366","https://openalex.org/W2085004071","https://openalex.org/W2096474000","https://openalex.org/W2103933781","https://openalex.org/W2108962885","https://openalex.org/W2113422425","https://openalex.org/W2115345034","https://openalex.org/W2119423764","https://openalex.org/W2133654146","https://openalex.org/W2139418336","https://openalex.org/W2153244370","https://openalex.org/W2167971042","https://openalex.org/W2170523504","https://openalex.org/W4242309756"],"related_works":["https://openalex.org/W3143588635","https://openalex.org/W4249650827","https://openalex.org/W2115419634","https://openalex.org/W2090734721","https://openalex.org/W2160879187","https://openalex.org/W1560450186","https://openalex.org/W2111868903","https://openalex.org/W2089302579","https://openalex.org/W1428391281","https://openalex.org/W2146605784"],"abstract_inverted_index":{"Regular-expression":[0],"accelerators":[1,49],"often":[2],"rely":[3],"on":[4,51],"sophisticated":[5],"compilers":[6],"to":[7,62,69,91],"fully":[8],"exploit":[9,64],"the":[10,32,73,79,108,115],"available":[11],"hardware":[12],"capabilities":[13],"for":[14,31],"achieving":[15,102],"wire-speed":[16],"scan":[17],"rates":[18],"of":[19,22,35,72,97,99,107,114],"multiple":[20],"tens":[21,96],"gigabits":[23],"per":[24],"second.":[25],"This":[26],"paper":[27],"presents":[28],"a":[29,112],"method":[30],"efficient":[33],"compilation":[34,57,85],"pattern-matching":[36],"functions":[37],"specified":[38],"by":[39],"deterministic":[40],"finite":[41],"automata":[42],"(DFAs)":[43],"into":[44],"executable":[45],"structures":[46,77],"targeted":[47],"at":[48],"based":[50],"B-FSM":[52],"programmable":[53],"state":[54],"machines.":[55],"The":[56,87],"scheme":[58],"presented":[59],"is":[60],"able":[61],"effectively":[63],"an":[65,103],"adaptive":[66],"compression":[67],"mechanism":[68],"obtain":[70],"one":[71],"most":[74],"compact":[75],"state-transition-table":[76],"in":[78,81],"industry,":[80],"combination":[82],"with":[83],"fast":[84],"times.":[86],"heuristic-based":[88],"approach":[89],"scales":[90],"very":[92],"large":[93],"DFAs":[94],"having":[95],"millions":[98],"transitions,":[100],"while":[101],"approximately":[104],"linear":[105],"growth":[106],"storage":[109],"needs":[110],"as":[111],"function":[113],"DFA":[116],"size.":[117]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}