Haiming Chen

Zixuan Chen

Comput. J., July, 2023

Grammar construction methods for extended deterministic expressions.

[BibT_eX]

[DOI]

CoRR, 2023

Deducing Matching Strings for Real-World Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2023

Modeling Regex Operators for Solving Regex Crossword Puzzles.

[BibT_eX]

[DOI]

Proceedings of the Dependable Software Engineering. Theories, Tools, and Applications, 2023

Decompilation Based Deep Binary-Source Function Matching.

[BibT_eX]

[DOI]

Proceedings of the Science of Cyber Security - 5th International Conference, 2023

Algorithms for Checking Intersection Non-emptiness of Regular Expressions.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2023, 2023

2022

SemMT: A Semantic-Based Testing Approach for Machine Translation Systems.

[BibT_eX]

[DOI]

ACM Trans. Softw. Eng. Methodol., 2022

RegexScalpel: Regular Expression Denial of Service (ReDoS) Defense by Localize-and-Fix.

[BibT_eX]

[DOI]

Proceedings of the 31st USENIX Security Symposium, 2022

2021

ReDoSHunter: A Combined Static and Dynamic Approach for Regular Expression DoS Detection.

[BibT_eX]

[DOI]

Proceedings of the 30th USENIX Security Symposium, 2021

TRANSREGEX: Multi-modal Regular Expression Synthesis by Generate-and-Repair.

[BibT_eX]

[DOI]

Proceedings of the 43rd IEEE/ACM International Conference on Software Engineering, 2021

2020

Inclusion algorithms for one-unambiguous regular expressions and their applications.

[BibT_eX]

[DOI]

Zhiwu Xu

Sci. Comput. Program., 2020

Inferring Deterministic Regular Expression with Unorder.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2020: Theory and Practice of Computer Science, 2020

Grammars and a Random Generator for Deterministic Chain Regular Expressions.

[BibT_eX]

[DOI]

Xinyu Chu

Proceedings of the SOFSEM 2020 Doctoral Student Research Forum co-located with the 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), 2020

Inferring Restricted Regular Expressions with Interleaving from Positive and Negative Samples.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2020

FlashRegex: Deducing Anti-ReDoS Regexes from Examples.

[BibT_eX]

[DOI]

Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering, 2020

FlashSchema: Achieving High Quality XML Schemas with Powerful Inference Algorithms and Large-scale Schema Data.

[BibT_eX]

[DOI]

Proceedings of the 36th IEEE International Conference on Data Engineering, 2020

2019

Learning Restricted Regular Expressions with Interleaving.

[BibT_eX]

[DOI]

Chunmei Dong

CoRR, 2019

Towards an Effective Syntax and a Generator for Deterministic Standard Regular Expressions.

[BibT_eX]

[DOI]

Zhiwu Xu

Comput. J., 2019

Learning Restricted Deterministic Regular Expressions with Counting.

[BibT_eX]

[DOI]

Proceedings of the Web Information Systems Engineering - WISE 2019, 2019

A Large-Scale Repository of Deterministic Regular Expression Patterns and Its Applications.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2019

Learning a Subclass of Deterministic Regular Expression with Counting.

[BibT_eX]

[DOI]

Proceedings of the Knowledge Science, Engineering and Management, 2019

An effective algorithm for learning single occurrence regular expressions with interleaving.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Database Applications & Engineering Symposium, 2019

Context-Free Grammars for Deterministic Regular Expressions with Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2019 - 16th International Colloquium, Hammamet, Tunisia, October 31, 2019

Learning k-Occurrence Regular Expressions from Positive and Negative Samples.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Modeling - 38th International Conference, 2019

Learning k-Occurrence Regular Expressions with Interleaving.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2019

Learning DMEs from Positive and Negative Examples.

[BibT_eX]

[DOI]

Proceedings of the Database Systems for Advanced Applications, 2019

2018

Inference of a Concise Regular Expression Considering Interleaving from XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2018

Practical Study of Deterministic Regular Expressions from Large-scale XML and Schema Data.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Database Engineering & Applications Symposium, 2018

Inferring Deterministic Regular Expression with Counting.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Modeling - 37th International Conference, 2018

Learning Restricted Regular Expressions with Interleaving from XML Data.

[BibT_eX]

[DOI]

Proceedings of the Conceptual Modeling - 37th International Conference, 2018

Inferring Regular Expressions with Interleaving from XML Data.

[BibT_eX]

