Seguir
Vaibhav Sharma
Vaibhav Sharma
Amazon.com Services LLC and University of Minnesota
Dirección de correo verificada de umn.edu - Página principal
Título
Citado por
Citado por
Año
Input prioritization for testing neural networks
T Byun, V Sharma, A Vijayakumar, S Rayadurgam, D Cofer
2019 IEEE International Conference On Artificial Intelligence Testing …, 2019
712019
User authentication and identification from user interface interactions on touch-enabled devices
V Sharma, R Enbody
Proceedings of the 10th ACM Conference on Security and Privacy in Wireless …, 2017
252017
Java Ranger: Statically summarizing regions for efficient symbolic execution of Java
V Sharma, S Hussein, MW Whalen, S McCamant, W Visser
Proceedings of the 28th ACM Joint Meeting on European Software Engineering …, 2020
182020
Java Ranger at SV-COMP 2020 (competition contribution)
V Sharma, S Hussein, MW Whalen, S McCamant, W Visser
International Conference on Tools and Algorithms for the Construction and …, 2020
172020
Toward rigorous object-code coverage criteria
T Byun, V Sharma, S Rayadurgam, S McCamant, MPE Heimdahl
2017 IEEE 28th International Symposium on Software Reliability Engineering …, 2017
82017
Finding substitutable binary code for reverse engineering by synthesizing adapters
V Sharma, K Hietala, S McCamant
2018 IEEE 11th International Conference on Software Testing, Verification …, 2018
72018
Veritesting challenges in symbolic execution of Java
V Sharma, MW Whalen, S McCamant, W Visser
ACM SIGSOFT Software Engineering Notes 42 (4), 1-5, 2018
72018
Finding substitutable binary code by synthesizing adapters
V Sharma, K Hietala, S McCamant
IEEE Transactions on Software Engineering 47 (8), 1626-1643, 2019
52019
Java Ranger: Supporting String and Array Operations in Java Ranger (Competition Contribution)
S Hussein, Q Yan, S McCamant, V Sharma, MW Whalen
International Conference on Tools and Algorithms for the Construction and …, 2023
32023
It doesn’t have to be so hard: Efficient symbolic reasoning for CRCs
V Sharma, N Emamdoost, S Kim, S McCamant
2020 Workshop on binary analysis research. NDSS BAR 2020, 2020
32020
Binary mutation analysis of tests using reassembleable disassembly
N Emamdoost, V Sharma, T Byun, S McCamant
Binary Analysis Research (BAR). Internet Society, 2019
32019
Discovering instructions for robust binary-level coverage criteria
V Sharma, T Byun, S McCamant, S Rayadurgam, MPE Heimdahl
Proceedings of the 1st ACM SIGSOFT International Workshop on Testing …, 2017
22017
Counterexample-guided inductive repair of reactive contracts
S Hussein, S Rayadurgam, S McCamant, V Sharma, M Heimdahl
Proceedings of the IEEE/ACM 10th International Conference on Formal Methods …, 2022
12022
State Merging with Quantifiers in Symbolic Execution
D Trabish, N Rinetzky, S Shoham, V Sharma
Proceedings of the 31st ACM Joint European Software Engineering Conference …, 2023
2023
Automated analyses of IOT event monitoring systems
A Apicelli, S Bayless, A Das, A Gacek, D Jaganathan, S Padhi, V Sharma, ...
International Conference on Computer Aided Verification, 27-39, 2023
2023
Structural Test Input Generation for 3-Address Code Coverage Using Path-Merged Symbolic Execution
S Hussein, S McCamant, E Sherman, V Sharma, M Whalen
2023 IEEE/ACM International Conference on Automation of Software Test (AST …, 2023
2023
Counterexample-guided inductive repair of reactive contracts
S Hussein, S Sharma, Vaibhav, McCamant, S Rayadurgam, M Heimdahl
36th IEEE/ACM International Conference on Automated Software Engineering …, 2021
2021
Adapter Synthesis: Synthesizing And Repairing Programs Using Scalable Symbolic Execution
VB Sharma
University of Minnesota, 2020
2020
Automatically repairing binary programs using adapter synthesis
V Sharma
2019 34th IEEE/ACM International Conference on Automated Software …, 2019
2019
Contract discovery from black-box components
V Sharma, T Byun, S McCamant, S Rayadurgam, MPE Heimdahl
Proceedings of the 1st ACM SIGSOFT International Workshop on Automated …, 2018
2018
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20