Selected Recent Publications

• Y. Yan, W. Su, L. Zheng, M. Wang, H. Chen, C. Peng, R. Li, Z. Chen. Deducing Matching Strings for Real-World Regular Expressions. The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA 2023), LNCS 14464, pp. 331–350, 2024.
• W. Su, H. Chen, R. Li, Z. Chen. Modeling Regex Operators for Solving Regex Crossword Puzzles. The Symposium on Dependable Software Engineering: Theories, Tools and Applications (SETTA 2023), LNCS 14464, pp. 206–225, 2024. (Best Paper Award)
• W. Su, R. Li, C. Peng, H. Chen. Algorithms for Checking Intersection Non-emptiness of Regular Expressions. The 20th International Colloquium on Theoretical Aspects of Computing (ICTAC 2023), LNCS 14446, pp. 216–235, 2023.
• Xiaowei Wang, ZimuYuao, Yang Xiao, Liyan Wang, Weican Yao, Haiming Chen, Wei Huo. Decompilation Based Deep Binary-Source Function Matching . The 5th International Conference on Science of Cyber Security ( SciSec 2023) , 2023.
• 郑黎晓，余李林，陈海明，陈祖希，骆翔宇. 基于变异的正则表达式反例串生成算法. 软件学报, 2023. 在线出版时间: 2023-08-30.
• Y. Li, Y. Sun, Z. Xu, J. Cao, Y. Li, R. Li, H. Chen, S. Cheung, Y. Liu, Y. Xiao. RegexScalpel: Regular Expression Denial of Service (ReDoS) Defense by Localize-and-Fix. The 31st USENIX Security Symposium (USENIX Security 2022), pp. 4183-4200.
• Y. Li, H. Chen, Z. Chen. Learning disjunctive multiplicity expressions and disjunctive generalize multiplicity expressions from both positive and negative examples. The Computer Journal, https://academic.oup.com/comjnl/advance-article/doi/10.1093/comjnl/bxac037/6569539?guestAccessKey=c1dd02d5-6c3a-40b1-b608-91c73f2a4a64.
• J. Cao, M. Li, Y. Li, M. Wen, S. Cheung, H. Chen. SemMT: a semantic-based testing approach for machine translation systems. ACM Transactions on Software Engineering and Methodology, Volume 31, Issue 2, April 2022, Article No.: 34e, pp, 1–36. https://doi.org/10.1145/3490488.
• Y. Li, Z. Chen, J. Cao, Z. Xu, Q. Peng, H. Chen, L. Chen S. Cheung. ReDoSHunter: A Combined Static and Dynamic Approach for Regular Expression DoS Detection. The 30th USENIX Security Symposium (USENIX Security 2021), pp. 3847-3864.
• Y. Li, S. Li, Z. Xu, J. Cao, Z. Chen, Y. Hu, H. Chen, S. Cheung. TransRegex: multi-modal regular expression synthesis by generate-and-repair. The 43rd International Conference on Software Engineering (ICSE 2021), pp. 1210-1222.
• Y. Li, Z. Xu, J. Cao, H. Chen, T. Ge, S. Cheung, H. Zhao. FlashRegex: deducing anti-ReDoS regexes from examples. The 35th IEEE/ACM International Conference on Automated Software Engineering (ASE 2020), pp.659-671.
• H. Chen, Z.Xu. Inclusion algorithms for one-unambiguous regular expressions and their applications. Science of Computer Programming 193 (2020), Available online 10 March 2020.
• Y. Li, H. Chen, L. Zhang, B. Huang and J. Zhang. Inferring restricted regular expressions with interleaving from positive and negative samples. The 24th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2020), LNAI 12085, pp. 769–781, 2020.
• Y. Li, J. Cao, H. Chen, T. Ge, Z. Xu, Q. Peng. FlashSchema: achieving high quality XML schemas with powerful inference algorithms and large-scale schema data. 36th IEEE International Conference on Data Engineering (ICDE 2020), pp.1962-1965., 2020.
• X. Chu, P. Lu, and H. Chen. Grammars and a random generator for deterministic chain regular expressions. 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), SRF, pp.49-60, 2020.
• X. Wang, H. Chen. Inferring deterministic regular expression with unorder. 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS 12011, pp. 325–337, 2020.

· X. Wang, H. Chen. Learning restricted deterministic regular expressions with counting. The 20th International Conference on Web Information Systems Engineering (WISE’19), LNCS 11881, pp. 98–114, 2019.