[DOI]

Proceedings of the Web and Big Data - Second International Joint Conference, 2018

Learning Concise Relax NG Schemas Supporting Interleaving from XML Documents.

[BibT_eX]

[DOI]

Proceedings of the Advanced Data Mining and Applications - 14th International Conference, 2018

2017

On trace languages generated by (small) spiking neural P systems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2017

The Complexity of SORE-definability Problems.

[BibT_eX]

[DOI]

Zhilin Wu

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

Derivatives and Finite Automata of Expressions in Star Normal Form.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2017

2016

Practical Study of Subclasses of Regular Expressions in DTD and XML Schema.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies and Applications - 18th Asia-Pacific Web Conference, 2016

2015

Deciding Determinism of Regular Languages.

[BibT_eX]

[DOI]

Joachim Bremer

Theory Comput. Syst., 2015

Deciding determinism of unary languages.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Checking determinism of regular expressions with counting.

[BibT_eX]

[DOI]

Inf. Comput., 2015

Deterministic Regular Expressions with Interleaving.

[BibT_eX]

[DOI]

Feifei Peng

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

Discovering Restricted Regular Expressions with Interleaving.

[BibT_eX]

[DOI]

Feifei Peng

Proceedings of the Web Technologies and Applications - 17th Asia-PacificWeb Conference, 2015

2013

Deciding Determinism of Unary Languages Is coNP-Complete.

[BibT_eX]

[DOI]

Feifei Peng

Proceedings of the Developments in Language Theory - 17th International Conference, 2013

2012

Derivatives of Regular Expressions and an Application.

[BibT_eX]

[DOI]

Sheng Yu

Proceedings of the Computation, Physics and Beyond, 2012

2011

A Toolkit for Generating Sentences from Context-Free Grammars.

[BibT_eX]

[DOI]

Zhiwu Xu

Lixiao Zheng

Int. J. Softw. Informatics, 2011

Determinacy and rewriting of conjunctive queries over unary database schemas.

[BibT_eX]

[DOI]

Lixiao Zheng

Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

Assisting the Design of XML Schema: Diagnosing Nondeterministic Content Models.

[BibT_eX]

[DOI]

Proceedings of the Web Technologies and Applications - 13th Asia-Pacific Web Conference, 2011

2010

Subtyping Algorithm of Regular Tree Grammars with Disjoint Production Rules.

[BibT_eX]

[DOI]

Lei Chen

Proceedings of the Theoretical Aspects of Computing, 2010

2009

A Systematic Framework for Grammar Testing.

[BibT_eX]

[DOI]

Lixiao Zheng

Proceedings of the 8th IEEE/ACIS International Conference on Computer and Information Science, 2009

2008

Spiking neural P systems with extended rules: universality and languages.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Nat. Comput., 2008

Basic research in computer science and software engineering at SKLCS.

[BibT_eX]

[DOI]

Frontiers Comput. Sci. China, 2008

Efficient Type Checking for a Subclass of Regular Expression Types.

[BibT_eX]

[DOI]

Lei Chen

Proceedings of the 9th International Conference for Young Computer Scientists, 2008

Inclusion Test Algorithms for One-Unambiguous Regular Expressions.

[BibT_eX]

[DOI]

Lei Chen

Proceedings of the Theoretical Aspects of Computing, 2008

2007

On String Languages Generated by Spiking Neural P Systems.

[BibT_eX]

[DOI]

Mario J. Pérez-Jiménez

Fundam. Informaticae, 2007

2006

Facilitating formal specification acquisition by using recursive functions on context-free languages.

[BibT_eX]

[DOI]

Knowl. Based Syst., 2006

Towards Practical Computable Functions on Context-Free Languages.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2006

On Trace Languages Generated by (Small) Spiking Neural P Systems.

[BibT_eX]

Proceedings of the 8th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2006, Las Cruces, New Mexico, USA, June 21, 2006

2004

Practical Type Checking of Functions Defined on Context-Free Languages.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2004

2002

Yet another meta-language for programming language processing.

[BibT_eX]

[DOI]

ACM SIGPLAN Notices, 2002

2001

Pattern Matching Compilation of Functions Defined in Context-Free Languages.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 2001

1999

Function Definition Language FDL and its implementation.

[BibT_eX]

[DOI]

J. Comput. Sci. Technol., 1999

1998

Combining CFG and Recursive Functions to Get a New Language.

[BibT_eX]

[DOI]