Corto Mascle

According to our database1, Corto Mascle authored at least 16 papers between 2019 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata.
CoRR, 2024

The Complexity of Simplifying ω-Automata Through the Alternating Cycle Decomposition.
Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

Verification of Population Protocols with Unordered Data.
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024

Parameterized Broadcast Networks with Registers: from NP to the Frontiers of Decidability.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

2023
Learning temporal formulas from examples is hard.
CoRR, 2023

Model-Checking Parametric Lock-Sharing Systems Against Regular Constraints.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

2022
Model-checking lock-sharing systems against regular constraints.
CoRR, 2022

Distributed Controller Synthesis for Deadlock Avoidance.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
On Nonnegative Integer Matrices and Short Killing Words.
SIAM J. Discret. Math., 2021

From LTL to rLTL monitoring: improved monitorability through robust semantics.
Formal Methods Syst. Des., 2021

Les claviers, un modèle de calcul.
CoRR, 2021

Keyboards as a New Model of Computation.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Responsibility and verification: Importance value in temporal logics.
Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, 2021

2020
The Keys to Decidable HyperLTL Satisfiability: Small Models or Very Simple Formulas.
Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019
Controlling a Random Population is EXPTIME-hard.
CoRR, 2019

On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words.
Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019


  Loading...