Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Ziqi Shuai"'
Publikováno v:
Journal of Software: Evolution and Process.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::778d775945a166f6fbd589fd620bc203
https://doi.org/10.1002/smr.2568
https://doi.org/10.1002/smr.2568
Publikováno v:
2022 29th Asia-Pacific Software Engineering Conference (APSEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cfa01f7ae560d6510c51a15f7c1049eb
https://doi.org/10.1109/apsec57359.2022.00045
https://doi.org/10.1109/apsec57359.2022.00045
Publikováno v:
2022 29th Asia-Pacific Software Engineering Conference (APSEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c10a963f111becbc81a145aadc541998
https://doi.org/10.1109/apsec57359.2022.00030
https://doi.org/10.1109/apsec57359.2022.00030
Publikováno v:
2022 29th Asia-Pacific Software Engineering Conference (APSEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d978e718938cc878c8aa740946229cc7
https://doi.org/10.1109/apsec57359.2022.00042
https://doi.org/10.1109/apsec57359.2022.00042
Publikováno v:
2021 IEEE 21st International Conference on Software Quality, Reliability and Security Companion (QRS-C).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f72f6294af9d70d29e60c81b049cd80c
https://doi.org/10.1109/qrs-c55045.2021.00178
https://doi.org/10.1109/qrs-c55045.2021.00178
Publikováno v:
ISSTA
Array constraints are prevalent in analyzing a program with symbolic execution. Solving array constraints is challenging due to the complexity of the precise encoding for arrays. In this work, we propose to synergize symbolic execution and array cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a3230faae22c039284d91261b6b805c
https://doi.org/10.1145/3460319.3464826
https://doi.org/10.1145/3460319.3464826
Publikováno v:
ISSTA
Symbolic execution is powered by constraint solving. The advancement of constraint solving boosts the development and the applications of symbolic execution. Modern SMT solvers provide the mechanism of solving strategy that allows the users to contro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d1d8d7ad9580ee47874a18529573479f
https://doi.org/10.1145/3460319.3464815
https://doi.org/10.1145/3460319.3464815
Publikováno v:
ASE
Path explosion and constraint solving are two challenges to symbolic execution's scalability. Symbolic execution explores the program's path space with a searching strategy and invokes the underlying constraint solver in a black-box manner to check t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::919bf622760a77dcc779ba36469f2aec
https://doi.org/10.1145/3324884.3416645
https://doi.org/10.1145/3324884.3416645
Publikováno v:
ASE
Symbolic execution is still facing the scalability problem caused by path explosion and constraint solving overhead. The recently proposed MuSE framework supports exploring multiple paths by generating partial solutions in one time of solving. In thi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4bee37e3a27100463287688fafd7c05
https://doi.org/10.1145/3324884.3418902
https://doi.org/10.1145/3324884.3418902
Publikováno v:
ASE
Constraint solving is one of the challenges for symbolic execution. Modern SMT solvers allow users to customize the internal solving procedure by solving strategies. In this extended abstract, we report our recent progress in synthesizing a program-s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f64789202bff56ee1183acabea323834
https://doi.org/10.1145/3324884.3418904
https://doi.org/10.1145/3324884.3418904