3 papers
cs.SE2024
A shallow dive into the depths of non-termination checking for C programs
Ravindra Metta, Hrishikesh Karmarkar, Kumar Madhukar +3
Checking for Non-Termination (NT) of a given program P, i.e., determining if P has at least one non-terminating run, is an undecidable problem that continues to garner significant…
cs.LG2022
Efficiently Finding Adversarial Examples with DNN Preprocessing
Avriti Chauhan, Mohammad Afzal, Hrishikesh Karmarkar +3
Deep Neural Networks (DNNs) are everywhere, frequently performing a fairly complex task that used to be unimaginable for machines to carry out. In doing so, they do a lot of decisi…
cs.FL2011
Determinization of -automata unified
Hrishikesh Karmarkar, Supratik Chakraborty
We describe a uniform construction for converting -automata with arbitrary acceptance conditions (based on the notion of infinity sets i.e. the set of states visited infinitely…