Rohit Chadha

According to our database1, Rohit Chadha authored at least 47 papers between 2001 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Deciding accuracy of differential privacy schemes.
Proc. ACM Program. Lang., 2021

2020
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability.
ACM Trans. Comput. Log., 2020

Exact quantitative probabilistic model checking through rational search.
Formal Methods Syst. Des., 2020

Deciding Differential Privacy for Programs with Finite Inputs and Outputs.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Strongly bounded termination with applications to security and hardware synthesis.
Proceedings of the 5th ACM SIGPLAN International Workshop on Type-Driven Development, 2020

Modelchecking Safety Properties in Randomized Security Protocols.
Proceedings of the Logic, 2020

2019
Decidable and expressive classes of probabilistic automata.
J. Comput. Syst. Sci., 2019

Automated Methods for Checking Differential Privacy.
CoRR, 2019

2018
Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker.
IACR Cryptol. ePrint Arch., 2018

Approximating Probabilistic Automata by Regular Languages.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

Model Checking Indistinguishability of Randomized Security Protocols.
Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017
Verification of randomized security protocols.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

Modular Verification of Protocol Equivalence in the Presence of Randomness.
Proceedings of the Computer Security - ESORICS 2017, 2017

2016
Automated Verification of Equivalence Properties of Cryptographic Protocols.
ACM Trans. Comput. Log., 2016

Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability.
IACR Cryptol. ePrint Arch., 2016

Composing Protocols with Randomized Actions.
Proceedings of the Principles of Security and Trust - 5th International Conference, 2016

2014
Least upper bounds for probability measures and their applications to abstractions.
Inf. Comput., 2014

Decidable Problems for Unary PFAs.
Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Quantitative Information Flow in Boolean Programs.
Proceedings of the Principles of Security and Trust - Third International Conference, 2014

Computing Information Flow Using Symbolic Model-Checking.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013
Reachability under Contextual Locking.
Log. Methods Comput. Sci., 2013

Probabilistic Automata with Isolated Cut-Points.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Bounded Context-Switching and Reentrant Locking.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

2012
Reachability under Contextual Locking.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

The Complexity of Quantitative Information Flow in Recursive Programs.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

Automated Verification of Equivalence Properties of Cryptographic Protocols.
Proceedings of the Programming Languages and Systems, 2012

2011
Power of Randomization in Automata on Infinite Strings
Log. Methods Comput. Sci., 2011

Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2011

Model Checking MDPs with a Unique Compact Invariant Set of Distributions.
Proceedings of the Eighth International Conference on Quantitative Evaluation of Systems, 2011

2010
A counterexample-guided abstraction-refinement framework for markov decision processes.
ACM Trans. Comput. Log., 2010

Complexity Bounds for the Verification of Real-Time Software.
Proceedings of the Verification, 2010

Model Checking Concurrent Programs with Nondeterminism and Randomization.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
Deciding branching time properties for asynchronous programs.
Theor. Comput. Sci., 2009

On the expressiveness and complexity of randomization in finite state monitors.
J. ACM, 2009

Epistemic Logic for the Applied Pi Calculus.
Proceedings of the Formal Techniques for Distributed Systems, 2009

2008
Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers.
Proceedings of the Formal Methods for Open Object-Based Distributed Systems, 2008

2007
Reasoning about probabilistic sequential programs.
Theor. Comput. Sci., 2007

Towards Model-Checking Quantum Security Protocols.
Proceedings of the First International Conference on Quantum, Nano, and Micro Technologies, 2007

Decidability Results for Well-Structured Transition Systems with Auxiliary Storage.
Proceedings of the CONCUR 2007 - Concurrency Theory, 18th International Conference, 2007

2006
A Hybrid Intuitionistic Logic: Semantics and Decidability.
J. Log. Comput., 2006

Formal Analysis of Multiparty Contract Signing.
J. Autom. Reason., 2006

Reasoning About Imperative Quantum Programs.
Proceedings of the 22nd Annual Conference on Mathematical Foundations of Programming Semantics, 2006

Reasoning About States of Probabilistic Sequential Programs.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

2005
Contract signing, optimism, and advantage.
J. Log. Algebraic Methods Program., 2005

2004
Formal Analysis of Multi-Party Contract Signing.
Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004

2001
Inductive methods and contract-signing protocols.
Proceedings of the CCS 2001, 2001


  Loading...