David Janin

According to our database, David Janin authored at least 41 papers between 1993 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

An Equational Modeling of Asynchronous Concurrent Programming.

David Janin

Proceedings of the Trends in Functional Programming - 21st International Symposium, 2020

A Timed IO Monad.

David Janin

Proceedings of the Practical Aspects of Declarative Languages, 2020

2019

Screaming in the IO monad: a realtime audio processing and control experiment in Haskell.

David Janin

Proceedings of the 7th ACM SIGPLAN International Workshop on Functional Art, 2019

2018

Spatio-Temporal Domains: An Overview.

David Janin

Proceedings of the Theoretical Aspects of Computing - ICTAC 2018, 2018

2017

Unified media programming: an algebraic approach.

Simon Archipoff, David Janin

Proceedings of the 5th ACM SIGPLAN International Workshop on Functional Art, 2017

2016

Walking Automata in Free Inverse Monoids.

David Janin

Proceedings of the SOFSEM 2016: Theory and Practice of Computer Science, 2016

FARM 2016 demo summary.

Michael Sperber, David Janin

Proceedings of the 4th International Workshop on Functional Art, 2016

Structured reactive programming with polymorphic temporal tiles.

Simon Archipoff, David Janin

Proceedings of the 4th International Workshop on Functional Art, 2016

2015

On labeled birooted tree languages: Algebras, automata and logic.

David Janin

Inf. Comput., 2015

Two-way Automata and Regular Languages of Overlapping Tiles.

Anne Dicky, David Janin

Fundam. Informaticae, 2015

Inverse Monoids of Higher-Dimensional Strings.

David Janin

Proceedings of the Theoretical Aspects of Computing - ICTAC 2015, 2015

2014

Towards a Higher-Dimensional String Theory for the Modeling of Computerized Systems.

David Janin

Proceedings of the SOFSEM 2014: Theory and Practice of Computer Science, 2014

Algebraic Tools for the Overlapping Tile Product.

Etienne Dubourg, David Janin

Proceedings of the Language and Automata Theory and Applications, 2014

Tiled polymorphic temporal media.

Paul Hudak, David Janin

Proceedings of the 2nd ACM SIGPLAN international workshop on Functional art, 2014

Embedding Finite and Infinite Words into Overlapping Tiles - (Short Paper).

Anne Dicky, David Janin

Proceedings of the Developments in Language Theory - 18th International Conference, 2014

2013

Une étude des jeux distribués.

Julien Bernet, David Janin

Tech. Sci. Informatiques, 2013

On Languages of One-Dimensional Overlapping Tiles.

David Janin

Proceedings of the SOFSEM 2013: Theory and Practice of Computer Science, 2013

The T-calculus: towards a structured programing of (musical) time and space.

David Janin, Florent Berthaut, Myriam Desainte-Catherine, Yann Orlarey, Sylvain Salvati

Proceedings of the first ACM SIGPLAN workshop on Functional art, music, modeling & design, 2013

Algebras, Automata and Logic for Languages of Labeled Birooted Trees.

David Janin

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Overlapping Tile Automata.

David Janin

Proceedings of the Computer Science - Theory and Applications, 2013

2012

Advanced Synchronization of Audio or Symbolic Musical Patterns: an Algebraic Approach.

Florent Berthaut, David Janin, Benjamin Martin

Int. J. Semantic Comput., 2012

Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles - (Extended Abstract).

David Janin

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2008

From Asynchronous to Synchronous Specifications for Distributed Program Synthesis.

Julien Bernet, David Janin

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

2007

The monadic theory of finite representations of infinite words.

Anuj Dawar, David Janin

Inf. Process. Lett., 2007

On the (High) Undecidability of Distributed Synthesis Problems.

David Janin

Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

2006

Automata on Directed Graphs: Edge Versus Vertex Marking.

Dietmar Berwanger, David Janin

Proceedings of the Graph Transformations, Third International Conference, 2006

On Distributed Program Specification and Synthesis in Architectures with Cycles.

Julien Bernet, David Janin

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

2005

Tree Automata and Discrete Distributed Games.

Julien Bernet, David Janin

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

A contribution to formal methods : games, logic and automata. (Contribution aux fondements des méthodes formelles : jeux, logique et automates).

David Janin

, 2005

2004

On the Rlationship Between Monadic and Weak Monadic Second Order Logic on Arbitrary Trees, with Applications to the mu-Calculus.

David Janin, Giacomo Lenzi

Fundam. Informaticae, 2004

Workshop on Logic, Graph Transformations, Finite and Infinite Structures.

Bruno Courcelle, David Janin

Proceedings of the Graph Transformations, Second International Conference, 2004

On the Bisimulation Invariant Fragment of Monadic S1 in the Finite.

Anuj Dawar, David Janin

Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

2002

Permissive strategies: from parity games to safety games.

Julien Bernet, David Janin, Igor Walukiewicz

RAIRO Theor. Informatics Appl., 2002

On the Logical Definability of Topologically Closed Recognizable Languages of Infinite Trees.

David Janin, Giacomo Lenzi

Comput. Artif. Intell., 2002

2001

A Toolkit for First Order Extensions of Monadic Games.

David Janin, Jerzy Marcinkowski

Proceedings of the STACS 2001, 2001

Relating Levels of the Mu-Calculus Hierarchy and Levels of the Monadic Hierarchy.

David Janin, Giacomo Lenzi

Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

1999

On the Structure of the Monadic Logic of the Binary Tree.

David Janin, Giacomo Lenzi

Proceedings of the Mathematical Foundations of Computer Science 1999, 1999

1997

Automata, Tableaus and a Reduction Theorem for Fixpoint Calculi in Arbitrary Complete Lattices.

David Janin

Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1996

On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic.

David Janin, Igor Walukiewicz

Proceedings of the CONCUR '96, 1996

1995

Automata for the Modal mu-Calculus and related Results.

David Janin, Igor Walukiewicz

Proceedings of the Mathematical Foundations of Computer Science 1995, 1995

1993

Some Results About Logical Descriptions of Non-Deterministic Behaviours.

David Janin

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993