David Janin

Publication Activity (10 Years)

Years Active: 1993-2020
Publications (10 Years): 11

Top Topics

Monadic Datalog

Finite Automata

Extended Abstract

Top Venues

Developments in Language Theory

Publications

David Janin
A Timed IO Monad. PADL (2020)
David Janin
An Equational Modeling of Asynchronous Concurrent Programming. TFP (2020)
David Janin
Screaming in the IO monad: a realtime audio processing and control experiment in Haskell. FARM@ICFP (2019)
David Janin
Spatio-Temporal Domains: An Overview. ICTAC (2018)
Simon Archipoff, David Janin
Unified media programming: an algebraic approach. FARM@ICFP (2017)
David Janin
Walking Automata in Free Inverse Monoids. SOFSEM (2016)
Michael Sperber, David Janin
FARM 2016 demo summary. FARM@ICFP (2016)
Simon Archipoff, David Janin
Structured reactive programming with polymorphic temporal tiles. FARM@ICFP (2016)
Anne Dicky, David Janin
Two-way Automata and Regular Languages of Overlapping Tiles. Fundam. Informaticae 141 (4) (2015)
David Janin
On labeled birooted tree languages: Algebras, automata and logic. Inf. Comput. 243 (2015)
David Janin
Inverse Monoids of Higher-Dimensional Strings. ICTAC (2015)
Anne Dicky, David Janin
Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper). Developments in Language Theory (2014)
Paul Hudak, David Janin
Tiled polymorphic temporal media. FARM@ICFP (2014)
David Janin
Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems. SOFSEM (2014)
Etienne Dubourg, David Janin
Algebraic Tools for the Overlapping Tile Product. LATA (2014)
David Janin
Algebras, Automata and Logic for Languages of Labeled Birooted Trees. ICALP (2) (2013)
David Janin
Overlapping Tile Automata. CSR (2013)
David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati
The T-calculus: towards a structured programing of (musical) time and space. FARM@ICFP (2013)
David Janin
On Languages of One-Dimensional Overlapping Tiles. SOFSEM (2013)
Julien Bernet, David Janin
Une étude des jeux distribués. Tech. Sci. Informatiques 32 (9-10) (2013)
David Janin
Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract). MFCS (2012)
Florent Berthaut, David Janin, Benjamin Martin
Advanced Synchronization of Audio or Symbolic Musical Patterns: An Algebraic Approach. ICSC (2012)
Florent Berthaut, David Janin, Benjamin Martin
Advanced Synchronization of Audio or Symbolic Musical Patterns: an Algebraic Approach. Int. J. Semantic Comput. 6 (4) (2012)
Julien Bernet, David Janin
From Asynchronous to Synchronous Specifications for Distributed Program Synthesis. SOFSEM (2008)
David Janin
On the (High) Undecidability of Distributed Synthesis Problems. SOFSEM (1) (2007)
Anuj Dawar, David Janin
The monadic theory of finite representations of infinite words. Inf. Process. Lett. 103 (3) (2007)
Julien Bernet, David Janin
On Distributed Program Specification and Synthesis in Architectures with Cycles. FORTE (2006)
Dietmar Berwanger, David Janin
Automata on Directed Graphs: Edge Versus Vertex Marking. ICGT (2006)
Julien Bernet, David Janin
Tree Automata and Discrete Distributed Games. FCT (2005)
David Janin, Giacomo Lenzi
On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus. Fundam. Informaticae 61 (3-4) (2004)
Bruno Courcelle, David Janin
Workshop on Logic, Graph Transformations, Finite and Infinite Structures. ICGT (2004)
Anuj Dawar, David Janin
On the Bisimulation Invariant Fragment of Monadic S1 in the Finite. FSTTCS (2004)
David Janin, Giacomo Lenzi
On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees. Comput. Artif. Intell. 21 (3) (2002)
Julien Bernet, David Janin, Igor Walukiewicz
Permissive strategies: from parity games to safety games. RAIRO Theor. Informatics Appl. 36 (3) (2002)
David Janin, Jerzy Marcinkowski
A Toolkit for First Order Extensions of Monadic Games. STACS (2001)
David Janin, Giacomo Lenzi
Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy. LICS (2001)
David Janin, Giacomo Lenzi
On the Structure of the Monadic Logic of the Binary Tree. MFCS (1999)
David Janin
Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices. LICS (1997)
David Janin, Igor Walukiewicz
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic. CONCUR (1996)
David Janin, Igor Walukiewicz
Automata for the Modal mu-Calculus and related Results. MFCS (1995)
David Janin
Some Results About Logical Descriptions of Non-Deterministic Behaviours. FSTTCS (1993)