· X. Mou, H. Chen, Y. Li. Context-free grammars for deterministic regular expressions with interleaving. The 16th International Colloquium on Theoretical Aspects of Computing (ICTAC 2019,), LNCS 11884, pp. 235–252, 2019.

· X. Wang, H. Chen. Learning a subclass of deterministic regular expression with counting. The 12th International Conference on Knowledge Science, Engineering and Management (KSEM 2019), LNAI 11775, pp. 341–348.

· Y. Li, X. Mou, H. Chen. Learning $k$-occurrence regular expressions from positive and negative samples. The 38th International Conference on Conceptual Modeling (ER 2019), LNCS 11788, pp. 264–272, 2019.

· Z. Xu, P. Lu, H. Chen. Towards an effective syntax and a generator for deterministic standard regular expressions. The Computer Journal, 62(9) (2019), 1322-1341. https://academic.oup.com/comjnl/article/62/9/1322/5165111?guestAccessKey=2be83a97-3a4e-473f-8660-99c61b171730

· Y. Li, H. Chen, X. Zhang, L. Zhang. An effective algorithm for learning single occurrence regular expressions with interleaving. Proceedings of the 23rd International Database Engineering & Applications Symposium (IDEAS 2019), pp.189-198.

· Y. Li, X. Zhang, J. Cao, H. Chen, and C. Gao. Learning $k$-occurrence regular expressions with interleaving. The 24th International Conference on Database Systems for Advanced Applications (DASFAA 2019), LNCS 11447, pp. 70–85, 2019.

· Y. Li, C. Dong, X. Chu, and H. Chen. Learning DMEs from positive and negative examples. The 24th International Conference on Database Systems for Advanced Applications (DASFAA 2019), LNCS 11448, pp. 434–438, 2019.

· H. Chen, Y. Li, C. Dong, X. Chu, X. Mou, and W. Min. A large-scale repository of deterministic regular expression patterns and its applications. The 23rd Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2019), LNAI 11441, pp. 249–261, 2019.

· C. Dong, Y. Li, X. Mou, and H. Chen. Learning restricted regular expressions with interleaving. 45th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2019), SRF, pp.13-24, 2019.

· Y. Li, X. Mou, X. Zhang and H. Chen. Learning concise Relax NG schemas supporting interleaving from XML documents. The 14th Advanced Data Mining and Applications (ADMA 2018), LNAI 11323, pp. 303–317, 2018.

· H. Chen, P. Lu, Z. Xu. Towards an Effective Syntax for Deterministic Regular Expressions. Technical Report, ISCAS-SKLCS-18-02, February 2018.

· Y. Li, X. Chu and H. Chen. Harvesting and analyzing large-scale real world data from the Web. Technical Report, ISCAS-SKLCS-18-01, Sept. 2018.

· Y. Li, X. Zhang, H. Xu, X. Mou, H. Chen. Learning restricted regular expressions with interleaving from XML data. The 37th International Conference on Conceptual Modeling (ER 2018), LNCS 11157, pp. 586–593, 2018.

· X. Wang and H. Chen. Inferring Deterministic Regular Expression with Counting. The 37th International Conference on Conceptual Modeling (ER 2018), LNCS 11157, pp. 184–199, 2018.

· X. Zhang, Y. Li, F. Tian, F. Cui, C. Dong, H. Chen. Inferring Regular Expressions with Interleaving from XML Data. APWEB-WAIM 2018, LNCS 10988, pp. 44–52, 2018.

· Y. Li, X. Chu, X. Mou, C. Dong, H. Chen. Practical Study of Deterministic Regular Expressions from Large-scale XML and Schema Data. Proceedings of the 22nd International Database Engineering & Applications Symposium (IDEAS 2018), pp. 45-53.

· X. Zhang, Y. Li, F. Cui, C. Dong, H. Chen. Inference of a Concise Regular Expression Considering Interleaving from XML documents. PAKDD 2018, LNAI 10938, pp. 389-401, 2018.

· P. Lu, Z. Wu, and H. Chen. The complexity of SORE-definability problems. 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Editors: Kim G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin; Article No. 22; pp. 22:1-22:15.

· H. Chen, P. Lu. Derivatives and Finite Automata of Expressions in Star Normal Form. The 11th International Conference on Language and Automata Theory and Applications (LATA 2017), LNCS 10168, 236-248, 2017.

