Filtrer vos résultats
- 64
- 25
- 53
- 21
- 5
- 4
- 4
- 2
- 1
- 89
- 1
- 4
- 2
- 2
- 2
- 2
- 4
- 7
- 10
- 1
- 5
- 5
- 3
- 6
- 5
- 7
- 7
- 5
- 8
- 1
- 2
- 89
- 89
- 10
- 9
- 5
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 89
- 19
- 14
- 9
- 5
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 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
89 résultats
|
|
Typing Weak MSOL PropertiesFOSSACS, 2015, London, United Kingdom. pp.343 - 357, ⟨10.1007/978-3-662-46678-0_22⟩
Communication dans un congrès
hal-01394824v1
|
||
|
|
A Note on Monitors and Büchi automataICTAC, Jul 2015, Cali, Colombia. pp.39-57
Communication dans un congrès
hal-01394826v1
|
||
|
|
Positional determinacy of games with infinitely many prioritiesLogical Methods in Computer Science, 2006, pp.1-22. ⟨10.2168/LMCS-2(4:6)2006⟩
Article dans une revue
hal-00335726v1
|
||
|
|
Idealized Algol with ground recursion, and PDA equivalenceICALP'05, 2005, Portugal. pp.917-926
Communication dans un congrès
hal-00335728v1
|
||
|
|
Model-Checking Parametric Lock-Sharing Systems Against Regular ConstraintsCONCUR, 2023, Antwerp, Belgium. pp.24:1--24:17, ⟨10.4230/LIPIcs.CONCUR.2023.24⟩
Communication dans un congrès
hal-04242348v1
|
||
|
|
Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods37th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2022, Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03644039v2
|
||
An NP-Complete Fragment of LTLInternational Journal of Foundations of Computer Science, 2005, 16 (4), pp.743--754
Article dans une revue
hal-00306332v1
|
|||
|
|
Active Learning Sound Negotiations37th Annual ACM/IEEE Symposium on Logic in Computer Science ( LICS 2022 ), Aug 2022, Haifa, Israel
Communication dans un congrès
hal-03808843v1
|
||
|
|
Wreath Products of Forest Algebras, with Applications to Tree LogicsLICS'09, 2009, United States. pp.1--10
Communication dans un congrès
hal-00404783v1
|
||
Synthesis: words and tracesAutoMathA 2009 Conference of the AutoMathA programme, 2009, Belgium
Communication dans un congrès
hal-00404816v1
|
|||
Synthesis via gamesKNAW Academy Colloquium: New perspectives on Games and Interaction, 2007, Netherlands
Communication dans un congrès
hal-00404808v1
|
|||
|
|
Static Analysis of Deterministic Negotiations2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2017, Reykjavik, Iceland. pp.1-12, ⟨10.1109/LICS.2017.8005144⟩
Communication dans un congrès
hal-02397738v1
|
||
20th International Symposium on Fundamentals of Computation Theory (FCT 2015), Proceedings, Gdansk, Poland, August 17-19, 2015Springer, 9210, 2015, Lecture Notes in Computer Science, ⟨10.1007/978-3-319-22177-9⟩
Ouvrages
hal-01251854v1
|
|||
|
|
A model for behavioural properties of higher-order programs24th EACSL Annual Conference on Computer Science Logic, CSL 2015, Sep 2015, Berlin, Germany. ⟨10.4230/LIPIcs.CSL.2015.229⟩
Communication dans un congrès
hal-01145494v1
|
||
|
|
Nondeterministic controllers of nondeterministic processesLogic and Automata, Amsterdam University Press, pp.29-52, 2007, Texts in Logic and Games
Chapitre d'ouvrage
hal-00315872v1
|
||
|
|
Simply typed fixpoint calculus and collapsible pushdown automataMathematical Structures in Computer Science, 2016, 26, pp.1304 - 1350. ⟨10.1017/S0960129514000590⟩
Article dans une revue
hal-01394828v1
|
||
|
|
The Diagonal Problem for Higher-Order Recursion Schemes is DecidableLICS, Jun 2016, New York, United States. pp.96 - 105, ⟨10.1145/2933575.2934527⟩
Communication dans un congrès
hal-01394830v1
|
||
|
|
Wreath Products of Forest Algebras, with Applications to Tree LogicsLogical Methods in Computer Science, 2012, 8 (3), pp.1-39. ⟨10.2168/LMCS-8(3:19)2012⟩
Article dans une revue
hal-00962245v1
|
||
|
|
Deciding Nondeterministic Hierarchy of Deterministic Tree AutomataElectronic Notes in Theoretical Computer Science, 2005, 123, pp.195-208
Article dans une revue
hal-00353557v1
|
||
|
|
Weak Alternating Timed AutomataICALP'09, 2009, Greece. pp.273--284
Communication dans un congrès
hal-00360122v2
|
||
|
|
A model for divergence insensitive properties of lambdaY-terms2015
Pré-publication, Document de travail
hal-01169352v1
|
||
On importance of logic in informaticsColloquium of Polish Mathematical Society, 2005, Poland
Communication dans un congrès
hal-00404791v1
|
|||
Preface : Fixed Points in Computer Science (FICS) 2013Fundamenta Informaticae, 2017, 150 (3-4), pp.i-ii. ⟨10.3233/FI-2017-1468⟩
Article dans une revue
hal-03116273v1
|
|||
|
|
Better abstractions for timed automataLICS - 27th Annual ACM/IEEE Symposium on Logic in Computer Science - 2012, Jun 2012, Dubrovnick, Croatia. pp.375-384
Communication dans un congrès
hal-00708714v1
|
||
|
|
Optimal Zielonka-Type Construction of Deterministic Asynchronous AutomataICALP, 2010, France. pp.52-63
Communication dans un congrès
hal-00536788v1
|
||
|
|
Synthesis: Words and TracesATVA, 2010, Singapore. pp.18-21
Communication dans un congrès
hal-00536789v1
|
||
|
|
Characterizing EF and EX tree logicsTheoretical Computer Science, 2006, 358 (2-3), pp.255-272
Article dans une revue
hal-00335736v1
|
||
|
|
Asynchronous Games over Tree ArchitecturesICALP - 40th International Colloquium on Automata, Languages, and Programming- 2013, Jul 2013, RIGA, Latvia. pp.275-286, ⟨10.1007/978-3-642-39212-2_26⟩
Communication dans un congrès
hal-00916615v1
|
||
|
|
Revisiting local time semantics for networks of timed automataThe 30th International Conference on Concurrency Theory (CONCUR) 2019, Aug 2019, Amsterdam, Netherlands
Communication dans un congrès
hal-02173142v1
|
||
Towards understanding tree languages: fixpoint hierarchiesAIML (Advances in Modal Logic), 2006, Australia
Communication dans un congrès
hal-00404804v1
|