Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Timotej Kapus"'
Autor:
Ke Mao, Timotej Kapus, Lambros Petrou, Akos Hajdu, Matteo Marescotti, Andreas Loscher, Mark Harman, Dino Distefano
Publikováno v:
2022 IEEE Conference on Software Testing, Verification and Validation (ICST).
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:
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
Autor:
Cristian Cadar, Timotej Kapus
Publikováno v:
ESEC/SIGSOFT FSE
ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE ’19)
ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE ’19)
Symbolic execution is an effective technique for exploring paths in a program and reasoning about all possible values on those paths. However, the technique still struggles with code that uses complex heap data structures, in which a pointer is allow
Publikováno v:
PLDI
ACM SIGPLAN Conference on Programming Language Design and Implementation
ACM SIGPLAN Conference on Programming Language Design and Implementation
Analysing and comprehending C programs that use stringsis hard: Using standard library functions for manipulatingstrings is not enforced and programs often use complex loopsfor the same purpose. We introduce the notion of memorylessloops that capture
Publikováno v:
Tests and Proofs ISBN: 9783030311568
TAP@FM
International Conference on Tests and Proofs
TAP@FM
International Conference on Tests and Proofs
Dynamic symbolic execution is a technique that analyses programs by gathering mathematical constraints along execution paths. To achieve bit-level precision, one must use the theory of bitvectors. However, other theories might achieve higher performa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6cf28b6634013fcdf8fb597091d71023
https://doi.org/10.1007/978-3-030-31157-5_3
https://doi.org/10.1007/978-3-030-31157-5_3
Autor:
Cristian Cadar, Timotej Kapus
Publikováno v:
ASE
IEEE/ACM International Conference on Automated Software Engineering (ASE 2017)
IEEE/ACM International Conference on Automated Software Engineering (ASE 2017)
Symbolic execution has attracted significant attention in recent years, with applications in software testing, security, networking and more. Symbolic execution tools, like CREST, KLEE, FuzzBALL, and Symbolic PathFinder, have enabled researchers and