Rohit Chadha

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 31

Top Topics

Probabilistic Automata

Automated Verification

Security Protocols

Top Venues

ACM Trans. Comput. Log.

Publications

Nabarun Deka, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan
Deciding branching hyperproperties for real time systems. CoRR (2024)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Bishnu Bhusal
Deciding Differential Privacy of Online Algorithms with Multiple Variables. CCS (2023)
Prasad Calyam, Mayank Kejriwal, Praveen Rao, Jianlin Cheng, Weichao Wang, Linquan Bai, V. Sriram Siddhardh Nadendla, Sanjay Madria, Sajal K. Das, Rohit Chadha, Khaza Anuarul Hoque, Kannappan Palaniappan, Kiran Neupane, Roshan Lal Neupane, Sankeerth Gandhari, Mukesh Singhal, Lotfi Ben Othmane, Meng Yu, Vijay Anand, Bharat K. Bhargava, Brett Robertson, Kerk F. Kee, Patrice Buzzanell, Natalie A. Bolton, Harsh Taneja
Towards a Domain-Agnostic Knowledge Graph-as-a-Service Infrastructure for Active Cyber Defense with Intelligent Agents. AIPR (2023)
Ali Bajwa, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan
Stack-Aware Hyperproperties. CoRR (2023)
Vijay Anand, Natalie A. Bolton, Prasad Calyam, Rohit Chadha, Rajendra K. Raj, Sumita Mishra
Enhancing Computing Curricular Outcomes and Student Accomplishments Through Collegiate Competitions. CompEd (1) (2023)
Ali Bajwa, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan
Stack-Aware Hyperproperties. TACAS (1) (2023)
Kandasamy Muniasamy, Rohit Chadha, Prasad Calyam, M. Sethumadhavan
Analyzing Component Composability of Cloud Security Configurations. IEEE Access 11 (2023)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Bishnu Bhusal
Deciding Differential Privacy of Online Algorithms with Multiple Variables. CoRR (2023)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. CoRR (2021)
Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan
Deciding accuracy of differential privacy schemes. Proc. ACM Program. Lang. 5 (POPL) (2021)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. LICS (2021)
Thomas N. Reynolds, William L. Harrison, Rohit Chadha, Gerard Allwein
Strongly bounded termination with applications to security and hardware synthesis. TyDe@ICFP (2020)
Umang Mathur, Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Exact quantitative probabilistic model checking through rational search. Formal Methods Syst. Des. 56 (1) (2020)
Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan
Deciding Differential Privacy for Programs with Finite Inputs and Outputs. LICS (2020)
Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan
Modelchecking Safety Properties in Randomized Security Protocols. Logic, Language, and Security (2020)
Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. ACM Trans. Comput. Log. 21 (1) (2020)
Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan
Deciding Accuracy of Differential Privacy Schemes. CoRR (2020)
Yue Ben, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Decidable and expressive classes of probabilistic automata. J. Comput. Syst. Sci. 100 (2019)
Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan
Automated Methods for Checking Differential Privacy. CoRR (2019)
Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Model Checking Indistinguishability of Randomized Security Protocols. CAV (2) (2018)
Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla
Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker. ESORICS (2) (2018)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Approximating Probabilistic Automata by Regular Languages. CSL (2018)
Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla
Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker. IACR Cryptol. ePrint Arch. 2018 (2018)
Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan
Modular Verification of Protocol Equivalence in the Presence of Randomness. ESORICS (1) (2017)
Matthew S. Bauer, Umang Mathur, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Exact quantitative probabilistic model checking through rational search. FMCAD (2017)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata. FoSSaCS (2017)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Verification of randomized security protocols. LICS (2017)
Rohit Chadha, Vincent Cheval, Stefan Ciobaca, Steve Kremer
Automated Verification of Equivalence Properties of Cryptographic Protocols. ACM Trans. Comput. Log. 17 (4) (2016)
Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan
Composing Protocols with Randomized Actions. POST (2016)
Gergei Bana, Rohit Chadha
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. IACR Cryptol. ePrint Arch. 2016 (2016)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Yue Ben
Decidable and Expressive Classes of Probabilistic Automata. FoSSaCS (2015)
Rohit Chadha, Umang Mathur, Stefan Schwoon
Computing Information Flow Using Symbolic Model-Checking. FSTTCS (2014)
Rohit Chadha, Dileep Kini, Mahesh Viswanathan
Decidable Problems for Unary PFAs. QEST (2014)
Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan
Least upper bounds for probability measures and their applications to abstractions. Inf. Comput. 234 (2014)
Rohit Chadha, Dileep Kini, Mahesh Viswanathan
Quantitative Information Flow in Boolean Programs. POST (2014)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Probabilistic Automata with Isolated Cut-Points. MFCS (2013)
Rémi Bonnet, Rohit Chadha
Bounded Context-Switching and Reentrant Locking. FoSSaCS (2013)
Rémi Bonnet, Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
Reachability under Contextual Locking. Log. Methods Comput. Sci. 9 (3) (2013)
Rohit Chadha, Michael Ummels
The Complexity of Quantitative Information Flow in Recursive Programs. FSTTCS (2012)
Rohit Chadha, Stefan Ciobaca, Steve Kremer
Automated Verification of Equivalence Properties of Cryptographic Protocols. ESOP (2012)
Rohit Chadha, P. Madhusudan, Mahesh Viswanathan
Reachability under Contextual Locking. TACAS (2012)
Rohit Chadha, Vijay Anand Korthikanti, Mahesh Viswanathan, Gul Agha, YoungMin Kwon
Model Checking MDPs with a Unique Compact Invariant Set of Distributions. QEST (2011)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Power of Randomization in Automata on Infinite Strings Log. Methods Comput. Sci. 7 (3) (2011)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds. VMCAI (2011)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Model Checking Concurrent Programs with Nondeterminism and Randomization. FSTTCS (2010)
Rohit Chadha, Mahesh Viswanathan
A counterexample-guided abstraction-refinement framework for markov decision processes. ACM Trans. Comput. Log. 12 (1) (2010)
Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahesh Viswanathan
Complexity Bounds for the Verification of Real-Time Software. VMCAI (2010)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
Power of Randomization in Automata on Infinite Strings. CONCUR (2009)
Rohit Chadha, Mahesh Viswanathan
Deciding branching time properties for asynchronous programs. Theor. Comput. Sci. 410 (42) (2009)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
On the expressiveness and complexity of randomization in finite state monitors. J. ACM 56 (5) (2009)
Rohit Chadha, Stéphanie Delaune, Steve Kremer
Epistemic Logic for the Applied Pi Calculus. FMOODS/FORTE (2009)
Rohit Chadha, Mahesh Viswanathan
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes CoRR (2008)
Rohit Chadha, Carl A. Gunter, José Meseguer, Ravinder Shankesi, Mahesh Viswanathan
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers. FMOODS (2008)
Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan
On the Expressiveness and Complexity of Randomization in Finite State Monitors. LICS (2008)
Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan
Least Upper Bounds for Probability Measures and Their Applications to Abstractions. CONCUR (2008)
Pedro Baltazar, Rohit Chadha, Paulo Mateus, Amílcar Sernadas
Towards Model-Checking Quantum Security Protocols. ICQNM (2007)
Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas
Reasoning about probabilistic sequential programs. Theor. Comput. Sci. 379 (1-2) (2007)
Rohit Chadha, Mahesh Viswanathan
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. CONCUR (2007)
Rohit Chadha, Steve Kremer, Andre Scedrov
Formal Analysis of Multiparty Contract Signing. J. Autom. Reason. 36 (1-2) (2006)
Rohit Chadha, Paulo Mateus, Amílcar Sernadas
Reasoning About Imperative Quantum Programs. MFPS (2006)
Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
A Hybrid Intuitionistic Logic: Semantics and Decidability. J. Log. Comput. 16 (1) (2006)
Rohit Chadha, Paulo Mateus, Amílcar Sernadas
Reasoning About States of Probabilistic Sequential Programs. CSL (2006)
Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
Contract signing, optimism, and advantage. J. Log. Algebraic Methods Program. 64 (2) (2005)
Rohit Chadha, Steve Kremer, Andre Scedrov
Formal Analysis of Multi-Party Contract Signing. CSFW (2004)
Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
Contract Signing, Optimism, and Advantage. CONCUR (2003)
Rohit Chadha, Max I. Kanovich, Andre Scedrov
Inductive methods and contract-signing protocols. CCS (2001)