Travelled to:
1 × Hungary
1 × Italy
1 × Spain
1 × United Kingdom
2 × Estonia
2 × USA
Collaborated with:
A.P.Sistla M.Viswanathan M.V.0001 R.Bonnet S.Ciobaca S.Kremer P.Madhusudan P.Mateus A.Sernadas Y.Ben A.Legay P.Prabhakar M.S.Bauer
Talks about:
probabilist (4) automata (3) protocol (2) express (2) complex (2) random (2) verif (2) state (2) bound (2) lock (2)
Person: Rohit Chadha
DBLP: Chadha:Rohit
Contributed to:
Wrote 10 papers:
- FoSSaCS-2015-ChadhaSVB #automaton #decidability #probability
- Decidable and Expressive Classes of Probabilistic Automata (RC, APS, MV, YB), pp. 200–214.
- FoSSaCS-2013-BonnetC #bound
- Bounded Context-Switching and Reentrant Locking (RB, RC), pp. 65–80.
- ESOP-2012-ChadhaCK #automation #encryption #equivalence #protocol #verification
- Automated Verification of Equivalence Properties of Cryptographic Protocols (RC, SC, SK), pp. 108–127.
- TACAS-2012-ChadhaMV #reachability
- Reachability under Contextual Locking (RC, PM, MV), pp. 437–450.
- VMCAI-2011-ChadhaSV #automaton #probability
- Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds (RC, APS, MV), pp. 103–117.
- VMCAI-2010-ChadhaLPV #bound #complexity #realtime #verification
- Complexity Bounds for the Verification of Real-Time Software (RC, AL, PP, MV), pp. 95–111.
- LICS-2008-ChadhaSV #complexity #finite #monitoring #on the
- On the Expressiveness and Complexity of Randomization in Finite State Monitors (RC, APS, MV), pp. 18–29.
- CSL-2006-ChadhaMS #probability #reasoning #source code
- Reasoning About States of Probabilistic Sequential Programs (RC, PM, AS), pp. 240–255.
- CAV-2018-BauerCS0 #model checking #protocol #random #security
- Model Checking Indistinguishability of Randomized Security Protocols (MSB, RC, APS, MV0), pp. 117–135.
- CSL-2018-ChadhaS0 #approximate #automaton #probability #regular expression
- Approximating Probabilistic Automata by Regular Languages (RC, APS, MV0), p. 23.