Stop the war!
Остановите войну!
for scientists:
default search action
BibTeX records: Thanh Dinh Ta
@inproceedings{DBLP:conf/issta/DavidBFMPTM16, author = {Robin David and S{\'{e}}bastien Bardin and Josselin Feist and Laurent Mounier and Marie{-}Laure Potet and Thanh Dinh Ta and Jean{-}Yves Marion}, editor = {Andreas Zeller and Abhik Roychoudhury}, title = {Specification of concretization and symbolization policies in symbolic execution}, booktitle = {Proceedings of the 25th International Symposium on Software Testing and Analysis, {ISSTA} 2016, Saarbr{\"{u}}cken, Germany, July 18-20, 2016}, pages = {36--46}, publisher = {{ACM}}, year = {2016}, url = {https://doi.org/10.1145/2931037.2931048}, doi = {10.1145/2931037.2931048}, timestamp = {Tue, 06 Nov 2018 16:57:30 +0100}, biburl = {https://dblp.org/rec/conf/issta/DavidBFMPTM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/wcre/DavidBTMFPM16, author = {Robin David and S{\'{e}}bastien Bardin and Thanh Dinh Ta and Laurent Mounier and Josselin Feist and Marie{-}Laure Potet and Jean{-}Yves Marion}, title = {{BINSEC/SE:} {A} Dynamic Symbolic Execution Toolkit for Binary-Level Analysis}, booktitle = {{IEEE} 23rd International Conference on Software Analysis, Evolution, and Reengineering, {SANER} 2016, Suita, Osaka, Japan, March 14-18, 2016 - Volume 1}, pages = {653--656}, publisher = {{IEEE} Computer Society}, year = {2016}, url = {https://doi.org/10.1109/SANER.2016.43}, doi = {10.1109/SANER.2016.43}, timestamp = {Fri, 24 Mar 2023 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/wcre/DavidBTMFPM16.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@phdthesis{DBLP:phd/hal/Ta15, author = {Thanh Dinh Ta}, title = {Malicious Codes Detection in Distributed Environments. (Mod{\`{e}}le de protection contre les codes malveillants dans un environnement distribu{\'{e}})}, school = {University of Lorraine, Nancy, France}, year = {2015}, url = {https://tel.archives-ouvertes.fr/tel-01751547}, timestamp = {Fri, 03 Sep 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/phd/hal/Ta15.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/fps/BonfanteMT14, author = {Guillaume Bonfante and Jean{-}Yves Marion and Thanh Dinh Ta}, editor = {Fr{\'{e}}d{\'{e}}ric Cuppens and Joaqu{\'{\i}}n Garc{\'{\i}}a{-}Alfaro and Nur Zincir{-}Heywood and Philip W. L. Fong}, title = {Malware Message Classification by Dynamic Analysis}, booktitle = {Foundations and Practice of Security - 7th International Symposium, {FPS} 2014, Montreal, QC, Canada, November 3-5, 2014. Revised Selected Papers}, series = {Lecture Notes in Computer Science}, volume = {8930}, pages = {112--128}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-17040-4\_8}, doi = {10.1007/978-3-319-17040-4\_8}, timestamp = {Fri, 08 Dec 2023 07:53:07 +0100}, biburl = {https://dblp.org/rec/conf/fps/BonfanteMT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/tamc/PechouxT14, author = {Romain P{\'{e}}choux and Thanh Dinh Ta}, editor = {T. V. Gopal and Manindra Agrawal and Angsheng Li and S. Barry Cooper}, title = {A Categorical Treatment of Malicious Behavioral Obfuscation}, booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference, {TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {8402}, pages = {280--299}, publisher = {Springer}, year = {2014}, url = {https://doi.org/10.1007/978-3-319-06089-7\_20}, doi = {10.1007/978-3-319-06089-7\_20}, timestamp = {Wed, 07 Dec 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/conf/tamc/PechouxT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.