Bui Phi Diep

According to our database, Bui Phi Diep authored at least 9 papers between 2016 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Distributed bounded model checking.

Prantik Chatterjee, Subhajit Roy, Bui Phi Diep, Akash Lal

Formal Methods Syst. Des., December, 2024

2023

Chain-Free String Constraints (Technical Report).

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku

CoRR, 2023

2021

On Solving String Constraints.

Bui Phi Diep

PhD thesis, 2021

Solving Not-Substring Constraint withFlat Abstraction.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Denghang Hu, Wei-Lun Tsai, Zhilin Wu, Di-De Yen

Proceedings of the Programming Languages and Systems - 19th Asian Symposium, 2021

2020

Efficient handling of string-number conversion.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Julian Dolby, Petr Janku, Hsin-Hung Lin, Lukás Holík, Wei-Cheng Wu

Proceedings of the 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2020

2019

Chain-Free String Constraints.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep, Lukás Holík, Petr Janku

Proceedings of the Automated Technology for Verification and Analysis, 2019

2018

Trau: SMT solver for string constraints.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer

Proceedings of the 2018 Formal Methods in Computer Aided Design, 2018

2017

Flatten and conquer: a framework for efficient analysis of string constraints.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Yu-Fang Chen, Bui Phi Diep, Lukás Holík, Ahmed Rezine, Philipp Rümmer

Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

2016

Counter-Example Guided Program Verification.

Parosh Aziz Abdulla, Mohamed Faouzi Atig, Bui Phi Diep

Proceedings of the FM 2016: Formal Methods, 2016