Zobrazeno 1 - 10
of 48
pro vyhledávání: '"Cristian Cadar"'
This is the official artifact of the paper: GrayC: Greybox Fuzzing of Compilers and Analysers for C (ISSTA 2023). =======> DOWNLOAD THE ARTIFACT IN THE DOCKER IMAGE TO START The main GitHub Repository is: https://github.com/srg-imperial/GrayC/tree/ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09a2c2861c9861fa86c2aaa58a216f4d
Publikováno v:
International Symposium on Software Testing and Analysis (ISSTA 2022)
Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis
Proceedings of the 31st ACM SIGSOFT International Symposium on Software Testing and Analysis
This paper reports on our experience implementing a technique for sifting through static analysis reports using dynamic symbolic execution. Our insight is that if a static analysis tool produces a partial trace through the program under analysis, ann
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::274614e5a56e31d184bbcfa924d7e017
http://hdl.handle.net/10044/1/97427
http://hdl.handle.net/10044/1/97427
Publikováno v:
Empirical Software Engineering
Compiler fuzzing techniques require a means of generating programs that are free from undefined behaviour (UB) to reliably reveal miscompilation bugs. Existing program generators such as Csmith achieve UB-freedom by heavily restricting the form of ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ab9a34bf05f7caf2c56d99fa6437c024
http://hdl.handle.net/10044/1/96987
http://hdl.handle.net/10044/1/96987
Autor:
Paul-Antoine Arras, Anastasios Andronidis, Luís Pina, Karolis Mituzas, Qianyi Shu, Daniel Grumberg, Cristian Cadar
Publikováno v:
International Journal on Software Tools for Technology Transfer
Binary rewriting consists in disassembling a program to modify its instructions. However, existing solutions suffer from shortcomings in terms of soundness and performance. We present SaBRe, a load-time system for selective binary rewriting. SaBRe re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e5ed84a2c81ae264a50045780ea76b36
http://hdl.handle.net/10044/1/94548
http://hdl.handle.net/10044/1/94548
Publikováno v:
IEEE Software
—Fuzzing is a method to discover software bugs and vulnerabilities by automatic test input generation which has found tremendous recent interest in both academia and industry. Fuzzing comes in the form of several techniques. On one hand, we have sy
Publikováno v:
ASE
IEEE/ACM International Conference on Automated Software Engineering (ASE 2020)
Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering
IEEE/ACM International Conference on Automated Software Engineering (ASE 2020)
Proceedings of the 35th IEEE/ACM International Conference on Automated Software Engineering
Symbolic execution is a well established technique for software testing and analysis. However, scalability continues to be a challenge, both in terms of constraint solving cost and path explosion. In this work, we present a novel approach for symboli
Publikováno v:
ISSTA
Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis
29th ACM SIGSOFT International Symposium on Software Testing and Analysis
Proceedings of the 29th ACM SIGSOFT International Symposium on Software Testing and Analysis
29th ACM SIGSOFT International Symposium on Software Testing and Analysis
When symbolic execution is used to analyse real-world applications, it often consumes all available memory in a relatively short amount of time, sometimes making it impossible to analyse an application for an extended period. In this paper, we presen
Publikováno v:
IEEE/ACM International Conference on Automated Software Engineering, New Ideas and Emerging Results Track (ASE-NIER 2020)
ASE
ASE
Randomised compiler testing techniques require a means of generating programs that are free from undefined behaviour (UB) in order to reliably reveal miscompilation bugs. Existing program generators such as Csmith heavily restrict the form of generat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7c3a955ebfc9955b9ec59543db611c5f
http://hdl.handle.net/10044/1/83376
http://hdl.handle.net/10044/1/83376
Autor:
Cristian Cadar, Martin Nowack
KLEE is a popular dynamic symbolic execution engine, initially designed at Stanford University and now primarily developed and maintained by the Software Reliability Group at Imperial College London. KLEE has a large community spanning both academia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4fbefb228ab28c244c57327a06db0f97
http://hdl.handle.net/10044/1/83346
http://hdl.handle.net/10044/1/83346
Publikováno v:
Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering
ESEC/SIGSOFT FSE
European Software Engineering Conference / ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 2020)
ESEC/SIGSOFT FSE
European Software Engineering Conference / ACM SIGSOFT Symposium on the Foundations of Software Engineering (ESEC/FSE 2020)
We propose a novel fine-grained integration of pointer analysis with dynamic analysis, including dynamic symbolic execution. This is achieved via past-sensitive pointer analysis, an on-demand pointer analysis instantiated with an abstraction of the d