Decomposition instead of self-composition for proving the absence of timing channels T Antonopoulos, P Gazzillo, M Hicks, E Koskinen, T Terauchi, S Wei
ACM SIGPLAN Notices 52 (6), 362-375, 2017
101 2017 Foundations for decision problems in separation logic with general inductive predicates T Antonopoulos, N Gorogiannis, C Haase, M Kanovich, J Ouaknine
International Conference on Foundations of Software Science and Computation …, 2014
81 2014 Reachability problems for Markov chains S Akshay, T Antonopoulos, J Ouaknine, J Worrell
Information Processing Letters 115 (2), 155-158, 2015
63 2015 Counterexample-guided approach to finding numerical invariants TV Nguyen, T Antonopoulos, A Ruef, M Hicks
Proceedings of the 2017 11th Joint Meeting on Foundations of Software …, 2017
49 2017 Definability problems for graph query languages T Antonopoulos, F Neven, F Servais
Proceedings of the 16th International Conference on Database Theory, 141-152, 2013
24 2013 DynamiTe: dynamic termination and non-termination proofs TC Le, T Antonopoulos, P Fathololumi, E Koskinen, TV Nguyen
Proceedings of the ACM on Programming Languages 4 (OOPSLA), 1-30, 2020
19 2020 Separating graph logic from MSO T Antonopoulos, A Dawar
International Conference on Foundations of Software Science and …, 2009
12 2009 Generating, sampling and counting subclasses of regular tree languages T Antonopoulos, F Geerts, W Martens, F Neven
Theory of Computing Systems 52 (3), 542-585, 2013
11 2013 Strongly unambiguous Büchi automata are polynomially predictable with membership queries D Angluin, T Antonopoulos, D Fisman
28th EACSL Annual Conference on Computer Science Logic (CSL 2020), 2020
8 2020 Proving UNSAT in Zero Knowledge N Luo, T Antonopoulos, W Harris, R Piskac, E Tromer, X Wang
Cryptology ePrint Archive, 2022
7 2022 ppSAT: Towards Two-Party Private SAT Solving. N Luo, S Judson, T Antonopoulos, R Piskac, X Wang
IACR Cryptol. ePrint Arch. 2021, 1584, 2021
6 2021 Specification and inference of trace refinement relations T Antonopoulos, E Koskinen, TC Le
Proceedings of the ACM on Programming Languages 3 (OOPSLA), 1-30, 2019
6 2019 An algebra of alignment for relational verification T Antonopoulos, E Koskinen, TC Le, R Nagasamudram, DA Naumann, ...
arXiv preprint arXiv:2202.04278, 2022
5 2022 A formal analysis of timing channel security via bucketing T Terauchi, T Antonopoulos
International Conference on Principles of Security and Trust, 29-50, 2019
5 2019 Using dynamically inferred invariants to analyze program runtime complexity TV Nguyen, D Ishimwe, A Malyshev, T Antonopoulos, QS Phan
Proceedings of the 3rd ACM SIGSOFT International Workshop on Software …, 2020
4 2020 Query learning of derived D Fisman, T Antonopoulos, D Angluin
Logical Methods in Computer Science 15, 2019
4 2019 Deciding twig-definability of node selecting tree automata T Antonopoulos, D Hovland, W Martens, F Neven
Theory of Computing Systems 57 (4), 967-1007, 2015
3 2015 The complexity of text-preserving XML transformations T Antonopoulos, W Martens, F Neven
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011
3 2011 IVeri: Privacy-Preserving Interdomain Verification N Luo, Q Xiang, T Antonopoulos, R Piskac, YR Yang, F Le
arXiv preprint arXiv:2202.02729, 2022
2 2022 Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata D Angluin, T Antonopoulos, D Fisman, N George
International Conference on Foundations of Software Science and Computation …, 2022
2 2022 