Department of CS, UIUC
201 N. Goodwin Avenue
Urbana, IL 61801

Matthew S. Bauer

I am a fifth year Ph.D. student in computer science at the University of Illinois interested in cyber-security, high assurance computer systems and formal verification.


9 Matthew S. Bauer, Rohit Chadha and Mahesh Viswanathan. Model checking randomized security protocols against active attacks. In preparation.

8 Matthew S. Bauer, Umang Mathur, Rohit Chadha, A. Prasad Sistla and Mahesh Viswanathan. Exact quantitative probabilistic model checking through rational search. Proceedings of the 17th Conference on Formal Methods in Computer Aided Design (FMCAD), 2017. Preprint

7 Matthew S. Bauer, Rohit Chadha and Mahesh Viswanathan. Modular verification of protocol equivalence in the presence of randomness. Proceedings of the 22nd European Symposium on Research in Computer Security (ESORICS), 2017. Full Version

6 Matthew S. Bauer, Rohit Chadha and Mahesh Viswanathan. Composing protocols with randomized actions. Proceedings of the 5th International Conference on Principles of Security and Trust (POST), 2016. Official Version

5 Matthew S. Bauer. The computational complexity of propositional cirquent calculus. Logical Methods in Computer Science (LMCS) 11, 2015, N 1:12. Official Version

4 Matthew S. Bauer. A PSPACE-complete First order fragment of computability logic. ACM Transactions on Computational Logic (TOCL) 15 2014, N 1. Official Version

3 Matthew S. Bauer and Mirela Damian. An infinite class of Yao spanners. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), 2013. Official Version

2 Matthew S. Bauer and Mirela Damian. Some sparse Yao graphs are spanners. Proceedings of the 28th European Workshop on Computational Geometry (EuroCG), 2012.

1 Matthew S. Bauer and Xizhong Zheng. On the weak computability of continuous real functions. Proceedings of the 2010 Conference on Computability and Complexity in Analysis (CCA), 2010. EPTCS, Vol. 24, pp. 29-40. Official Version