default search action
Hrishikesh Karmarkar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c9]Hrishikesh Karmarkar, Vaibhavi Joshi, R. Venkatesh:
Detecting Covert Channels in Cloud Access Control Policies Using Large Language Models. CSR 2024: 241-246 - [c8]Sanaa Siddiqui, Diganta Mukhopadhyay, Mohammad Afzal, Hrishikesh Karmarkar, Kumar Madhukar:
Unifying Syntactic and Semantic Abstractions for Deep Neural Networks. FMICS 2024: 201-219 - [c7]Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty:
PROTON: PRObes for Termination Or Not (Competition Contribution). TACAS (3) 2024: 393-398 - [c6]Hrishikesh Karmarkar, Supriya Agrawal, Avriti Chauhan, Pranav Shete:
Navigating Confidentiality in Test Automation: A Case Study in LLM Driven Test Data Generation. SANER 2024: 337-348 - [i3]Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar, R. Venkatesh, Supratik Chakraborty, Samarjit Chakraborty:
A shallow dive into the depths of non-termination checking for C programs. CoRR abs/2409.12985 (2024) - 2023
- [c5]Ravindra Metta, Prasanth Yeduru, Hrishikesh Karmarkar, Raveendra Kumar Medicherla:
VeriFuzz 1.4: Checking for (Non-)termination (Competition Contribution). TACAS (2) 2023: 594-599 - 2022
- [c4]Ravindra Metta, Raveendra Kumar Medicherla, Hrishikesh Karmarkar:
VeriFuzz: Good Seeds for Fuzzing (Competition Contribution). FASE 2022: 341-346 - [c3]Hrishikesh Karmarkar, Raveendra Kumar Medicherla, Ravindra Metta, Prasanth Yeduru:
FuzzNT : Checking for Program Non-termination. ICSME 2022: 409-413 - [i2]Avriti Chauhan, Mohammad Afzal, Hrishikesh Karmarkar, Yizhak Yisrael Elboher, Kumar Madhukar, Guy Katz:
Efficiently Finding Adversarial Examples with DNN Preprocessing. CoRR abs/2211.08706 (2022)
2010 – 2019
- 2013
- [c2]Hrishikesh Karmarkar, Manas Joglekar, Supratik Chakraborty:
Improved Upper and Lower Bounds for Büchi Disambiguation. ATVA 2013: 40-54 - 2011
- [i1]Hrishikesh Karmarkar, Supratik Chakraborty:
Determinization of $\omega$-automata unified. CoRR abs/1101.1841 (2011)
2000 – 2009
- 2009
- [c1]Hrishikesh Karmarkar, Supratik Chakraborty:
On Minimal Odd Rankings for Büchi Complementation. ATVA 2009: 228-243
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:25 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint