default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRohit Chadha
Person information
- affiliation: University of Illinois, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c44]Nabarun Deka, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan:
Deciding Branching Hyperproperties for Real Time Systems. CSF 2024: 65-79- [c43]Saketh Poduvu, Roshan Lal Neupane, Alicia Esquivel Morel, Reshmi Mitra, Vijay Anand, Rohit Chadha, Prasad Calyam:
Demonstration of Low-overhead Zero Trust at the Tactical Warfighting Edge. MILCOM 2024: 682-683 - [c42]Saketh Poduvu, Roshan Lal Neupane, Alicia Esquivel Morel, Reshmi Mitra, Vijay Anand, Rohit Chadha, Prasad Calyam:
Task-Based Access Control for Computation and Communication in the Tactical Warfighting Edge. MILCOM 2024: 839-846 - [i9]Nabarun Deka, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan:
Deciding branching hyperproperties for real time systems. CoRR abs/2405.12104 (2024) - 2023
- [j16]Kandasamy Muniasamy
, Rohit Chadha, Prasad Calyam, M. Sethumadhavan:
Analyzing Component Composability of Cloud Security Configurations. IEEE Access 11: 139935-139951 (2023) - [c41]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: 1-8 - [c40]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Bishnu Bhusal:
Deciding Differential Privacy of Online Algorithms with Multiple Variables. CCS 2023: 1761-1775 - [c39]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: 22-28 - [c38]Ali Bajwa, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan:
Stack-Aware Hyperproperties. TACAS (1) 2023: 308-325 - [i8]Ali Bajwa, Minjian Zhang, Rohit Chadha, Mahesh Viswanathan:
Stack-Aware Hyperproperties. CoRR abs/2301.11521 (2023) - [i7]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Bishnu Bhusal:
Deciding Differential Privacy of Online Algorithms with Multiple Variables. CoRR abs/2309.06615 (2023) - 2021
- [j15]Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan:
Deciding accuracy of differential privacy schemes. Proc. ACM Program. Lang. 5(POPL): 1-30 (2021) - [c37]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. LICS 2021: 1-13 - [i6]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On Linear Time Decidability of Differential Privacy for Programs with Unbounded Inputs. CoRR abs/2104.14519 (2021) - 2020
- [j14]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): 90-126 (2020) - [j13]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): 2:1-2:44 (2020) - [c36]Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan:
Modelchecking Safety Properties in Randomized Security Protocols. Logic, Language, and Security 2020: 167-183 - [c35]Thomas N. Reynolds, William L. Harrison, Rohit Chadha, Gerard Allwein:
Strongly bounded termination with applications to security and hardware synthesis. TyDe@ICFP 2020: 1-10 - [c34]Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan:
Deciding Differential Privacy for Programs with Finite Inputs and Outputs. LICS 2020: 141-154 - [i5]Gilles Barthe, Rohit Chadha, Paul Krogmeier, A. Prasad Sistla, Mahesh Viswanathan:
Deciding Accuracy of Differential Privacy Schemes. CoRR abs/2011.06404 (2020)
2010 – 2019
- 2019
- [j12]Yue Ben, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Decidable and expressive classes of probabilistic automata. J. Comput. Syst. Sci. 100: 70-95 (2019) - [i4]Gilles Barthe, Rohit Chadha, Vishal Jagannath, A. Prasad Sistla, Mahesh Viswanathan:
Automated Methods for Checking Differential Privacy. CoRR abs/1910.04137 (2019) - 2018
- [c33]Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Model Checking Indistinguishability of Randomized Security Protocols. CAV (2) 2018: 117-135 - [c32]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Approximating Probabilistic Automata by Regular Languages. CSL 2018: 14:1-14:23 - [c31]Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla:
Formal Analysis of Vote Privacy Using Computationally Complete Symbolic Attacker. ESORICS (2) 2018: 350-372 - [i3]Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla:
Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker. IACR Cryptol. ePrint Arch. 2018: 624 (2018) - 2017
- [c30]Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan:
Modular Verification of Protocol Equivalence in the Presence of Randomness. ESORICS (1) 2017: 187-205 - [c29]Matthew S. Bauer, Umang Mathur, Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Exact quantitative probabilistic model checking through rational search. FMCAD 2017: 92-99 - [c28]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata. FoSSaCS 2017: 231-247 - [c27]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Verification of randomized security protocols. LICS 2017: 1-12 - 2016
- [j11]Rohit Chadha, Vincent Cheval, Stefan Ciobaca, Steve Kremer:
Automated Verification of Equivalence Properties of Cryptographic Protocols. ACM Trans. Comput. Log. 17(4): 23 (2016) - [c26]Matthew S. Bauer, Rohit Chadha, Mahesh Viswanathan:
Composing Protocols with Randomized Actions. POST 2016: 189-210 - [i2]Gergei Bana, Rohit Chadha:
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability. IACR Cryptol. ePrint Arch. 2016: 69 (2016) - 2015
- [c25]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan, Yue Ben:
Decidable and Expressive Classes of Probabilistic Automata. FoSSaCS 2015: 200-214 - 2014
- [j10]Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan:
Least upper bounds for probability measures and their applications to abstractions. Inf. Comput. 234: 68-106 (2014) - [c24]Rohit Chadha, Umang Mathur, Stefan Schwoon:
Computing Information Flow Using Symbolic Model-Checking. FSTTCS 2014: 505-516 - [c23]Rohit Chadha, Dileep Kini, Mahesh Viswanathan:
Quantitative Information Flow in Boolean Programs. POST 2014: 103-119 - [c22]Rohit Chadha, Dileep Kini, Mahesh Viswanathan:
Decidable Problems for Unary PFAs. QEST 2014: 329-344 - 2013
- [j9]Rémi Bonnet, Rohit Chadha, P. Madhusudan, Mahesh Viswanathan:
Reachability under Contextual Locking. Log. Methods Comput. Sci. 9(3) (2013) - [c21]Rémi Bonnet, Rohit Chadha:
Bounded Context-Switching and Reentrant Locking. FoSSaCS 2013: 65-80 - [c20]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Probabilistic Automata with Isolated Cut-Points. MFCS 2013: 254-265 - 2012
- [c19]Rohit Chadha, Stefan Ciobaca, Steve Kremer:
Automated Verification of Equivalence Properties of Cryptographic Protocols. ESOP 2012: 108-127 - [c18]Rohit Chadha, Michael Ummels:
The Complexity of Quantitative Information Flow in Recursive Programs. FSTTCS 2012: 534-545 - [c17]Rohit Chadha, P. Madhusudan, Mahesh Viswanathan:
Reachability under Contextual Locking. TACAS 2012: 437-450 - 2011
- [j8]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Power of Randomization in Automata on Infinite Strings. Log. Methods Comput. Sci. 7(3) (2011) - [c16]Rohit Chadha, Vijay Anand Korthikanti, Mahesh Viswanathan, Gul Agha, YoungMin Kwon:
Model Checking MDPs with a Unique Compact Invariant Set of Distributions. QEST 2011: 121-130 - [c15]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds. VMCAI 2011: 103-117 - 2010
- [j7]Rohit Chadha, Mahesh Viswanathan:
A counterexample-guided abstraction-refinement framework for markov decision processes. ACM Trans. Comput. Log. 12(1): 1:1-1:49 (2010) - [c14]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Model Checking Concurrent Programs with Nondeterminism and Randomization. FSTTCS 2010: 364-375 - [c13]Rohit Chadha, Axel Legay, Pavithra Prabhakar, Mahesh Viswanathan:
Complexity Bounds for the Verification of Real-Time Software. VMCAI 2010: 95-111
2000 – 2009
- 2009
- [j6]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On the expressiveness and complexity of randomization in finite state monitors. J. ACM 56(5): 26:1-26:44 (2009) - [j5]Rohit Chadha, Mahesh Viswanathan:
Deciding branching time properties for asynchronous programs. Theor. Comput. Sci. 410(42): 4169-4179 (2009) - [c12]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
Power of Randomization in Automata on Infinite Strings. CONCUR 2009: 229-243 - [c11]Rohit Chadha, Stéphanie Delaune, Steve Kremer:
Epistemic Logic for the Applied Pi Calculus. FMOODS/FORTE 2009: 182-197 - 2008
- [c10]Rohit Chadha, Mahesh Viswanathan, Ramesh Viswanathan:
Least Upper Bounds for Probability Measures and Their Applications to Abstractions. CONCUR 2008: 264-278 - [c9]Rohit Chadha, Carl A. Gunter, José Meseguer, Ravinder Shankesi, Mahesh Viswanathan:
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers. FMOODS 2008: 39-58 - [c8]Rohit Chadha, A. Prasad Sistla, Mahesh Viswanathan:
On the Expressiveness and Complexity of Randomization in Finite State Monitors. LICS 2008: 18-29 - [i1]Rohit Chadha, Mahesh Viswanathan:
A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes. CoRR abs/0807.1173 (2008) - 2007
- [j4]Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas:
Reasoning about probabilistic sequential programs. Theor. Comput. Sci. 379(1-2): 142-165 (2007) - [c7]Rohit Chadha, Mahesh Viswanathan:
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. CONCUR 2007: 136-150 - [c6]Pedro Baltazar, Rohit Chadha, Paulo Mateus, Amílcar Sernadas:
Towards Model-Checking Quantum Security Protocols. ICQNM 2007: 14 - 2006
- [j3]Rohit Chadha, Steve Kremer, Andre Scedrov:
Formal Analysis of Multiparty Contract Signing. J. Autom. Reason. 36(1-2): 39-83 (2006) - [j2]Rohit Chadha, Damiano Macedonio, Vladimiro Sassone:
A Hybrid Intuitionistic Logic: Semantics and Decidability. J. Log. Comput. 16(1): 27-59 (2006) - [c5]Rohit Chadha, Paulo Mateus, Amílcar Sernadas:
Reasoning About States of Probabilistic Sequential Programs. CSL 2006: 240-255 - [c4]Rohit Chadha, Paulo Mateus, Amílcar Sernadas:
Reasoning About Imperative Quantum Programs. MFPS 2006: 19-39 - 2005
- [j1]Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov:
Contract signing, optimism, and advantage. J. Log. Algebraic Methods Program. 64(2): 189-218 (2005) - 2004
- [c3]Rohit Chadha, Steve Kremer, Andre Scedrov:
Formal Analysis of Multi-Party Contract Signing. CSFW 2004: 266-265 - 2003
- [c2]Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov:
Contract Signing, Optimism, and Advantage. CONCUR 2003: 361-377 - 2001
- [c1]Rohit Chadha, Max I. Kanovich, Andre Scedrov:
Inductive methods and contract-signing protocols. CCS 2001: 176-185
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 2025-01-22 21:27 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
