Rohit Chadha

From MaRDI portal
Revision as of 10:38, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:732002

Available identifiers

zbMath Open chadha.rohitMaRDI QIDQ732002

List of research outcomes





PublicationDate of PublicationType
Stack-aware hyperproperties2023-12-13Paper
Model checking indistinguishability of randomized security protocols2023-05-05Paper
Modular verification of protocol equivalence in the presence of randomness2022-08-25Paper
Modelchecking safety properties in randomized security protocols2021-07-08Paper
Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability2019-11-22Paper
Automated Verification of Equivalence Properties of Cryptographic Protocols2017-07-13Paper
Computing Information Flow Using Symbolic Model-Checking2017-04-25Paper
The Complexity of Quantitative Information Flow in Recursive Programs2017-01-26Paper
A counterexample-guided abstraction-refinement framework for markov decision processes2015-09-17Paper
Least upper bounds for probability measures and their applications to abstractions2014-02-11Paper
https://portal.mardi4nfdi.de/entity/Q28513152013-10-10Paper
https://portal.mardi4nfdi.de/entity/Q28518012013-10-04Paper
Reachability under Contextual Locking2013-09-26Paper
Bounded Context-Switching and Reentrant Locking2013-03-18Paper
Reachability under Contextual Locking2012-06-29Paper
Automated Verification of Equivalence Properties of Cryptographic Protocols2012-06-22Paper
Power of Randomization in Automata on Infinite Strings2012-04-02Paper
CONCUR 2003 - Concurrency Theory2010-03-30Paper
Complexity Bounds for the Verification of Real-Time Software2010-01-14Paper
Deciding branching time properties for asynchronous programs2009-10-09Paper
Reasoning About States of Probabilistic Sequential Programs2009-03-12Paper
Least Upper Bounds for Probability Measures and Their Applications to Abstractions2008-11-25Paper
QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS2008-11-03Paper
Decidability Results for Well-Structured Transition Systems with Auxiliary Storage2008-09-18Paper
Reasoning about probabilistic sequential programs2007-07-16Paper
Formal analysis of multiparty contract signing2007-01-30Paper
A Hybrid Intuitionistic Logic: Semantics and Decidability2006-09-22Paper
Contract signing, optimism, and advantage2005-08-01Paper

Research outcomes over time

This page was built for person: Rohit Chadha