· H. Chen, M. Ionescu, A. Pӑunc, Gh. Pӑun. On trace languages generated by (small) spiking neural P systems. Theoretical Computer Science 682 (2017) , 57-66.

· Y. Li, X. Zhang, F. Peng, H. Chen. Practical Study of Subclasses of Regular Expressions in DTD and XML Schema. APWeb 2016, Part II, LNCS 9932, 368–382, 2016.

· P. Lu, F. Peng, H. Chen, L. Zheng. Deciding Determinism of Unary Languages. Information and Computation, 245(2015), 181–196.

· F. Peng, H. Chen, X. Mou. Deterministic Regular Expressions with Interleaving. ICTAC 2015, LNCS 9399, 203-220, 2015.

· F. Peng, H. Chen. Discovering Restricted Regular Expressions with Interleaving. APWeb 2015, LNCS 9313, 104-115, 2015.

· H. Chen, P. Lu. Checking Determinism of Regular Expressions with Counting. Information and Computation, 241(2015), 302–320.

· P. Lu, J. Bremer, H. Chen. Deciding Determinism of Regular Languages. Theory Comput Syst  (2015) 57:97–139.

· 李慧松, 许智武, 陈海明. 改进的流不敏感的类型限定词推断. 《计算机科学》, 41(9): 178-184, 2014.

· 冯晓强, 郑黎晓, 陈海明. 一类受限正则表达式的推断算法. 《计算机科学》, 41(4): 178-183, 2014.

· 陈海明, 陆平.  确定型语言的相关研究综述. 《集成技术》, 2(6):65-70, 2013.

· P. Lu, F. Peng, H. Chen. Deciding determinism of unary languages is coNP-complete. DLT 2013, LNCS 7907, 350-361, 2013.

· H. Chen, P. Lu. Checking determinism of regular expressions with counting. DLT 2012, LNCS 7410, 332-343, 2012.

· H. Chen, S. Yu. Derivatives of regular expressions and an application. Theoretical Computer Science and Applications Conference (WTCS 2012), LNCS 7160, 343-356, 2012.

· Z. Xu, L. Zheng, H. Chen. A toolkit for generating sentences from context-free grammars. International Journal of Software and Informatics 5(4), 659- 676, 2011.

· L. Zheng, H. Chen. Determinacy and rewriting of conjunctive queries over unary database schemas. SAC'11, ACM,  1039-1044. 2011.

· L. Zheng, Z. Xu, H. Chen. Algorithm for generating short sentences from grammars based on branch coverage criterion. Journal of Software, 22(11), 2564-2576, 2011. (in Chinese)

· H. Chen, P. Lu. Assisting the design of XML Schema: diagnosing nondeterministic content models. APWeb 2011,  LNCS 6612, 301-312, 2011.

· Z. Xu, L. Zheng, H. Chen. A toolkit for generating sentences from context-free grammars. SEFM 2010, 118-112, 2010.

· L. Chen, H. Chen. Subtyping algorithm of regular tree grammars with disjoint production rules. ICTAC 2010,  LNCS 6255, 45-59, 2010.

· X. Dai, H. Chen. Subtyping algorithm with pruning optimization. Journal of Software, 2010, 21(7):1481-1490. (in Chinese)

· H. Chen. Finite automata of expressions in the case of star normal form and one-unambiguity. Technical report, June 2010.

· H. Chen. Derivatives of regular expressions. Technical report ISCAS-SKLCS-09-11, State Key Laborotary of Computer Science, 2009.

· L. Zheng, H. Chen, A systematic framework for grammar testing, 8th IEEE/ACIS International Conference on Computer and Information Science (ICIS 2009), 2009, Shanghai, China, 1013-1019.

· H. Chen, L. Chen, Inclusion test algorithms for one-unambiguous regular expressions, ICTAC 2008, LNCS 5160, Springer, 2008, 96-110.

· H. Chen, M. Ionescu, T.-O. Ishdorj, A. Paun, Gh. Paun, M. J. Perez-Jimenez. Spiking neural P systems with extended rules: universality and languages. Nat Comput (2008) 7:147-166, Springer.

· L. Chen, H. Chen, Efficient type checking for a subclass of regular expression types, ICYCS 2008, 1647-1653.

· H. Chen,  T.-O. Ishdorj, Gh. Paun. Computing along the axon. Progress in Natural Science, 17(4), 2007, 417-423.

