Gabriele Puppis

According to our database1, Gabriele Puppis
  • authored at least 43 papers between 2003 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
Regular Languages of Words over Countable Linear Orderings.
CoRR, 2017

One-way definability of two-way word transducers.
CoRR, 2017

Untwisting two-way transducers in elementary time.
CoRR, 2017

On the Decomposition of Finite-Valued Streaming String Transducers.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Untwisting two-way transducers in elementary time.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Bounded Repairability for Regular Tree Languages.
ACM Trans. Database Syst., 2016

Walking on Data Words.
Theory Comput. Syst., 2016

Querying Visible and Invisible Information.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Minimizing Resources of Sweeping and Streaming String Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2015
Which XML Schemas are Streaming Bounded Repairable?
Theory Comput. Syst., 2015

Games, Automata, Logics, and Formal Verification (GandALF 2013).
Inf. Comput., 2015

The complexity of higher-order queries.
Inf. Comput., 2015

A decidable weakening of Compass Logic based on cone-shaped cardinal directions.
Logical Methods in Computer Science, 2015

Logics with rigidly guarded data tests.
Logical Methods in Computer Science, 2015

Querying Visible and Invisible Tables in the Presence of Integrity Constraints.
CoRR, 2015

One-way Definability of Sweeping Transducer.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
The per-character cost of repairing word languages.
Theor. Comput. Sci., 2014

Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Bounded repairability of word languages.
J. Comput. Syst. Sci., 2013

Which DTDs are streaming bounded repairable?
Proceedings of the Joint 2013 EDBT/ICDT Conferences, 2013

Walking on Data Words.
Proceedings of the Computer Science - Theory and Applications, 2013

2012
Bounded repairability for regular tree languages.
Proceedings of the 15th International Conference on Database Theory, 2012

2011
On the Use of Guards for Logics with Data.
Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Regular Repair of Specifications.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Regular Languages of Words over Countable Linear Orderings.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

The Cost of Traveling between Languages.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Decidability of the Interval Temporal Logic ABB over the Natural Numbers.
Proceedings of the 27th International Symposium on Theoretical Aspects of Computer Science, 2010

Positive higher-order queries.
Proceedings of the Twenty-Ninth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2010

Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

Automata vs. Logics on Data Words.
Proceedings of the Computer Science Logic, 24th International Workshop, 2010

What You Must Remember When Processing Data Words.
Proceedings of the 4th Alberto Mendelzon International Workshop on Foundations of Data Management, 2010

Automata for Branching and Layered Temporal Structures: An Investigation into Regularities of Infinite Transition Systems
Lecture Notes in Computer Science 5955, Springer, ISBN: 978-3-642-11880-7, 2010

2009
Decidability of the interval temporal logic ABBar over the natural numbers
CoRR, 2009

A theory of ultimately periodic languages and automata with an application to time granularity.
Acta Inf., 2009

A Decidable Spatial Logic with Cone-Shaped Cardinal Directions.
Proceedings of the Computer Science Logic, 23rd international Workshop, 2009

2007
Compact and tractable automaton-based representations of time granularities.
Theor. Comput. Sci., 2007

On the Equivalence of Automaton-Based Representations of Time Granularities.
Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (TIME 2007), 2007

A Contraction Method to Decide MSO Theories of Deterministic Trees.
Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS 2007), 2007

2006
On the relationships between theories of time granularity and the monadic second-order theory of one successor.
Journal of Applied Non-Classical Logics, 2006

2004
Decidability of the Theory of the Totally Unbounded omega-Layered Structure.
Proceedings of the 11th International Symposium on Temporal Representation and Reasoning (TIME 2004), 2004

Time Granularities and Ultimately Periodic Automata.
Proceedings of the Logics in Artificial Intelligence, 9th European Conference, 2004

Decidability of MSO Theories of Tree Structures.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2003
Towards Compact and Tractable Automaten-Based Representations of Time Granularities.
Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003


  Loading...