# Timos Antonopoulos

According to our database

Collaborative distances:

^{1}, Timos Antonopoulos authored at least 16 papers between 2009 and 2018.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### On csauthors.net:

## Bibliography

2018

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

CoRR, 2018

2017

Counterexample-guided approach to finding numerical invariants.

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.

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

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

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

2015

Deciding Twig-definability of Node Selecting Tree Automata.

Theory Comput. Syst., 2015

Reachability problems for Markov chains.

Inf. Process. Lett., 2015

Three Variables Suffice for Real-Time Logic.

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

2014

Three Variables are Enough for Real-Time Specification.

CoRR, 2014

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

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

2013

Generating, Sampling and Counting Subclasses of Regular Tree Languages.

Theory Comput. Syst., 2013

Definability problems for graph query languages.

Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

2012

Deciding twig-definability of node selecting tree automata.

Proceedings of the 15th International Conference on Database Theory, 2012

2011

The complexity of text-preserving XML transformations.

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

Generating, sampling and counting subclasses of regular tree languages.

Proceedings of the Database Theory, 2011

2009

Expressive power of graph languages.

PhD thesis, 2009

Separating Graph Logic from MSO.

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