default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTimos Antonopoulos
2020 – today
- 2024
[c23]Samuel Judson, Matthew Elacqua, Filip Cano
, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac:
soid: A Tool for Legal Accountability for Automated Decision Making. CAV (2) 2024: 233-246- [c22]Samuel Judson, Matthew Elacqua, Filip Cano, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac:
'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions. CSLAW 2024: 73-85 - [c21]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. USENIX Security Symposium 2024 - [i17]Ferhat Erata, Tinghung Chiu, Anthony Etim, Srilalith Nampally, Tejas Raju, Rajashree Ramu, Ruzica Piskac, Timos Antonopoulos, Wenjie Xiong, Jakub Szefer:
Systematic Use of Random Self-Reducibility against Physical Attacks. CoRR abs/2405.05193 (2024) - [i16]Stephen Miner, Yoshiki Takashima, Simeng Han, Ferhat Erata, Timos Antonopoulos, Ruzica Piskac, Scott J. Shapiro:
Scheherazade: Evaluating Chain-of-Thought Math Reasoning in LLMs with Chain-of-Problems. CoRR abs/2410.00151 (2024) - [i15]Ferhat Erata, Orr Paradise, Timos Antonopoulos, ThanhVu Nguyen, Shafi Goldwasser, Ruzica Piskac:
Learning Randomized Reductions and Program Properties. CoRR abs/2412.18134 (2024) - 2023
- [j8]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): 573-603 (2023) - [c20]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: 534-548 - [c19]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: 372-381 - [i14]Samuel Judson, Matthew Elacqua, Filip Cano, Timos Antonopoulos, Bettina Könighofer, Scott J. Shapiro, Ruzica Piskac:
'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions. CoRR abs/2305.05731 (2023) - [i13]Yuandong Cyrus Liu, Ton-Chanh Le, Timos Antonopoulos, Eric Koskinen, ThanhVu Nguyen:
DrNLA: Extending Verification to Non-linear Programs through Dual Re-writing. CoRR abs/2306.15584 (2023) - [i12]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 abs/2307.01532 (2023) - [i11]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: 657 (2023) - [i10]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: 1762 (2023) - 2022
- [c18]Ning Luo, Timos Antonopoulos, William R. Harris, Ruzica Piskac, Eran Tromer, Xiao Wang:
Proving UNSAT in Zero Knowledge. CCS 2022: 2203-2217 - [c17]Dana Angluin, Timos Antonopoulos, Dana Fisman, Nevin George:
Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata. FoSSaCS 2022: 1-20 - [c16]Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang:
ppSAT: Towards Two-Party Private SAT Solving. USENIX Security Symposium 2022: 2983-3000 - [i9]Ning Luo, Qiao Xiang, Timos Antonopoulos, Ruzica Piskac, Y. Richard Yang, Franck Le:
IVeri: Privacy-Preserving Interdomain Verification. CoRR abs/2202.02729 (2022) - [i8]Timos Antonopoulos, Eric Koskinen, Ton Chanh Le, Ramana Nagasamudram, David A. Naumann, Minh Ngo:
An algebra of alignment for relational verification. CoRR abs/2202.04278 (2022) - [i7]Ning Luo, Timos Antonopoulos, William R. Harris, Ruzica Piskac, Eran Tromer, Xiao Wang:
Proving UNSAT in Zero Knowledge. IACR Cryptol. ePrint Arch. 2022: 206 (2022) - 2021
- [c15]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: 1-10 - [i6]Ning Luo, Samuel Judson, Timos Antonopoulos, Ruzica Piskac, Xiao Wang:
ppSAT: Towards Two-Party Private SAT Solving. IACR Cryptol. ePrint Arch. 2021: 1584 (2021) - 2020
- [j7]Tachio Terauchi, Timos Antonopoulos:
Bucketing and information flow analysis for provable timing attack mitigation. J. Comput. Secur. 28(6): 607-634 (2020) - [j6]Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen:
DynamiTe: dynamic termination and non-termination proofs. Proc. ACM Program. Lang. 4(OOPSLA): 189:1-189:30 (2020) - [c14]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries. CSL 2020: 8:1-8:17 - [c13]Samuel Judson, Ning Luo, Timos Antonopoulos, Ruzica Piskac:
Privacy Preserving CTL Model Checking through Oblivious Graph Algorithms. WPES@CCS 2020: 101-115 - [i5]Ton Chanh Le, Timos Antonopoulos, Parisa Fathololumi, Eric Koskinen, ThanhVu Nguyen:
DynamiTe: Dynamic Termination and Non-termination Proofs. CoRR abs/2010.05747 (2020)
2010 – 2019
- 2019
- [j5]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query learning of derived ωω\omega-tree languages in polynomial time. Log. Methods Comput. Sci. 15(3) (2019) - [j4]Timos Antonopoulos, Eric Koskinen, Ton Chanh Le:
Specification and inference of trace refinement relations. Proc. ACM Program. Lang. 3(OOPSLA): 178:1-178:30 (2019) - [c12]Timos Antonopoulos, Tachio Terauchi:
Games for Security Under Adaptive Adversaries. CSF 2019: 216-229 - [c11]Tachio Terauchi, Timos Antonopoulos:
A Formal Analysis of Timing Channel Security via Bucketing. POST 2019: 29-50 - [i4]Timos Antonopoulos, Eric Koskinen, Ton-Chanh Le:
Specification and Inference of Trace Refinement Relations. CoRR abs/1903.07213 (2019) - [i3]ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, Michael Hicks:
A Counterexample-guided Approach to Finding Numerical Invariants. CoRR abs/1903.12113 (2019) - 2018
- [i2]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query learning of derived ω-tree languages in polynomial time. CoRR abs/1802.04739 (2018) - 2017
- [c10]Dana Angluin, Timos Antonopoulos, Dana Fisman:
Query Learning of Derived Omega-Tree Languages in Polynomial Time. CSL 2017: 10:1-10:21 - [c9]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: 362-375 - [c8]ThanhVu Nguyen, Timos Antonopoulos, Andrew Ruef, Michael Hicks:
Counterexample-guided approach to finding numerical invariants. ESEC/SIGSOFT FSE 2017: 605-615 - 2015
- [j3]S. Akshay, Timos Antonopoulos, Joël Ouaknine, James Worrell:
Reachability problems for Markov chains. Inf. Process. Lett. 115(2): 155-158 (2015) - [j2]Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding Twig-definability of Node Selecting Tree Automata. Theory Comput. Syst. 57(4): 967-1007 (2015) - [c7]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables Suffice for Real-Time Logic. FoSSaCS 2015: 361-374 - 2014
- [c6]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: 411-425 - [i1]Timos Antonopoulos, Paul Hunter, Shahab Raza, James Worrell:
Three Variables are Enough for Real-Time Specification. CoRR abs/1408.1851 (2014) - 2013
- [j1]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven:
Generating, Sampling and Counting Subclasses of Regular Tree Languages. Theory Comput. Syst. 52(3): 542-585 (2013) - [c5]Timos Antonopoulos, Frank Neven, Frédéric Servais:
Definability problems for graph query languages. ICDT 2013: 141-152 - 2012
- [c4]Timos Antonopoulos, Dag Hovland, Wim Martens, Frank Neven:
Deciding twig-definability of node selecting tree automata. ICDT 2012: 61-73 - 2011
- [c3]Timos Antonopoulos, Floris Geerts, Wim Martens, Frank Neven:
Generating, sampling and counting subclasses of regular tree languages. ICDT 2011: 30-41 - [c2]Timos Antonopoulos, Wim Martens, Frank Neven:
The complexity of text-preserving XML transformations. PODS 2011: 247-258
2000 – 2009
- 2009
- [b1]Timos Antonopoulos:
Expressive power of graph languages. University of Cambridge, UK, 2009 - [c1]Timos Antonopoulos, Anuj Dawar:
Separating Graph Logic from MSO. FoSSaCS 2009: 63-77
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-11 20:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