· H. Chen, R. Freund, M. Ionescu, Gh. Paun, M. J. Perez-Jimenez. On string languages generated by spiking neural P systems. Fundamenta Informaticae 75 (2007), 2007, 141-162.

· H. Chen, T.-O. Ishdorj, Gh. Paun. M.J. Perez-Jimenez, Handling languages with spiking neural P systems with extended rules, Romanian J. Information Sci. and Technology, 9, 3 (2006), 151-162.

· H. Chen, M. Ionescu, A. Paun, Gh. Paun, B. Popa. On trace languages generated by (small) spiking neural P systems. DCFS 2006, 94-105.

· H. Chen, Y. Dong. Towards practical computable functions on context-free languages. TAMC 2006, LNCS 3959, 555-565, 2006.

· H. Chen, Y. Dong. Facilitating formal specification acquisition by using recursive functions on context-free languages. Knowledge-Based Systems, 19(2), pp. 141-151, 2006, Elsevier.

· H. Chen,  T.-O. Ishdorj, Gh. Paun. Computing along the axon. BIC-TA 2006, 60-70.

· D. Wu, L. Chen, H. Chen. Survey of sentence generation methods of context-free grammars. Computer Science, 33(8), 63-67, 2006. (in Chinese)

· Y. Shen, H. Chen. Sentence generation based on context-dependent rule coverage. Journal of Computer Engineering and Applications, 41(17), 96-100, 2005. (in Chinese)

· H. Chen. An encoding-based method for pattern-matching. Journal of Information & Computational Science 1: 2 (2004) pp.19-23, 2004.

· H. Chen, Y. Dong. Practical type checking of functions defined on context-free languages. Journal of Computer Science and Technology, 19(6), 2004, 840-847.

· H. Chen, Y. Dong. Facilitating formal specification acquisition by using recursive functions on context-free languages. SoMet_W04, 2004, 213-227.

· H. Chen. Evaluation algorithms of a new kind of recursive functions. Journal of Software, 15(9), 2004, 1277-1291. (In Chinese).

· H. Chen. An encoding-based method for pattern-matching. ISC&I 2004, 66-70.

· H. Chen, Y. Dong. Incorporating Static Type-Checking into Functions Defined on Context-Free Languages. SOFSEM 2004: Theory and Practice of Computer Science, 39-47.

· H. Chen. Statically typed XML processing by the LFC language. CIT 2003, 177-182.

· H. Chen, Y. Dong. Modeling and prototyping of software systems. SEA 2002, 617-622.

· H. Chen, Y. Dong. Yet another meta-language for programming language processing. ACM SIGPLAN Notices, 37(6), 2002, 28-37.

· H. Chen, Y. Dong. A formal specification language facilitating specification acquisition. Chinese Journal of Computers, 25(5), 2002, 459-466. (in Chinese)

· H. Chen, Y. Dong. Practical type checking of functions defined on context-free languages. ICYCS'2001, 1261-1263.

· H. Chen, Y. Dong. Pattern matching compilation of functions defined on context-free languages. Journal of Computer Science and Technology, 16(2), 2001, 159-167.

· Q. Zhang, H. Chen. A pattern matching method for simple patterns. Computer Engineering and Applications, 37(17), 63-66, 2001. (In Chinese)

· H. Chen, Y. Dong. Design of a formal specification language LFC. Proc. Conf. on Intelligent Computer Theme of 863 Hi-Tech Project,  2001, Beijing, China, 292-301. (In Chinese)

· H. Chen,Y. Dong. A representation of parse tree for context-free language. Journal of computer research & development, 37(10), 2000, 1179-1184. (In Chinese)

· Y. Dong, K. Li, H. Chen, Y. Dong, K. Li, H. Chen, Y. Hu, R. Zhang, R. Tang, Z. Wang, Z. Chen. Design and implementation of the formal specification acquisition system SAQ, Conf. on Software: Theory and Practice, IFIP 16th World Computer Congress 2000, 201-211, 2000.

· H. Chen, B. Jin. Methods for calculating intersections of Bezier curves and straight lines. 2nd National Workshop on Modern Scientific Computation, 2000, 28-29. (In Chinese)

· H. Chen. Design and implementation of function definition language FDL. Journal of Computer Science and Technology, 14(4), 1999, 414-421.

· H. Chen. Getting contours of two overlapped regions bounded by cubic Bezier curves and straight lines. Chinese J. of Advanced Software Research, 6(1), 1999, 84-94. Also in CAD/Graphics'97, Dec. 1997.