Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Bonichon, Richard"'
Autor:
Recoules, Frédéric, Bardin, Sébastien, Bonichon, Richard, Lemerre, Matthieu, Mounier, Laurent, Potet, Marie-Laure
Inline assembly is still a common practice in low-level C programming, typically for efficiency reasons or for accessing specific hardware resources. Such embedded assembly codes in the GNU syntax (supported by major compilers such as GCC, Clang and
Externí odkaz:
http://arxiv.org/abs/2102.07485
Code obfuscation aims at protecting Intellectual Property and other secrets embedded into software from being retrieved. Recent works leverage advances in artificial intelligence with the hope of getting blackbox deobfuscators completely immune to st
Externí odkaz:
http://arxiv.org/abs/2102.04805
Directed fuzzing focuses on automatically testing specific parts of the code by taking advantage of additional information such as (partial) bug stack trace, patches or risky operations. Key applications include bug reproduction, patch testing and st
Externí odkaz:
http://arxiv.org/abs/2002.10751
Code obfuscation is a major tool for protecting software intellectual property from attacks such as reverse engineering or code tampering. Yet, recently proposed (automated) attacks based on Dynamic Symbolic Execution (DSE) shows very promising resul
Externí odkaz:
http://arxiv.org/abs/1908.01549
Autor:
Recoules, Frédéric, Bardin, Sébastien, Bonichon, Richard, Mounier, Laurent, Potet, Marie-Laure
Formal methods for software development have made great strides in the last two decades, to the point that their application in safety-critical embedded software is an undeniable success. Their extension to non-critical software is one of the notable
Externí odkaz:
http://arxiv.org/abs/1903.06407
We focus in this paper on generating models of quantified first-order formulas over built-in theories, which is paramount in software verification and bug finding. While standard methods are either geared toward proving the absence of solution or tar
Externí odkaz:
http://arxiv.org/abs/1802.05616
Autor:
Bonichon, Richard, Hermant, Olivier
We prove the syntactic soundness of classical tableaux with free variables and on-the-fly Skolemization. Soundness proofs are usually built from semantic arguments, and this is to our knowledge, the first proof that appeals to syntactic means. We act
Externí odkaz:
http://arxiv.org/abs/1505.06376
Publikováno v:
ACM International Conference Proceeding Series; 12/9/2019, p1-8, 8p
Autor:
Bonichon, Richard, Weis, Pierre
Publikováno v:
28ièmes Journées Francophones des Langages Applicatifs
28ièmes Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France
28ièmes Journées Francophones des Langages Applicatifs, Jan 2017, Gourette, France
International audience; Pretty-printing can be described as finding a good-looking solution to typeset data according to a set of formatting conventions. Oppen [6] pioneered the field with an algorithmic solution to pretty-printing, using the notions
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0db6b39b6cf3de6b7ea603ec5107855b
https://hal.archives-ouvertes.fr/hal-01503081/document
https://hal.archives-ouvertes.fr/hal-01503081/document
Publikováno v:
Formal Methods: Foundations & Applications 17th Brazilian Symposium, SBMF 2014, Maceió, AL, Brazil, September 29--October 1, 2014. Proceedings; 2015, p1-16, 16p