Timos Antonopoulos

ORCID

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 34

Top Venues

CoRR

IACR Cryptol. ePrint Arch.

FoSSaCS

Proc. ACM Program. Lang.

University of Cambridge, UK (PHD)

Education History

University of Cambridge, UK

PHD

Publications

Filip Cano Córdoba, Samuel Judson, Timos Antonopoulos, Katrine Bjørner, Nicholas Shoemaker, Scott J. Shapiro, Ruzica Piskac, Bettina Könighofer
Analyzing Intentional Behavior in Autonomous Agents under Uncertainty. CoRR (2023)
Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo
An Algebra of Alignment for Relational Verification. Proc. ACM Program. Lang. 7 (POPL) (2023)
Yuyang Sang, Ning Luo, Samuel Judson, Ben Chaimberg, Timos Antonopoulos, Xiao Wang, Ruzica Piskac, Zhong Shao
Ou: Automating the Parallelization of Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2023 (2023)
Filip Cano Córdoba, Samuel Judson, Timos Antonopoulos, Katrine Bjørner, Nicholas Shoemaker, Scott J. Shapiro, Ruzica Piskac, Bettina Könighofer
Analyzing Intentional Behavior in Autonomous Agents under Uncertainty. IJCAI (2023)
Yuandong Cyrus Liu, Ton-Chanh Le, Timos Antonopoulos, Eric Koskinen, ThanhVu Nguyen
DrNLA: Extending Verification to Non-linear Programs through Dual Re-writing. CoRR (2023)
Yuyang Sang, Ning Luo, Samuel Judson, Ben Chaimberg, Timos Antonopoulos, Xiao Wang, Ruzica Piskac, Zhong Shao
Ou: Automating the Parallelization of Zero-Knowledge Protocols. CCS (2023)
Samuel Judson, Matthew Elacqua, Filip Cano Córdoba, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac
'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions. CoRR (2023)
Daniel Luick, John C. Kolesar, Timos Antonopoulos, William R. Harris, James Parker, Ruzica Piskac, Eran Tromer, Xiao Wang, Ning Luo
ZKSMT: A VM for Proving SMT Theorems in Zero Knowledge. IACR Cryptol. ePrint Arch. 2023 (2023)
Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS (2022)
Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang
ppSAT: Towards Two-Party Private SAT Solving. USENIX Security Symposium (2022)
Ning Luo, Timos Antonopoulos, William R. Harris, Ruzica Piskac, Eran Tromer, Xiao Wang
Proving UNSAT in Zero Knowledge. IACR Cryptol. ePrint Arch. 2022 (2022)
Ning Luo, Qiao Xiang, Timos Antonopoulos, Ruzica Piskac, Y. Richard Yang, Franck Le
IVeri: Privacy-Preserving Interdomain Verification. CoRR (2022)
Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo
An algebra of alignment for relational verification. CoRR (2022)
Ning Luo, Timos Antonopoulos, William R. Harris, Ruzica Piskac, Eran Tromer, Xiao Wang
Proving UNSAT in Zero Knowledge. CCS (2022)
Yichao Cheng, Ning Luo, Jingxuan Zhang, Timos Antonopoulos, Ruzica Piskac, Qiao Xiang
Looking for the Maximum Independent Set: A New Perspective on the Stable Path Problem. INFOCOM (2021)
Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang
ppSAT: Towards Two-Party Private SAT Solving. IACR Cryptol. ePrint Arch. 2021 (2021)
Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen
DynamiTe: dynamic termination and non-termination proofs. Proc. ACM Program. Lang. 4 (OOPSLA) (2020)
Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen
DynamiTe: Dynamic Termination and Non-termination Proofs. CoRR (2020)
Samuel Judson, Ning Luo, Timos Antonopoulos, Ruzica Piskac
Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms. WPES@CCS (2020)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL (2020)
Tachio Terauchi, Timos Antonopoulos
Bucketing and information flow analysis for provable timing attack mitigation. J. Comput. Secur. 28 (6) (2020)
Tachio Terauchi, Timos Antonopoulos
A Formal Analysis of Timing Channel Security via Bucketing. POST (2019)
Timos Antonopoulos, Eric Koskinen, Ton Chanh Le
Specification and inference of trace refinement relations. Proc. ACM Program. Lang. 3 (OOPSLA) (2019)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query learning of derived ωω\omega-tree languages in polynomial time. Log. Methods Comput. Sci. 15 (3) (2019)
ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, Michael Hicks
A Counterexample-guided Approach to Finding Numerical Invariants. CoRR (2019)
Timos Antonopoulos, Eric Koskinen, Ton-Chanh Le
Specification and Inference of Trace Refinement Relations. CoRR (2019)
Timos Antonopoulos, Tachio Terauchi
Games for Security Under Adaptive Adversaries. CSF (2019)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query learning of derived ω-tree languages in polynomial time. CoRR (2018)
Dana Angluin, Timos Antonopoulos, Dana Fisman
Query Learning of Derived Omega-Tree Languages in Polynomial Time. CSL (2017)
Timos Antonopoulos, Paul Gazzillo, Michael Hicks, Eric Koskinen, Tachio Terauchi, Shiyi Wei
Decomposition instead of self-composition for proving the absence of timing channels. PLDI (2017)
ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, Michael Hicks
Counterexample-guided approach to finding numerical invariants. ESEC/SIGSOFT FSE (2017)
Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven
Deciding Twig-definability of Node Selecting Tree Automata. Theory Comput. Syst. 57 (4) (2015)
Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell
Three Variables Suffice for Real-Time Logic. FoSSaCS (2015)
S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell
Reachability problems for Markov chains. Inf. Process. Lett. 115 (2) (2015)
Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine
Foundations for Decision Problems in Separation Logic with General Inductive Predicates. FoSSaCS (2014)
Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell
Three Variables are Enough for Real-Time Specification. CoRR (2014)
Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven
Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52 (3) (2013)
Timos Antonopoulos, Frank Neven, Frédéric Servais
Definability problems for graph query languages. ICDT (2013)
Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven
Deciding twig-definability of node selecting tree automata. ICDT (2012)
Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven
Generating, sampling and counting subclasses of regular tree languages. ICDT (2011)
Timos Antonopoulos, Wim Martens, Frank Neven
The complexity of text-preserving XML transformations. PODS (2011)
Timos Antonopoulos, Anuj Dawar
Separating Graph Logic from MSO. FoSSaCS (2009)

Timos Antonopoulos.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Timos Antonopoulos