Separating Graph Logic from MSO. - Timos Antonopoulos; Anuj Dawar (FoSSaCS, 2009)

Expressive power of graph languages. - Timos Antonopoulos (2009)

The complexity of text-preserving XML transformations. - Timos Antonopoulos; Wim Martens; Frank Neven (PODS, 2011)

Definability problems for graph query languages. - Timos Antonopoulos; Frank Neven; Frédéric Servais (ICDT, 2013)

Generating, Sampling and Counting Subclasses of Regular Tree Languages. - Timos Antonopoulos; Floris Geerts; Wim Martens; Frank Neven (Theory Comput. Syst., 2013)

Foundations for Decision Problems in Separation Logic with General Inductive Predicates. - Timos Antonopoulos; Nikos Gorogiannis; Christoph Haase; Max I. Kanovich; Joël Ouaknine (FoSSaCS, 2014)

Three Variables are Enough for Real-Time Specification. - Timos Antonopoulos; Paul Hunter 001; Shahab Raza; James Worrell 001 (CoRR, 2014)

Three Variables Suffice for Real-Time Logic. - Timos Antonopoulos; Paul Hunter 001; Shahab Raza; James Worrell 001 (FoSSaCS, 2015)

Reachability problems for Markov chains. - S. Akshay 001; Timos Antonopoulos; Joël Ouaknine; James Worrell 001 (Inf. Process. Lett., 2015)

Deciding Twig-definability of Node Selecting Tree Automata. - Timos Antonopoulos; Dag Hovland; Wim Martens; Frank Neven (Theory Comput. Syst., 2015)

Query Learning of Derived Omega-Tree Languages in Polynomial Time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2017)

Decomposition instead of self-composition for proving the absence of timing channels. - Timos Antonopoulos; Paul Gazzillo; Michael Hicks 001; Eric Koskinen; Tachio Terauchi; Shiyi Wei (PLDI, 2017)

Counterexample-guided approach to finding numerical invariants. - ThanhVu Nguyen; Timos Antonopoulos; Andrew Ruef; Michael Hicks 001 (ESEC/SIGSOFT FSE, 2017)

Query learning of derived ω-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CoRR, 2018)

Games for Security Under Adaptive Adversaries. - Timos Antonopoulos; Tachio Terauchi (CSF, 2019)

A Formal Analysis of Timing Channel Security via Bucketing. - Tachio Terauchi; Timos Antonopoulos (POST, 2019)

Query learning of derived ωω omega-tree languages in polynomial time. - Dana Angluin; Timos Antonopoulos; Dana Fisman (Log. Methods Comput. Sci., 2019)

Specification and inference of trace refinement relations. - Timos Antonopoulos; Eric Koskinen; Ton Chanh Le (Proc. ACM Program. Lang., 2019)

Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. - Dana Angluin; Timos Antonopoulos; Dana Fisman (CSL, 2020)

Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms. - Samuel Judson; Ning Luo; Timos Antonopoulos; Ruzica Piskac (WPES@CCS, 2020)

Bucketing and information flow analysis for provable timing attack mitigation. - Tachio Terauchi; Timos Antonopoulos (J. Comput. Secur., 2020)

DynamiTe: dynamic termination and non-termination proofs. - Ton Chanh Le; Timos Antonopoulos; Parisa Fathololumi; Eric Koskinen; ThanhVu Nguyen (Proc. ACM Program. Lang., 2020)

Looking for the Maximum Independent Set: A New Perspective on the Stable Path Problem. - Yichao Cheng; Ning Luo; Jingxuan Zhang; Timos Antonopoulos; Ruzica Piskac; Qiao Xiang (INFOCOM, 2021)

ppSAT: Towards Two-Party Private SAT Solving. - Ning Luo; Samuel Judson; Timos Antonopoulos; Ruzica Piskac; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2021)

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. - Dana Angluin; Timos Antonopoulos; Dana Fisman; Nevin George (FoSSaCS, 2022)

IVeri: Privacy-Preserving Interdomain Verification. - Ning Luo; Qiao Xiang; Timos Antonopoulos; Ruzica Piskac; Y. Richard Yang; Franck Le (CoRR, 2022)

Proving UNSAT in Zero Knowledge. - Ning Luo; Timos Antonopoulos; William R. Harris; Ruzica Piskac; Eran Tromer; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2022)

Analyzing Intentional Behavior in Autonomous Agents under Uncertainty. - Filip Cano Córdoba; Samuel Judson; Timos Antonopoulos; Katrine Bjørner; Nicholas Shoemaker; Scott J. Shapiro; Ruzica Piskac; Bettina Könighofer (IJCAI, 2023)

DrNLA: Extending Verification to Non-linear Programs through Dual Re-writing. - Yuandong Cyrus Liu; Ton-Chanh Le; Timos Antonopoulos; Eric Koskinen; ThanhVu Nguyen (CoRR, 2023)

ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge. - Daniel Luick; John C. Kolesar; Timos Antonopoulos; William R. Harris; James Parker; Ruzica Piskac; Eran Tromer; Xiao Wang 012; Ning Luo (IACR Cryptol. ePrint Arch., 2023)

Ou: Automating the Parallelization of Zero-Knowledge Protocols. - Yuyang Sang; Ning Luo; Samuel Judson; Ben Chaimberg; Timos Antonopoulos; Xiao Wang 012; Ruzica Piskac; Zhong Shao 001 (IACR Cryptol. ePrint Arch., 2023)

An Algebra of Alignment for Relational Verification. - Timos Antonopoulos; Eric Koskinen; Ton Chanh Le; Ramana Nagasamudram; David A. Naumann; Minh Ngo (Proc. ACM Program. Lang., 2023)

soid: A Tool for Legal Accountability for Automated Decision Making. - Samuel Judson; Matthew Elacqua; Filip Cano 001; Timos Antonopoulos; Bettina Könighofer; Scott J. Shapiro; Ruzica Piskac (CAV (2), 2024)

'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions. - Samuel Judson; Matthew Elacqua; Filip Cano 001; Timos Antonopoulos; Bettina Könighofer; Scott J. Shapiro; Ruzica Piskac (CSLAW, 2024)

Systematic Use of Random Self-Reducibility in Cryptographic Code against Physical Attacks. - Ferhat Erata; Tinghung Chiu; Anthony Etim; Srilalith Nampally; Tejas Raju; Rajashree Ramu; Ruzica Piskac; Timos Antonopoulos; Wenjie Xiong 001; Jakub Szefer (ICCAD, 2024)

Systematic Use of Random Self-Reducibility against Physical Attacks. - Ferhat Erata; Tinghung Chiu; Anthony Etim; Srilalith Nampally; Tejas Raju; Rajashree Ramu; Ruzica Piskac; Timos Antonopoulos; Wenjie Xiong 001; Jakub Szefer (CoRR, 2024)

Scheherazade: Evaluating Chain-of-Thought Math Reasoning in LLMs with Chain-of-Problems. - Stephen Miner; Yoshiki Takashima; Simeng Han; Ferhat Erata; Timos Antonopoulos; Ruzica Piskac; Scott J. Shapiro (CoRR, 2024)

Learning Randomized Reductions and Program Properties. - Ferhat Erata; Orr Paradise; Timos Antonopoulos; ThanhVu Nguyen; Shafi Goldwasser; Ruzica Piskac (CoRR, 2024)

Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge. - John C. Kolesar; Shan Ali; Timos Antonopoulos; Ruzica Piskac (CoRR, 2025)