Hrishikesh Karmarkar

Orcid: 0000-0002-9132-8356

According to our database1, Hrishikesh Karmarkar authored at least 12 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A shallow dive into the depths of non-termination checking for C programs.
CoRR, 2024

Navigating Confidentiality in Test Automation: A Case Study in LLM Driven Test Data Generation.
Proceedings of the IEEE International Conference on Software Analysis, 2024

PROTON: PRObes for Termination Or Not (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2024

Unifying Syntactic and Semantic Abstractions for Deep Neural Networks.
Proceedings of the Formal Methods for Industrial Critical Systems, 2024

Detecting Covert Channels in Cloud Access Control Policies Using Large Language Models.
Proceedings of the IEEE International Conference on Cyber Security and Resilience, 2024

2023
VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution).
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

2022
Efficiently Finding Adversarial Examples with DNN Preprocessing.
CoRR, 2022

FuzzNT : Checking for Program Non-termination.
Proceedings of the IEEE International Conference on Software Maintenance and Evolution, 2022

VeriFuzz: Good Seeds for Fuzzing (Competition Contribution).
Proceedings of the Fundamental Approaches to Software Engineering, 2022

2013
Improved Upper and Lower Bounds for Büchi Disambiguation.
Proceedings of the Automated Technology for Verification and Analysis, 2013

2011
Determinization of $\omega$-automata unified
CoRR, 2011

2009
On Minimal Odd Rankings for Büchi Complementation.
Proceedings of the Automated Technology for Verification and Analysis, 2009


  Loading...