Filtrer vos résultats
- 37
- 31
- 6
- 37
- 2
- 2
- 2
- 3
- 2
- 5
- 3
- 4
- 5
- 3
- 4
- 2
- 1
- 1
- 36
- 1
- 19
- 8
- 4
- 4
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 37
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 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
37 résultats
|
|
triés par
|
|
On Finite Domains in First-Order Linear Temporal Logic14th International Symposium on Automated Technology for Verification and Analysis, Oct 2016, Chiba, Japan. ⟨10.1007/978-3-319-46520-3_14⟩
Communication dans un congrès
hal-01343197v1
|
||
|
Computing the Width of Non-deterministic AutomataLogical Methods in Computer Science, 2019, 15, ⟨10.23638/LMCS-15(4:10)2019⟩
Article dans une revue
hal-02383115v1
|
||
|
Sensing as a Complexity Measure19th International Conference on Descriptional Complexity of Formal Systems (DCFS), Jul 2017, Milano, Italy. pp.3-15, ⟨10.1007/978-3-319-60252-3_1⟩
Communication dans un congrès
hal-01657019v1
|
||
|
Coinductive Algorithms for Büchi AutomataFundamenta Informaticae, 2021, 180 (4), pp.351-373. ⟨10.3233/FI-2021-2046⟩
Article dans une revue
hal-03364935v1
|
||
|
Linear Temporal Logic for Regular Cost FunctionsLogical Methods in Computer Science, 2014, ⟨10.2168/LMCS-10(1:4)2014⟩
Article dans une revue
hal-02071071v1
|
||
|
Linear temporal logic for regular cost functionsSymposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.627-636
Communication dans un congrès
hal-00573635v1
|
||
|
Cyclic proofs, system T, and the power of contractionProceedings of the ACM on Programming Languages, 2021, ⟨10.1145/3434282⟩
Article dans une revue
hal-02487175v2
|
||
|
Eventually Safe LanguagesDevelopments in Language Theory, Aug 2019, Varsovie, Poland. pp.192-205, ⟨10.1007/978-3-030-24886-4_14⟩
Communication dans un congrès
hal-02348828v1
|
||
|
The Sensing Cost of Monitoring and SynthesisFSTTCS, 2015, Bangalore, India
Communication dans un congrès
hal-02070826v1
|
||
|
Trading Bounds for Memory in Games with Counters42nd International Colloquium on Automata, Languages, and Programming (ICALP 2015), 2015, Kyoto, Japan. ⟨10.1007/978-3-662-47666-6_16⟩
Communication dans un congrès
hal-02071065v1
|
||
|
Two-Way Cost Automata and Cost Logics over Infinite TreesJOINT MEETING OF the Twenty-Third EACSL Annual Conference on COMPUTER SCIENCE LOGIC (CSL) AND the Twenty-Ninth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS), 2014, Vienne, Austria. ⟨10.1145/2603088.2603104⟩
Communication dans un congrès
hal-02070744v1
|
||
|
Stamina: Stabilisation Monoids IN Automata theoryCIAA, 2017, Marne-la-Vallée, France
Communication dans un congrès
hal-02071075v1
|
||
|
Soundness in negotiationsLogical Methods in Computer Science, 2018, ⟨10.4230/LIPIcs⟩
Article dans une revue
hal-01891179v1
|
||
|
Positive First-order Logic on Words2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Jun 2021, Rome, France. pp.1-13, ⟨10.1109/LICS52264.2021.9470602⟩
Communication dans un congrès
hal-03375096v1
|
||
|
Regular resynchronizability of origin transducers is undecidableMFCS, Aug 2020, Prague, Czech Republic. ⟨10.4230/LIPIcs.MFCS.2020.51⟩
Communication dans un congrès
hal-03046161v1
|
||
|
Nondeterminism in the Presence of a Diverse or Unknown FutureICALP, Jul 2013, Riga, Latvia
Communication dans un congrès
hal-03046265v1
|
||
|
Stamina: Stabilisation Monoids IN Automata theoryCIAA - International Conference on Implementation and Application of Automata, 2017, Marne-la-Vallée, France
Communication dans un congrès
hal-01891164v1
|
||
|
Soundness in negotiations * 27th International Conference on Concurrency Theory (CONCUR 2016), Aug 2016, Québec, Canada. pp.12:1--12:13, ⟨10.4230/LIPIcs.CONCUR.2016.12⟩
Communication dans un congrès
hal-01394831v1
|
||
|
Kleene Algebra with Hypotheses22nd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), 2019, Prague, Czech Republic
Communication dans un congrès
hal-02021315v1
|
||
|
Positive First-Order Logic on Words and GraphsLogical Methods in Computer Science, 2023, 19 (3), pp.7:1 - 7:35. ⟨10.46298/LMCS-19(3:7)2023⟩
Article dans une revue
hal-03865495v2
|
||
|
On the Succinctness of Alternating Parity Good-for-Games AutomataFSTTCS 2020, Dec 2020, Goa, India. pp.41:1--41:13
Communication dans un congrès
hal-03046213v1
|
||
|
Bouncing threads for circular and non-wellfounded proofs -- Towards compositionality with circular proofs (Extended version)LICS '22: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Aug 2022, Haifa, Israel. ⟨10.1145/3531130.3533375⟩
Communication dans un congrès
hal-03682126v1
|
||
|
Lightweight Specification and Analysis of Dynamic Systems with Rich ConfigurationsFoundations of Software Engineering, Nov 2016, Seattle, United States. ⟨10.1145/2950290.2950318⟩
Communication dans un congrès
hal-01355062v1
|
||
|
Spécification légère et analyse de systèmes dynamiques munis de configurations richesApproches Formelles dans l'Assistance au Développement de Logiciels, Jun 2017, Montpellier, France
Communication dans un congrès
hal-02077323v1
|
||
|
On Determinisation of Good-for-Games AutomataICALP, 2015, Kyoto, Japan. pp.299-310, ⟨10.1007/978-3-662-47666-6_24⟩
Communication dans un congrès
hal-02101504v1
|
||
|
Regular Sensing34th International Conference on Foundation of Software Technology and Theoretical Computer Science( FSTTCS 2014), 2014, New Delhi, India
Communication dans un congrès
hal-02070752v1
|
||
|
Deciding the weak definability of Büchi definable tree languagesCSL, Sep 2013, Torino, Italy. ⟨10.4230/LIPIcs.xxx.yyy.p⟩
Communication dans un congrès
hal-03046200v1
|
||
|
Cost Functions Definable by Min/Max Automata33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016), 2016, Orléans, France. pp.1 - 36, ⟨10.4230/LIPIcs.STACS.2016.29⟩
Communication dans un congrès
hal-02070812v1
|
||
|
Cyclic Proofs and Jumping AutomataFSTTCS, Dec 2019, Bombay, India. ⟨10.4230/LIPIcs.FSTTCS.2019.45⟩
Communication dans un congrès
hal-02301651v2
|
||
|
Coinductive algorithms for Büchi automataDevelopments in Language Theory, Aug 2019, Varsovie, Poland
Communication dans un congrès
hal-01928701v1
|
- 1
- 2