Timos Antonopoulos

According to our database, Timos Antonopoulos authored at least 34 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions.

Samuel Judson, Matthew Elacqua, Filip Cano, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac

Proceedings of the Symposium on Computer Science and Law, 2024

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., January, 2023

Ou: Automating the Parallelization of Zero-Knowledge Protocols.

Yuyang Sang, Ning Luo, Samuel Judson, Ben Chaimberg, Timos Antonopoulos, Xiao Wang, Ruzica Piskac, Zhong Shao

IACR Cryptol. ePrint Arch., 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, Ning Luo

IACR Cryptol. ePrint Arch., 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

'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions.

Samuel Judson, Matthew Elacqua, Filip Cano Córdoba, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac

CoRR, 2023

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

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022

Proving UNSAT in Zero Knowledge.

Ning Luo, Timos Antonopoulos, William R. Harris, Ruzica Piskac, Eran Tromer, Xiao Wang

IACR Cryptol. ePrint Arch., 2022

IVeri: Privacy-Preserving Interdomain Verification.

Ning Luo, Qiao Xiang, Timos Antonopoulos, Ruzica Piskac, Y. Richard Yang, Franck Le

CoRR, 2022

Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata.

Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George

Proceedings of the Foundations of Software Science and Computation Structures, 2022

2021

ppSAT: Towards Two-Party Private SAT Solving.

Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang

IACR Cryptol. ePrint Arch., 2021

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

Proceedings of the 40th IEEE Conference on Computer Communications, 2021

2020

DynamiTe: dynamic termination and non-termination proofs.

Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen

Proc. ACM Program. Lang., 2020

Bucketing and information flow analysis for provable timing attack mitigation.

Tachio Terauchi, Timos Antonopoulos

J. Comput. Secur., 2020

Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms.

Samuel Judson, Ning Luo, Timos Antonopoulos, Ruzica Piskac

Proceedings of the WPES'20: Proceedings of the 19th Workshop on Privacy in the Electronic Society, 2020

Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries.

Dana Angluin, Timos Antonopoulos, Dana Fisman

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Specification and inference of trace refinement relations.

Timos Antonopoulos, Eric Koskinen, Ton Chanh Le

Proc. ACM Program. Lang., 2019

Query learning of derived ωω\omega-tree languages in polynomial time.

Dana Angluin, Timos Antonopoulos, Dana Fisman

Log. Methods Comput. Sci., 2019

A Formal Analysis of Timing Channel Security via Bucketing.

Tachio Terauchi, Timos Antonopoulos

Proceedings of the Principles of Security and Trust - 8th International Conference, 2019

Games for Security Under Adaptive Adversaries.

Timos Antonopoulos, Tachio Terauchi

Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018

Query learning of derived ω-tree languages in polynomial time.

Dana Angluin, Timos Antonopoulos, Dana Fisman

CoRR, 2018

2017

Counterexample-guided approach to finding numerical invariants.

ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, Michael Hicks

Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering, 2017

Decomposition instead of self-composition for proving the absence of timing channels.

Timos Antonopoulos, Paul Gazzillo, Michael Hicks, Eric Koskinen, Tachio Terauchi, Shiyi Wei

Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Query Learning of Derived Omega-Tree Languages in Polynomial Time.

Dana Angluin, Timos Antonopoulos, Dana Fisman

Proceedings of the 26th EACSL Annual Conference on Computer Science Logic, 2017

2015

Deciding Twig-definability of Node Selecting Tree Automata.

Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven

Theory Comput. Syst., 2015

Reachability problems for Markov chains.

S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell

Inf. Process. Lett., 2015

Three Variables Suffice for Real-Time Logic.

Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell

Proceedings of the Foundations of Software Science and Computation Structures, 2015

2014

Three Variables are Enough for Real-Time Specification.

Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell

CoRR, 2014

Foundations for Decision Problems in Separation Logic with General Inductive Predicates.

Timos Antonopoulos, Nikos Gorogiannis, Christoph Haase, Max I. Kanovich, Joël Ouaknine

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.

Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven

Theory Comput. Syst., 2013

Definability problems for graph query languages.

Timos Antonopoulos, Frank Neven, Frédéric Servais

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2011

The complexity of text-preserving XML transformations.

Timos Antonopoulos, Wim Martens, Frank Neven

Proceedings of the 30th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2011

2009

Expressive power of graph languages.

Timos Antonopoulos

PhD thesis, 2009

Separating Graph Logic from MSO.

Timos Antonopoulos, Anuj Dawar

Proceedings of the Foundations of Software Science and Computational Structures, 2009