Travelled to:1 × France
1 × Greece
2 × United Kingdom
Collaborated with:D.Angluin D.Fisman A.Dawar E.Koskinen M.H.0001 W.Martens F.Neven T.C.Le P.Hunter S.Raza J.Worrell T.Nguyen A.Ruef N.Gorogiannis C.Haase M.I.Kanovich J.Ouaknine P.Gazzillo T.Terauchi S.Wei
Talks about:logic (3) time (3) polynomi (2) separ (2) queri (2) counterexampl (1) membership (1) decomposit (1) transform (1) unambigu (1)
Person: Timos Antonopoulos
DBLP: Antonopoulos:Timos
Contributed to:
20152014
20112009
2017
20172020
2019
2017Wrote 9 papers:
- FoSSaCS-2015-AntonopoulosHRW #logic #realtime
- Three Variables Suffice for Real-Time Logic (TA, PH, SR, JW), pp. 361–374.
- FoSSaCS-2014-AntonopoulosGHKO #induction #logic #problem
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates (TA, NG, CH, MIK, JO), pp. 411–425.
- PODS-2011-AntonopoulosMN #complexity #xml
- The complexity of text-preserving XML transformations (TA, WM, FN), pp. 247–258.
- FoSSaCS-2009-AntonopoulosD #graph #logic
- Separating Graph Logic from MSO (TA, AD), pp. 63–77.
- ESEC-FSE-2017-NguyenARH #approach #invariant
- Counterexample-guided approach to finding numerical invariants (TN, TA, AR, MH0), pp. 605–615.
- CSL-2017-AngluinAF #learning #polynomial #query
- Query Learning of Derived Omega-Tree Languages in Polynomial Time (DA, TA, DF), p. 21.
- CSL-2020-AngluinAF #ambiguity #automaton #predict #query
- Strongly Unambiguous Büchi Automata Are Polynomially Predictable With Membership Queries (DA, TA, DF), p. 17.
- OOPSLA-2019-AntonopoulosKL #refinement #specification
- Specification and inference of trace refinement relations (TA, EK, TCL), p. 30.
- PLDI-2017-AntonopoulosGHK #composition #proving #self
- Decomposition instead of self-composition for proving the absence of timing channels (TA, PG, MH0, EK, TT, SW), pp. 362–375.