Follow
Rohit Chadha
Title
Cited by
Cited by
Year
Automated verification of equivalence properties of cryptographic protocols
R Chadha, V Cheval, Ş Ciobâcă, S Kremer
ACM Transactions on Computational Logic (TOCL) 17 (4), 1-32, 2016
2002016
Inductive methods and contract-signing protocols
R Chadha, M Kanovich, A Scedrov
Proceedings of the 8th ACM Conference on Computer and Communications …, 2001
1012001
Formal analysis of multiparty contract signing
R Chadha, S Kremer, A Scedrov
Journal of Automated Reasoning 36 (1), 39-83, 2006
992006
A counterexample-guided abstraction-refinement framework for Markov decision processes
R Chadha, M Viswanathan
ACM Transactions on Computational Logic (TOCL) 12 (1), 1-49, 2010
792010
Reasoning about imperative quantum programs
R Chadha, P Mateus, A Sernadas
Electronic Notes in Theoretical Computer Science 158, 19-39, 2006
712006
Reasoning about probabilistic sequential programs
R Chadha, L Cruz-Filipe, P Mateus, A Sernadas
Theoretical Computer Science 379 (1-2), 142-165, 2007
572007
Epistemic logic for the applied pi calculus
R Chadha, S Delaune, S Kremer
International Conference on Formal Methods for Open Object-Based Distributed …, 2009
522009
Contract signing, optimism, and advantage
R Chadha, JC Mitchell, A Scedrov, V Shmatikov
International Conference on Concurrency Theory, 366-382, 2003
482003
Power of randomization in automata on infinite strings
R Chadha, AP Sistla, M Viswanathan
Logical Methods in Computer Science 7, 2011
432011
Quantum computation tree logic—model checking and complete calculus
P Baltazar, R Chadha, P Mateus
International Journal of Quantum Information 6 (02), 219-236, 2008
412008
On the expressiveness and complexity of randomization in finite state monitors
R Chadha, AP Sistla, M Viswanathan
Journal of the ACM (JACM) 56 (5), 1-44, 2009
372009
Decidability results for well-structured transition systems with auxiliary storage
R Chadha, M Viswanathan
International Conference on Concurrency Theory, 136-150, 2007
352007
Deciding differential privacy for programs with finite inputs and outputs
G Barthe, R Chadha, V Jagannath, AP Sistla, M Viswanathan
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
292020
A hybrid intuitionistic logic: Semantics and decidability
R Chadha, D Macedonio, V Sassone
Journal of Logic and Computation 16 (1), 27-59, 2006
282006
Model checking MDPs with a unique compact invariant set of distributions
R Chadha, VA Korthikanti, M Viswanathan, G Agha, YM Kwon
2011 Eighth International Conference on Quantitative Evaluation of SysTems …, 2011
252011
Extending classical logic for reasoning about quantum systems
R Chadha, P Mateus, A Sernadas, C Sernadas
Handbook of Quantum Logic and Quantum Structures: Quantum Logic, 325-372, 2009
242009
Verification methods for the computationally complete symbolic attacker based on indistinguishability
G Bana, R Chadha, AK Eeralla, M Okada
ACM Transactions on Computational Logic (TOCL) 21 (1), 1-44, 2019
192019
Formal analysis of vote privacy using computationally complete symbolic attacker
G Bana, R Chadha, AK Eeralla
European Symposium on Research in Computer Security, 350-372, 2018
192018
Contract signing, optimism, and advantage
R Chadha, JC Mitchell, A Scedrov, V Shmatikov
The Journal of Logic and Algebraic Programming 64 (2), 189-218, 2005
192005
Verification of randomized security protocols
R Chadha, AP Sistla, M Viswanathan
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
182017
The system can't perform the operation now. Try again later.
Articles 1–20