Matthew S. Bauer
Matthew S. Bauer
Verifierad e-postadress på illinois.edu
Titel
Citeras av
Citeras av
År
An infinite class of sparse-yao spanners
M Bauer, M Damian
Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete …, 2013
162013
A PSPACE-complete first-order fragment of computability logic
MS Bauer
ACM Transactions on Computational Logic (TOCL) 15 (1), 1-11, 2014
82014
Composing protocols with randomized actions
MS Bauer, R Chadha, M Viswanathan
International Conference on Principles of Security and Trust, 189-210, 2016
52016
Exact quantitative probabilistic model checking through rational search
U Mathur, MS Bauer, R Chadha, AP Sistla, M Viswanathan
Formal Methods in System Design, 1-37, 2020
42020
The computational complexity of propositional cirquent calculus
MS Bauer
arXiv preprint arXiv:1401.1849, 2014
42014
Modular verification of protocol equivalence in the presence of randomness
MS Bauer, R Chadha, M Viswanathan
European Symposium on Research in Computer Security, 187-205, 2017
32017
On the weak computability of continuous real functions
MS Bauer, X Zheng
arXiv preprint arXiv:1006.0394, 2010
22010
Model checking indistinguishability of randomized security protocols
MS Bauer, R Chadha, AP Sistla, M Viswanathan
International Conference on Computer Aided Verification, 117-135, 2018
12018
Analysis of randomized security protocols
MS Bauer
University of Illinois at Urbana-Champaign, 2018
2018
Sound Dynamic Deadlock Prediction in Linear Time
U Mathur, MS Bauer, M Viswanathan
Exact Quantitative Model Checking Through Rational Search
MS Bauer, U Mathur, R Chadha, AP Sistla, M Viswanathan
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–11