The following pages link to Rohit Chadha (Q732002):
Displaying 27 items.
- Deciding branching time properties for asynchronous programs (Q732003) (← links)
- Formal analysis of multiparty contract signing (Q861699) (← links)
- Modelchecking safety properties in randomized security protocols (Q2037999) (← links)
- Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
- Reasoning about probabilistic sequential programs (Q2373709) (← links)
- Contract signing, optimism, and advantage (Q2484408) (← links)
- Least upper bounds for probability measures and their applications to abstractions (Q2637319) (← links)
- (Q2851315) (← links)
- (Q2851801) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q2892723) (← links)
- A counterexample-guided abstraction-refinement framework for markov decision processes (Q2946618) (← links)
- The Complexity of Quantitative Information Flow in Recursive Programs (Q2957526) (← links)
- Computing Information Flow Using Symbolic Model-Checking (Q2978540) (← links)
- Decidability Results for Well-Structured Transition Systems with Auxiliary Storage (Q3525634) (← links)
- QUANTUM COMPUTATION TREE LOGIC — MODEL CHECKING AND COMPLETE CALCULUS (Q3534212) (← links)
- Least Upper Bounds for Probability Measures and Their Applications to Abstractions (Q3541023) (← links)
- Reasoning About States of Probabilistic Sequential Programs (Q3613341) (← links)
- Complexity Bounds for the Verification of Real-Time Software (Q3656878) (← links)
- Bounded Context-Switching and Reentrant Locking (Q4910412) (← links)
- Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability (Q4972166) (← links)
- Automated Verification of Equivalence Properties of Cryptographic Protocols (Q5278194) (← links)
- A Hybrid Intuitionistic Logic: Semantics and Decidability (Q5488610) (← links)
- Reachability under Contextual Locking (Q5891174) (← links)
- Reachability under Contextual Locking (Q5891625) (← links)
- Power of Randomization in Automata on Infinite Strings (Q5895526) (← links)
- CONCUR 2003 - Concurrency Theory (Q5900577) (← links)
- Stack-aware hyperproperties (Q6535363) (← links)
