On the Weak Computability of Continuous Real Functions - Matthew S. Bauer; Xizhong Zheng (CCA, 2010)

A PSPACE-complete first-order fragment of computability logic. - Matthew S. Bauer (ACM Trans. Comput. Log., 2014)

The Computational Complexity of Propositional Cirquent Calculus. - Matthew S. Bauer (Log. Methods Comput. Sci., 2015)

Composing Protocols with Randomized Actions. - Matthew S. Bauer; Rohit Chadha; Mahesh Viswanathan 001 (POST, 2016)

Modular Verification of Protocol Equivalence in the Presence of Randomness. - Matthew S. Bauer; Rohit Chadha; Mahesh Viswanathan 001 (ESORICS (1), 2017)

Model Checking Indistinguishability of Randomized Security Protocols. - Matthew S. Bauer; Rohit Chadha; A. Prasad Sistla; Mahesh Viswanathan 001 (CAV (2), 2018)

Analysis of randomized security protocols - Matthew S. Bauer (2018)

Modelchecking Safety Properties in Randomized Security Protocols. - Matthew S. Bauer; Rohit Chadha; Mahesh Viswanathan 001 (Logic, Language, and Security, 2020)

Exact quantitative probabilistic model checking through rational search. - Umang Mathur 001; Matthew S. Bauer; Rohit Chadha; A. Prasad Sistla; Mahesh Viswanathan 001 (Formal Methods Syst. Des., 2020)