Daniel Stan

Orcid: 0000-0002-4723-5742

Affiliations:
  • Saarland University, SIC, Saarbrücken, Germany
  • ENS Cachan/Paris-Saclay, France


According to our database1, Daniel Stan authored at least 11 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
SAT-based Learning of Computation Tree Logic.
CoRR, 2024

Concurrent Stochastic Lossy Channel Games.
Proceedings of the 32nd EACSL Annual Conference on Computer Science Logic, 2024

2021
Learning Union of Integer Hypercubes with Queries (Technical Report).
CoRR, 2021

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems (technical report).
CoRR, 2021

Learning Union of Integer Hypercubes with Queries - (with Applications to Monadic Decomposition).
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

Regular Model Checking Approach to Knowledge Reasoning over Parameterized Systems.
Proceedings of the AAMAS '21: 20th International Conference on Autonomous Agents and Multiagent Systems, 2021

2019
Syntactic Partial Order Compression for Probabilistic Reachability.
Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2019

2017
Randomized strategies in concurrent games. (Stratégies randomisées dans les jeux concurrents).
PhD thesis, 2017

2016
Stochastic Equilibria under Imprecise Deviations in Terminal-Reward Concurrent Games.
Proceedings of the Seventh International Symposium on Games, 2016

Reachability in Networks of Register Protocols under Stochastic Schedulers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
Mixed Nash Equilibria in Concurrent Terminal-Reward Games.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014


  Loading...