Author of the publication

Obtaining Information Leakage Bounds via Approximate Model Counting.

, , , , and . Proc. ACM Program. Lang., 7 (PLDI): 1488-1509 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Obtaining Information Leakage Bounds via Approximate Model Counting., , , , and . Proc. ACM Program. Lang., 7 (PLDI): 1488-1509 (2023)MCBAT: Model Counting for Constraints over Bounded Integer Arrays., , , and . VSTTE, volume 12549 of Lecture Notes in Computer Science, page 124-143. Springer, (2020)Student Experiences and Academic Outcomes When Multiple Introductory Tracks Converge., , , and . ITiCSE (1), page 89-95. ACM, (2023)Parameterized model counting for string and numeric constraints., , , , , , and . ESEC/SIGSOFT FSE, page 400-410. ACM, (2018)Incremental Adaptive Attack Synthesis., , , , and . CoRR, (2019)Incremental Attack Synthesis., , , , and . ACM SIGSOFT Softw. Eng. Notes, 44 (4): 16 (2019)Profit: Detecting and Quantifying Side Channels in Networked Applications., , , and . NDSS, The Internet Society, (2019)Formalizing Path Explosion for Recursive Functions via Asymptotic Path Complexity., , , , , and . FormaliSE, page 76-85. IEEE, (2023)Metrinome: Path Complexity Predicts Symbolic Execution Path Explosion., , , , , , , and . ICSE (Companion Volume), page 29-32. IEEE, (2021)Path Complexity Correlates with Source Code Comprehension Effort Indicators., , , , and . ICPC, page 266-274. IEEE, (2023)