Amina Doumane

Affiliations:
  • Paris Diderot University, France (PhD 2017)


According to our database1, Amina Doumane authored at least 21 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Tree algebras and bisimulation-invariant MSO on finite graphs.
CoRR, 2024

A Finite Presentation of Graphs of Treewidth at Most Three.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

2022
Bouncing Threads for Circular and Non-Wellfounded Proofs: Towards Compositionality with Circular Proofs.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

Regular Expressions for Tree-Width 2 Graphs.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Graph Characterization of the Universal Theory of Relations.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Non-Axiomatizability of the Equational Theories of Positive Relation Algebras (Invited Talk).
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Class of Representable Semilattice-Ordered Monoids Is Not a Variety.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2021

2020
Bouncing threads for infinitary and circular proofs.
CoRR, 2020

First-order tree-to-tree functions.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Non Axiomatisability of Positive Relation Algebras with Constants, via Graph Homomorphisms.
Proceedings of the 31st International Conference on Concurrency Theory, 2020

2019
Kleene Algebra with Hypotheses.
Proceedings of the Foundations of Software Science and Computation Structures, 2019

2018
Left-Handed Completeness for Kleene algebra, via Cyclic Proofs.
Proceedings of the LPAR-22. 22nd International Conference on Logic for Programming, 2018

Completeness for Identity-free Kleene Lattices.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
On the infinitary proof theory of logics with fixed points. (Théorie de la démonstration infinitaire pour les logiques à points fixes).
PhD thesis, 2017

Constructive completeness for the linear-time μ-calculus.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

2016
Towards Completeness via Proof Search in the Linear Time μ-calculus: The case of Büchi inclusions.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016

Infinitary Proof Theory: the Multiplicative Additive Case.
Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2015
On the Dependencies of Logical Rules.
Proceedings of the Foundations of Software Science and Computation Structures, 2015

Least and Greatest Fixed Points in Ludics.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Nécessité faite loi : de la réduction linéaire de tête à l'évaluation paresseuse.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014

Analyse de dépendances et correction des réseaux de preuve.
Proceedings of the 25. Journées francophones des langages applicatifs, 2014


  Loading...