Matthew S. Bauer
Matthew S. Bauer
Verified email at illinois.edu
Title
Cited by
Cited by
Year
An infinite class of sparse-yao spanners
M Bauer, M Damian
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete …, 2013
152013
A PSPACE-complete first-order fragment of computability logic
MS Bauer
ACM Transactions on Computational Logic (TOCL) 15 (1), 1-11, 2014
92014
Exact quantitative probabilistic model checking through rational search
MS Bauer, U Mathur, R Chadha, AP Sistla, M Viswanathan
2017 Formal Methods in Computer Aided Design (FMCAD), 92-99, 2017
72017
Composing protocols with randomized actions
MS Bauer, R Chadha, M Viswanathan
International Conference on Principles of Security and Trust, 189-210, 2016
62016
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
42017
The computational complexity of propositional cirquent calculus
MS Bauer
arXiv preprint arXiv:1401.1849, 2014
42014
Model checking indistinguishability of randomized security protocols
MS Bauer, R Chadha, AP Sistla, M Viswanathan
International Conference on Computer Aided Verification, 117-135, 2018
32018
On the weak computability of continuous real functions
MS Bauer, X Zheng
arXiv preprint arXiv:1006.0394, 2010
22010
Analysis of randomized security protocols
MS Bauer
University of Illinois at Urbana-Champaign, 2018
12018
Modelchecking Safety Properties in Randomized Security Protocols
MS Bauer, R Chadha, M Viswanathan
Logic, Language, and Security, 167-183, 2020
2020
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
The system can't perform the operation now. Try again later.
Articles 1–12