logo


RegexScalpel: Regular Expression Denial of Service (ReDoS) Defense by Localize-and-Fix.
Y. Li, Y. Sun, Z. Xu, J. Cao, Y. Li, R. Li, H. Chen, S. Cheung, Y. Liu, Y. Xiao. The 31st USENIX Security Symposium (USENIX Security 2022), pp. 4183-4200.https://www.usenix.org/system/files/sec22-li-yeting.pdf.


SemMT: A Semantic-based Testing Approach for Machine Translation Systems.
J. Cao, M. Li, Y. Li, M. Wen, S. Cheung, H. Chen. 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.


Learning Disjunctive Multiplicity Expressions and Disjunctive Generalize Multiplicity Expressions From Both Positive and Negative Examples.
Y. Li, H. Chen, Z. Chen. The Computer Journal. https://academic.oup.com/comjnl/advance-article-abstract/doi/10.1093/comjnl/bxac037/6569539.


TransRegex: multi-modal regular expression synthesis by generate-and-repair.
Y. Li, S. Li, Z. Xu, J. Cao, Z. Chen, Y. Hu, H. Chen, S. Cheung. The 43rd International Conference on Software Engineering (ICSE 2021), pp. 1210-1222.


Learning Finite Automata with Shuffle.
X. Wang. The 25th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2021), LNAI 12713, pp. 308-320, 2021.


Inferring Deterministic Regular Expression with Unorder and Counting.
X. Wang. The 26th International Conference on Database Systems for Advanced Applications (DASFAA 2021), LNCS 12682, pp. 235-252, 2021.


FlashRegex: deducing anti-ReDoS regexes from examples.
Y. Li, Z. Xu, J. Cao, H. Chen, T. Ge, S. Cheung, H. Zhao. The 35th IEEE/ACM International Conference on Automated Software Engineering (ASE 2020), pp.659-671.


Inclusion algorithms for one-unambiguous regular expressions and their applications.
H. Chen, Z.Xu. Science of Computer Programming 193 (2020), Available online 10 March 2020.


Inferring restricted regular expressions with interleaving from positive and negative samples.
Y. Li, H. Chen, L. Zhang, B. Huang and J. Zhang. The 24th Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD 2020), LNAI 12085, pp. 769–781, 2020.


FlashSchema: achieving high quality XML schemas with powerful inference algorithms and large-scale schema data.
Y. Li, J. Cao, H. Chen, T. Ge, Z. Xu, Q. Peng. 36th IEEE International Conference on Data Engineering (ICDE 2020), pp.1962-1965., 2020.


Grammars and a random generator for deterministic chain regular expressions.
X. Chu, P. Lu, and H. Chen. 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), SRF, pp.49-60, 2020.


Inferring deterministic regular expression with unorder.
X. Wang, H. Chen. 46th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2020), LNCS 12011, pp. 325–337, 2020.


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


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


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


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


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


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


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


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


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


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


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


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


Towards an Effective Syntax for Deterministic Regular Expressions.
H. Chen, P. Lu, Z. Xu. Technical Report, ISCAS-SKLCS-18-02, February 2018. http://lcs.ios.ac.cn/~chm/papers/paper.pdf


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


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


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


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


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


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


The complexity of SORE-definability problems.
P. Lu, Z. Wu, and H. Chen. The 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.


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


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


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


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


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


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


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


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


Polymorphic functions with set-theoretic types. Part 2: Local Type Inference and Type Reconstruction.
G. Castagna, K. Nguyen, Z. Xu, P. Abate. In POPL ’15, January 2015.


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


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


Polymorphic functions with set-theoretic types. Part 1: Syntax, semantics, and evaluation.
G. Castagna, K. Nguyen, Z. Xu, H. Im, S. Lenglet, and L. Padovani. In POPL ’14, January 2014.


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


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


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


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


View determinacy for preserving selected information in data transformations.
W. Fan, F. Geerts and L. Zheng. Information Systems. 37(1):1-12. 2012.


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


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


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


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


Set-theoretic Foundation of Parametric Polymorphism and Subtyping.
G. Castagna and Z. Xu. In ICFP ’11, 94-106, 2011.


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


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


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


Finite automata of expressions in the case of star normal form and one-unambiguity.
H. Chen. Technical report, June 2010. http://lcs.ios.ac.cn/~chm/papers/refullver-tr.pdf


Derivatives of regular expressions.
H. Chen. Technical report ISCAS-SKLCS-09-11, State Key Laborotary of Computer Science, 2009. http://lcs.ios.ac.cn/~chm/papers/derivative-tr200910.pdf


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


A sentence generation algorithm for testing grammars.
L. Zheng, D. Wu. COMPSAC 2009, 2009.


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


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


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


上下文无关语言句子的反向自然枚举.
戴晓君. 计算机工程与设计, 29(8), 1874-1877, 2008.


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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




Last updated: 2022-07-26丨Copyright © DEPSO丨京ICP备 2021018805号-1