( en | de | ru )

 

Disambiguation of "Antonopoulos, Timos"

Author of the publication

copydeleteadd this publication to your clipboard
Bucketing and information flow analysis for provable timing attack mitigation.

, and . J. Comput. Secur., 28 (6): 607-634 (2020)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Timos Antonopoulos

Kosmas Antonopoulos

Georg Antonopoulos

Ekatarina Timoshenko

Ekaterina Timoshenko

 

Other publications of authors with the same name

Query learning of derived ωωømega-tree languages in polynomial time., , and . Logical Methods in Computer Science, (2019)'Put the Car on the Stand': SMT-based Oracles for Investigating Decisions., , , , , , and . CoRR, (2023)Analyzing Intentional Behavior in Autonomous Agents under Uncertainty., , , , , , , and . IJCAI, page 372-381. ijcai.org, (2023)Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries., , and . CSL, volume 152 of LIPIcs, page 8:1-8:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Counterexample-guided Approach to Finding Numerical Invariants., , , and . CoRR, (2019)DynamiTe: dynamic termination and non-termination proofs., , , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 189:1-189:30 (2020)Specification and inference of trace refinement relations., , and . Proc. ACM Program. Lang., 3 (OOPSLA): 178:1-178:30 (2019)Proving UNSAT in Zero Knowledge., , , , , and . CCS, page 2203-2217. ACM, (2022)Representing Regular Languages of Infinite Words Using Mod 2 Multiplicity Automata., , , and . FoSSaCS, volume 13242 of Lecture Notes in Computer Science, page 1-20. Springer, (2022)Bucketing and information flow analysis for provable timing attack mitigation., and . J. Comput. Secur., 28 (6): 607-634 (2020)