Counter-Example Guided Program Verification. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bui Phi Diep (FM, 2016)

Flatten and conquer: a framework for efficient analysis of string constraints. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Yu-Fang Chen 001; Bui Phi Diep; Lukás Holík; Ahmed Rezine; Philipp Rümmer (PLDI, 2017)

Trau: SMT solver for string constraints. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Yu-Fang Chen 001; Bui Phi Diep; Lukás Holík; Ahmed Rezine; Philipp Rümmer (FMCAD, 2018)

Chain-Free String Constraints. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bui Phi Diep; Lukás Holík; Petr Janku (ATVA, 2019)

Efficient handling of string-number conversion. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Yu-Fang Chen 001; Bui Phi Diep; Julian Dolby; Petr Janku; Hsin-Hung Lin; Lukás Holík; Wei-Cheng Wu (PLDI, 2020)

Solving Not-Substring Constraint withFlat Abstraction. - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Yu-Fang Chen 001; Bui Phi Diep; Lukás Holík; Denghang Hu; Wei-Lun Tsai; Zhilin Wu; Di-De Yen (APLAS, 2021)

On Solving String Constraints. - Bui Phi Diep (2021)

Chain-Free String Constraints (Technical Report). - Parosh Aziz Abdulla; Mohamed Faouzi Atig; Bui Phi Diep; Lukás Holík; Petr Janku (CoRR, 2023)

Distributed bounded model checking. - Prantik Chatterjee; Subhajit Roy 001; Bui Phi Diep; Akash Lal (Formal Methods Syst. Des., 2024)