Selected publications by Rohit Chadha
Chapters in Books
Journals
-
R. Chadha, A. P. Sistla and M. Viswanathan. Power of Randomization in Automata on Infinite Strings. Logical Methods in Computer Science 7(3:22), 2011. ( PDF | BibTeX + Abstract )
-
R. Chadha and M. Viswanathan. A counterexample guided abstraction-refinement framework for Markov
Decision Processes. ACM Transactions on Computational Logic 12(1), 2010. ( PDF | BibTeX + Abstract )
-
R. Chadha and M. Viswanathan. Deciding branching-time properties for asynchronous programs. Theoretical Computer Science 410(42), pages 4169-4179, 2009. ( PDF | BibTeX + Abstract )
-
R. Chadha, A. P. Sistla and M. Viswanathan. On the expressiveness and complexity of randomization in finite state
monitors. Journal of the ACM 56(5), 2009. ( PDF | BibTeX + Abstract )
-
P. Baltazar, R. Chadha and P. Mateus. Quantum Computation Tree Logic - Model checking and complete
calculus. International Journal of Quantum Information 6(2), pages 219-236, 2008. ( PDF | BibTeX + Abstract )
-
R. Chadha, L. Cruz-Filipe, P. Mateus and A. Sernadas. Reasoning about probabilistic sequential programs. Theoretical Computer Science 379(1-2), pages 142-165, 2007. ( PDF | BibTeX + Abstract )
-
R. Chadha, D. Macedonio and V. Sassone. A Hybrid Intuitionistic Logic: Semantics and Decidability. Journal of Logic and Computation 16(1), pages 27-59, 2006. ( PDF | BibTeX + Abstract )
-
R. Chadha, S. Kremer and A. Scedrov. Formal Analysis of Multi-Party Contract Signing. Journal of Automated Reasoning 36(1-2), pages 39-83, 2006. ( PDF | BibTeX + Abstract )
-
R. Chadha, J. C. Mitchell, A. Scedrov and V. Shmatikov. Contract signing, optimism and advantage. Journal of Logic and Algebraic Programming 64(2), pages 189-218, 2005. ( PDF | BibTeX + Abstract )
Conferences
-
R. Chadha, Ş. Ciobâcă and S. Kremer. Automated verification of equivalence properties of cryptographic
protocols. In ESOP'12, LNCS 7211, pages 108-127. Springer, 2012. ( PDF | BibTeX + Abstract )
-
R. Chadha, V. Korthikranthi, M. Viswanathan, G. Agha and Y. Kwon. Model Checking MDPs with a Unique Compact Invariant Set of
Distributions. In QEST'11, pages 121-130. IEEE Computer Society Press, 2011. ( PDF | BibTeX + Abstract )
-
R. Chadha, A. P. Sistla and M. Viswanathan. Probabilistic Büchi Automata with non-extremal acceptance
thresholds. In VMCAI'11, LNCS 6538, pages 103-117. Springer, 2011. ( PDF | BibTeX + Abstract )
-
R. Chadha, A. P. Sistla and M. Viswanathan. Model Checking Concurrent Programs with Nondeterminism and
Randomization. In FSTTCS'10, Leibniz International Proceedings in Informatics 8, pages 364-375. Leibniz-Zentrum für Informatik, 2010. ( PDF | PDF (long version) | BibTeX + Abstract )
-
R. Chadha, A. Legay, P. Prabhakar and M. Viswanathan. Complexity bounds for the verification of real-time software. In VMCAI'10, LNCS 5944, pages 95-111. Springer, 2010. ( PDF | BibTeX + Abstract )
-
R. Chadha, A. P. Sistla and M. Viswanathan. Power of Randomization in Automata on Infinite Strings. In CONCUR'09, LNCS 5710, pages 229-243. Springer, 2009. ( PDF | BibTeX + Abstract )
-
R. Chadha, S. Delaune and S. Kremer. Epistemic Logic for the Applied Pi Calculus. In FMOODS/FORTE'09, LNCS 5522, pages 182-197. Springer, 2009. ( PDF | PS | PS.GZ | BibTeX + Abstract )
-
R. Chadha, M. Viswanathan and R. Viswanathan. Least Upper Bounds for Probability Measures and Their Applications to
Abstractions. In CONCUR'08, LNCS 5201, pages 264-278. Springer, 2008. ( PDF | BibTeX + Abstract )
-
R. Chadha, C. A. Gunter, J. Meseguer, R. Shankesi and M. Viswanathan. Modular Preservation of Safety Properties by Cookie-Based
DoS-Protection Wrappers. In FMOODS'08, LNCS 5051, pages 39-58. Springer, 2008. ( PDF | BibTeX + Abstract )
-
R. Chadha, A. P. Sistla and M. Viswanathan. On the Expressiveness and Complexity of Randomization in Finite State
Monitors. In LICS'08, pages 18-29. IEEE Computer Society Press, 2008. ( PDF (long version) | BibTeX + Abstract )
-
R. Chadha and M. Viswanathan. Decidability Results for Well-Structured Transition Systems with
Auxiliary Storage. In CONCUR'07, LNCS 4703, pages 136-150. Springer, 2007. ( PDF | BibTeX + Abstract )
-
R. Chadha, P. Mateus and A. Sernadas. Reasoning About States of Probabilistic Sequential Programs. In CSL'06, LNCS 4207, pages 240-255. Springer, 2006. ( PDF | BibTeX + Abstract )
-
R. Chadha, P. Mateus and A. Sernadas. Reasoning About Imperative Quantum Programs. In MFPS'06, ENTCS 158, pages 19-39. Elsevier Science Publishers, 2006. Invited paper. ( PDF | BibTeX + Abstract )
-
R. Chadha, S. Kremer and A. Scedrov. Formal Analysis of Multi-Party Contract Signing. In CSFW'04, pages 266-279. IEEE Computer Society Press, 2004. ( PS | PS.GZ | BibTeX + Abstract )
-
R. Chadha, J. C. Mitchell, A. Scedrov and V. Shmatikov. Contract signing, optimism and advantage. In CONCUR'03, LNCS 2761, pages 366-382. Springer, 2003. ( PDF | BibTeX + Abstract )
-
R. Chadha, M. I. Kanovich and A. Scedrov. Inductive methods and contract-signing protocols. In CCS'01, pages 176-185. ACM Press, 2001. ( PDF | BibTeX + Abstract )
Theses
Other Publications
-
R. Chadha and M. Ummels. The complexity of quantitative information flow in recursive programs. Research Report LSV-12-15, Laboratoire Spécification et Vérification, ENS Cachan,
France, July 2012. 24 pages. ( PDF | BibTeX + Abstract )
-
P. Baltazar, R. Chadha, P. Mateus and A. Sernadas. Towards model-checking quantum security protocols. In QSEC'07, page 14. IEEE Press, 2007. ( PDF | BibTeX + Abstract )
-
R. Chadha, S. Kremer and A. Scedrov. Formal Analysis of Multi-Party Contract Signing. In WITS'04, pages 153-163. 2004. ( PS | PS.GZ | BibTeX + Abstract )