Članki z zahtevami za javni dostop - Aravinda Prasad SistlaVeč o tem
Ni na voljo nikjer: 1
Emptiness under isolation and the value problem for hierarchical probabilistic automata
R Chadha, AP Sistla, M Viswanathan
International Conference on Foundations of Software Science and Computation …, 2017
Zahteve: US National Science Foundation
Na voljo nekje: 12
Deciding differential privacy for programs with finite inputs and outputs
G Barthe, R Chadha, V Jagannath, AP Sistla, M Viswanathan
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020
Zahteve: US National Science Foundation
Distinguishing hidden Markov chains
S Kiefer, AP Sistla
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer …, 2016
Zahteve: US National Science Foundation
Verification of randomized security protocols
R Chadha, AP Sistla, M Viswanathan
2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2017
Zahteve: US National Science Foundation
Deciding accuracy of differential privacy schemes
G Barthe, R Chadha, P Krogmeier, AP Sistla, M Viswanathan
Proceedings of the ACM on Programming Languages 5 (POPL), 1-30, 2021
Zahteve: US National Science Foundation
Exact quantitative probabilistic model checking through rational search
MV Umang Mathur, Matthew S. Bauer, Rohit Chadha, A. Prasad Sistla
Formal Methods Syst. Design 56 (1), 90-126, 2020
Zahteve: US National Science Foundation
Model checking indistinguishability of randomized security protocols
MS Bauer, R Chadha, A Prasad Sistla, M Viswanathan
International Conference on Computer Aided Verification, 117-135, 2018
Zahteve: US National Science Foundation
Deciding differential privacy of online algorithms with multiple variables
R Chadha, AP Sistla, M Viswanathan, B Bhusal
Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications …, 2023
Zahteve: US National Science Foundation
On linear time decidability of differential privacy for programs with unbounded inputs
R Chadha, AP Sistla, M Viswanathan
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2021
Zahteve: US National Science Foundation
Decidable and expressive classes of probabilistic automata
Y Ben, R Chadha, AP Sistla, M Viswanathan
Journal of Computer and System Sciences 100, 70-95, 2019
Zahteve: US National Science Foundation
Decision-theoretic monitoring of cyber-physical systems
A Yavolovsky, M Žefran, AP Sistla
International Conference on Runtime Verification, 404-419, 2016
Zahteve: US National Science Foundation
Approximating probabilistic automata by regular languages
R Chadha, AP Sistla, M Viswanathan
27th EACSL Annual Conference on Computer Science Logic (CSL 2018), 14: 1-14: 23, 2018
Zahteve: US National Science Foundation
Deciding Accuracy of Differential Privacy Schemes
R CHADHA, P KROGMEIER, AP SISTLA, M VISWANATHAN
Zahteve: US National Science Foundation
Podatke o objavi in financiranju samodejno določi računalniški program