Filter your results
- 59
- 15
- 48
- 17
- 3
- 2
- 2
- 1
- 1
- 73
- 1
- 1
- 14
- 8
- 4
- 12
- 12
- 10
- 8
- 3
- 1
- 1
- 73
- 1
- 65
- 15
- 5
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 22
- 21
- 11
- 11
- 8
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
74 Results
|
When a Little Nondeterminism Goes a Long Way: An Introduction to History-Determinism2023, pp.24-51. ⟨10.1145/3584676.3584682⟩
Other publications
hal-03994548v1
|
||
A Reinforcement Learning Integrating Distributed Caches for Contextual Road NavigationInternational Journal of Ambient Computing and Intelligence, 2022, 13 (1), pp.1-19. ⟨10.4018/IJACI.300792⟩
Journal articles
hal-03938697v1
|
|||
|
Formal methods applied to access control policy design, verification and enforcementCryptography and Security [cs.CR]. Aix-Marseile Université, France, 2022
Habilitation à diriger des recherches
tel-03921970v1
|
||
|
History-deterministic Parikh Automata2022
Preprints, Working Papers, ...
hal-03858319v1
|
||
|
History-Deterministic Timed Automata Are Not Determinizable16th International Conference on Reachability Problems 2022, Oct 2022, KAISERSLAUTERN, Germany. pp.67-76, ⟨10.1007/978-3-031-19135-0_5⟩
Conference papers
hal-03849398v1
|
||
|
Parikh Automata over Infinite WordsFSTTCS, 2022, Madras, India
Conference papers
hal-03857989v1
|
||
|
Token Games and History-Deterministic Quantitative AutomataFoSSaCS, 2022, Munich, Germany. pp.120-139, ⟨10.1007/978-3-030-99253-8_7⟩
Conference papers
hal-03857930v1
|
||
|
History-Deterministic Timed AutomataCONCUR, 2022, Warsaw, Poland. ⟨10.4230/LIPIcs.CONCUR.2022.14⟩
Conference papers
hal-03849404v1
|
||
|
A Synthesis Tool for Optimal Monitors in a Branching-Time Setting17th International Federated Conference on Distributed Computing Techniques, DisCoTec 2022,, Jun 2022, Lucca, Italy. pp.181 - 199, ⟨10.1007/978-3-031-08143-9_11⟩
Conference papers
hal-03849385v1
|
||
|
On the Translation of Automata to Linear Temporal LogicFOSSACS, Apr 2022, Munich, Germany. pp.140-160, ⟨10.1007/978-3-030-99253-8_8⟩
Conference papers
hal-03849354v1
|
||
|
One-Clock Priced Timed Games with Arbitrary WeightsLogical Methods in Computer Science, 2022, 18 (3), pp.51
Journal articles
hal-02424743v2
|
||
|
Game Theory for Real-Time Synthesis: Decision, Approximation, and RandomnessComputer Science and Game Theory [cs.GT]. Aix-Marseille Université, 2022
Habilitation à diriger des recherches
tel-03663275v1
|
||
|
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), Aug 2021, Tallinn, Estonia. ⟨10.4230/LIPIcs.MFCS.2021.53⟩
Conference papers
hal-03320016v1
|
||
|
A Recursive Approach to Solving Parity Games in Quasipolynomial TimeLogical Methods in Computer Science, 2022, Volume 18 (1), pp.8:1-8:18
Journal articles
hal-03320012v1
|
||
|
The Best a Monitor Can Do29th EACSL Annual Conference on Computer Science Logic (CSL 2021), Jan 2021, Ljubljana, Slovenia
Conference papers
hal-03320006v1
|
||
|
Good-for-games $\omega$-Pushdown AutomataLogical Methods in Computer Science, 2022, Volume 18, Issue 1, ⟨10.46298/lmcs-18(1:3)2022⟩
Journal articles
hal-03522789v1
|
||
Admin-CBACCODASPY '20: Tenth ACM Conference on Data and Application Security and Privacy, Mar 2020, New Orleans LA USA, France. pp.73-84, ⟨10.1145/3374664.3375725⟩
Conference papers
hal-03592292v1
|
|||
Graph-Based Specification of Admin-CBAC PoliciesCODASPY '21: Eleventh ACM Conference on Data and Application Security and Privacy, Apr 2021, Virtual Event USA, France. pp.173-184, ⟨10.1145/3422337.3447850⟩
Conference papers
hal-03592278v1
|
|||
|
Copyful Streaming String TransducersFundamenta Informaticae, 2021, 178 (1-2), pp.59-76. ⟨10.3233/FI-2021-1998⟩
Journal articles
hal-03559507v1
|
||
|
From Two-Way Transducers to Regular Function ExpressionsInternational Journal of Foundations of Computer Science, 2020, 31 (06), pp.843-873. ⟨10.1142/S0129054120410087⟩
Journal articles
hal-03559506v1
|
||
|
Weighted Automata and Expressions over Pre-Rational Monoids30th EACSL Annual Conference on Computer Science Logic (CSL 2022), Feb 2022, Göttingen, France. ⟨10.4230/LIPIcs.CSL.2022.6⟩
Conference papers
hal-03545602v1
|
||
38th International Symposium on Theoretical Aspects of Computer Science (STACS 2021)2021
Books
hal-03518289v1
|
|||
|
Better Late Than Never or: Verifying Asynchronous Components at Runtime41st International Conference on Formal Techniques for Distributed Objects, Components, and Systems, Jun 2021, Valletta, Malta. pp.207 - 225, ⟨10.1007/978-3-030-78089-0_14⟩
Conference papers
hal-03320023v1
|
||
|
History Determinism vs. Good for Gameness in Quantitative Automata41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021), Dec 2021, Online, India. ⟨10.4230/LIPIcs.FSTTCS.2021.38⟩
Conference papers
hal-03455733v1
|
||
|
Playing Stochastically in Weighted Timed Games to Emulate Memory48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow (virtual), United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.137⟩
Conference papers
hal-03282049v1
|
||
|
Reaching Your Goal Optimally by Playing at Random with No Memory31st International Conference on Concurrency Theory (CONCUR 2020), 2020, Vienna, Austria. ⟨10.4230/LIPIcs.CONCUR.2020.26⟩
Conference papers
hal-02925540v1
|
||
|
Epsilon-reducible context-free languages and characterizations of indexed languagesInformation and Computation, 2019, 269, pp.104444. ⟨10.1016/j.ic.2019.104444⟩
Journal articles
hal-02413392v1
|
||
|
On the computation of the minimal coverability set of Petri nets13th International Conference on Reachability Problems, Sep 2019, Bruxelles, Belgium. ⟨10.1007/978-3-030-30806-3_13⟩
Conference papers
hal-02442611v1
|
||
|
Langages epsilon-sûrs et caractérisations des langages d'ordres supérieursInformatique et langage [cs.CL]. Aix-Marseille Université, 2017. Français. ⟨NNT : ⟩
Theses
tel-02453297v1
|
||
Using Provenance for Secure Data Fusion in Cooperative Systemsthe 24th ACM Symposium SACMAT, Jun 2019, Toronto ON, France. pp.185-194, ⟨10.1145/3322431.3325100⟩
Conference papers
hal-02440487v1
|