The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Rohit Chadha: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rohit Chadha, Max I. Kanovich, Andre Scedrov
    Inductive methods and contract-signing protocols. [Citation Graph (0, 0)][DBLP]
    ACM Conference on Computer and Communications Security, 2001, pp:176-185 [Conf]
  2. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
    Contract Signing, Optimism, and Advantage. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:361-377 [Conf]
  3. Rohit Chadha, Steve Kremer, Andre Scedrov
    Formal Analysis of Multi-Party Contract Signing. [Citation Graph (0, 0)][DBLP]
    CSFW, 2004, pp:266-265 [Conf]
  4. Rohit Chadha, Paulo Mateus, Amílcar Sernadas
    Reasoning About States of Probabilistic Sequential Programs. [Citation Graph (0, 0)][DBLP]
    CSL, 2006, pp:240-255 [Conf]
  5. Rohit Chadha, Paulo Mateus, Amílcar Sernadas
    Reasoning About Imperative Quantum Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:158, n:, pp:19-39 [Journal]
  6. Rohit Chadha, Steve Kremer, Andre Scedrov
    Formal Analysis of Multiparty Contract Signing. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2006, v:36, n:1-2, pp:39-83 [Journal]
  7. Rohit Chadha, John C. Mitchell, Andre Scedrov, Vitaly Shmatikov
    Contract signing, optimism, and advantage. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:64, n:2, pp:189-218 [Journal]
  8. Rohit Chadha, Damiano Macedonio, Vladimiro Sassone
    A Hybrid Intuitionistic Logic: Semantics and Decidability. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2006, v:16, n:1, pp:27-59 [Journal]
  9. R. Chadha, Mahesh Viswanathan
    Decidability Results for Well-Structured Transition Systems with Auxiliary Storage. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2007, pp:136-150 [Conf]
  10. Rohit Chadha, Luís Cruz-Filipe, Paulo Mateus, Amílcar Sernadas
    Reasoning about probabilistic sequential programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:379, n:1-2, pp:142-165 [Journal]

  11. Least Upper Bounds for Probability Measures and Their Applications to Abstractions. [Citation Graph (, )][DBLP]


  12. Power of Randomization in Automata on Infinite Strings. [Citation Graph (, )][DBLP]


  13. Modular Preservation of Safety Properties by Cookie-Based DoS-Protection Wrappers. [Citation Graph (, )][DBLP]


  14. Epistemic Logic for the Applied Pi Calculus. [Citation Graph (, )][DBLP]


  15. On the Expressiveness and Complexity of Randomization in Finite State Monitors. [Citation Graph (, )][DBLP]


  16. Complexity Bounds for the Verification of Real-Time Software. [Citation Graph (, )][DBLP]


  17. Towards Model-Checking Quantum Security Protocols. [Citation Graph (, )][DBLP]


  18. A Counterexample Guided Abstraction-Refinement Framework for Markov Decision Processes [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002