Interoperability in Blockchain: A Survey

Autor: Kunpeng Ren, Nhut-Minh Ho, Dumitrel Loghin, Thanh-Toan Nguyen, Beng Chin Ooi, Quang-Trung Ta, Feida Zhu

Publikováno v: IEEE Transactions on Knowledge and Data Engineering. :1-20

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::a7836831468cbb4f7aaff1a190969a51
https://doi.org/10.1109/tkde.2023.3275220

Towards Systematic and Dynamic Task Allocation for Collaborative Parallel Fuzzing

Autor: Van-Thuan Pham, Manh-Dung Nguyen, Quang-Trung Ta, Toby Murray, Benjamin I.P. Rubinstein

Publikováno v: 2021 36th IEEE/ACM International Conference on Automated Software Engineering (ASE).

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::da502d1302d971cda069893b4c7f8f9f
https://doi.org/10.1109/ase51524.2021.9678810

Automated Repair of Heap-Manipulating Programs Using Deductive Synthesis

Autor: Ilya Sergey, Quang-Trung Ta, Wei-Ngan Chin, Thanh-Toan Nguyen

Publikováno v: Lecture Notes in Computer Science ISBN: 9783030670665
VMCAI

We propose a novel method to automatically repairing buggy heap-manipulating programs using constraint solving and deductive synthesis. Given an input program \({\texttt {C}}\) and its formal specification in the form of a Hoare triple: \({\{{\mathca

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7109547a96fda52e933078d182b386cc
https://doi.org/10.1007/978-3-030-67067-2_17

Automated lemma synthesis in symbolic-heap separation logic

Autor: Wei-Ngan Chin, Siau-Cheng Khoo, Quang-Trung Ta, Ton Chanh Le

Publikováno v: Proceedings of the ACM on Programming Languages. 2:1-29

The symbolic-heap fragment of separation logic has been actively developed and advocated for verifying the memory-safety property of computer programs. At present, one of its biggest challenges is to effectively prove entailments containing inductive

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dc9271a9f36f61d3d2f7150cde8bd59c
https://doi.org/10.1145/3158097

SL-COMP: Competition of Solvers for Separation Logic

Autor: Adam Rogalewicz, Chong Gao, Michal Cyprian, Juan Antonio Navarro Pérez, Quang-Trung Ta, Wei-Ngan Chin, Mihaela Sighireanu, Nikos Gorogiannis, Tomáš Vojnar, Thomas Noll, Andrew Reynolds, Ondrej Lengál, Ton Chanh Le, Quang Loc Le, Constantin Enea, Andrey Rybalchenko, Jens Katelaan, Thanh-Toan Nguyen, Zhilin Wu, Christoph Matheja, Siau-Cheng Khoo, Radu Iosif, Florian Zuleger, Cristina Serban

Publikováno v: Tools and Algorithms for the Construction and Analysis of Systems-25 Years of {TACAS:} TOOLympics, Held as Part of {ETAPS} 2019
Tools and Algorithms for the Construction and Analysis of Systems-25 Years of TOOLympics, Held as Part of 2019, Apr 2019, Prague, Czech Republic. pp.116-132, ⟨10.1007/978-3-030-17502-3_8⟩
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783030175016
TACAS (3)

International audience; SL-COMP aims at bringing together researchers interested on improving the state of the art of the automated deduction methods for Separation Logic (SL). The event took place twice until now and collected more than 1K problems

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::430f3459dc4dd84c205e9a65fbc661b3
https://hal.archives-ouvertes.fr/hal-02388022