AgileByExample 2016

AgileByExample 2016

Accepted papers: track B

Mikolaj Bojanczyk, Hugo Gimbert and Edon Kelmendi.
Emptiness of zero automata is decidable
Volker Diekert and Murray Elder.
Solutions of Twisted Word Equations, EDT0L Languages, and Context-Free Groups
Fabian Reiter.
Asynchronous Distributed Automata: A Characterization of the Modal Mu-Fragment
Artur Jeż.
Word equations in nondeterministic linear space
Jérémie Chalopin and Victor Chepoi.
A Counterexample to Thiagarajan’s Conjecture on Regular Event Structures
Gilles Dowek.
Models and termination of proof reduction in the lambda-Pi-calculus modulo theory
Nathanaël Fijalkow, Bartek Klin and Prakash Panangaden.
Expressiveness of Probabilistic Modal Logics, Revisited
Lorenzo Clemente, Wojciech Czerwiński, Sławomir Lasota and Charles Paperman.
Regular Separability of Parikh Automata
Michael Benedikt, Pierre Bourhis and Michael Vanden Boom.
Characterizing Definability in Decidable Fixpoint Logics
Antoine Amarilli, Pierre Bourhis, Jachiet Louis and Mengel Stefan.
A Circuit-Based Approach to Efficient Enumeration
Bernard Boigelot, Isabelle Mainz, Victor Marsault and Michel Rigo.
An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention
Nicolas Bacquey, Etienne Grandjean and Frédéric Olive.
Definability by Horn formulas and linear time on cellular automata
Karl Bringmann, Thomas Dueholm Hansen and Sebastian Krinninger.
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs
Laura Bozzelli, Alberto Molinari, Angelo Montanari, Adriano Peron and Pietro Sala.
Satisfiability and Model Checking for the Logic of Sub-Intervals under the Homogeneity Assumption
Alain Finkel and Etienne Lozes.
Synchronizability of Communicating Finite State Machines is not Decidable
Gilles Barthe, Thomas Espitau, Justin Hsu, Tetsuya Sato and Pierre-Yves Strub.
*-Liftings for Differential Privacy
Giovanni Bacci, Giorgio Bacci, Kim Guldstrand Larsen and Radu Mardare.
On the Metric-based Approximate Minimization of Markov Chains
Michaël Cadilhac, Charles Paperman and Olivier Carton.
Continuity and Rational Functions
Borja Balle, Pascale Gourdeau and Prakash Panangaden.
Bisimulation Metrics for Weighted Automata
Diego Figueira, Ranko Lazic, Jerome Leroux, Filip Mazowiecki and Gregoire Sutre.
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension One
Nicolas Basset, Gilles Geeraerts, Jean-Francois Raskin and Ocan Sankur.
Admissibility in Concurrent Games
Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier and Thomas Zeume.
A Strategy for Dynamic Programs: Start over and Muddle through
Mikołaj Bojańczyk, Laure Daviaud, Bruno Guillon and Vincent Penelle.
Which classes of origin graphs are generated by transducers?
Raphaël Berthon, Mickael Randour and Jean-François Raskin.
Threshold Constraints with Guarantees for Parity Objectives in Markov Decision Processes
Jean Christoph Jung, Carsten Lutz, Mauricio Martel, Thomas Schneider and Frank Wolter.
Conservative Extensions in Guarded and Two-Variable Fragments
Luc Dartois, Paulin Fournier, Ismaël Jecker and Nathan Lhote.
On Reversible Transducers
Rajeev Alur, Konstantinos Mamouras and Caleb Stanford.
Automata-based Stream Processing
Amaury Pouly and Olivier Bournez.
A Universal Ordinary Differential Equation
Kazuyuki Asada and Naoki Kobayashi.
Pumping Lemma for Higher-order Languages
Dmitry Chistikov and Christoph Haase.
On the complexity of quantified integer programming
Benjamin Rossman.
Subspace-Invariant AC^0 Formulas
Albert Atserias and Joanna Ochremiak.
Proof Complexity Meets Algebra