Filtrer vos résultats
- 39
- 23
- 33
- 23
- 2
- 2
- 1
- 1
- 2
- 62
- 2
- 1
- 5
- 3
- 5
- 4
- 4
- 7
- 3
- 2
- 2
- 3
- 3
- 6
- 3
- 2
- 2
- 5
- 2
- 62
- 51
- 12
- 11
- 10
- 7
- 3
- 3
- 3
- 1
- 62
- 15
- 12
- 8
- 7
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 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
62 résultats
Complete reducibility of systems of equations with respect to RPortugaliae Mathematica, 2007, 64, pp.445--508
Article dans une revue
hal-00306426v1
|
|||
|
|
Pebble Weighted Automata and Weighted LogicsACM Transactions on Computational Logic, 2014, 15 (2), pp.15. ⟨10.1145/2579819⟩
Article dans une revue
hal-00964994v2
|
||
|
|
Some structural properties of the free profinite aperiodic semigroupAutomatha Plenary Conference, Jun 2009, Belgium
Communication dans un congrès
hal-00948998v1
|
||
The Covering Problem: A Unified Approach for Investigating the Expressive Power of Logics41st International Symposium on Mathematical Foundations of Computer Science, 2016, 2016 - Kraków, Poland. pp.77:1--77:15, ⟨10.4230/LIPIcs.MFCS.2016.77⟩
Communication dans un congrès
hal-02477399v1
|
|||
|
|
Separating Regular Languages with First-Order LogicLogical Methods in Computer Science, 2016, 12 (1), ⟨10.2168/LMCS-12(1:5)2016⟩
Article dans une revue
hal-02488374v1
|
||
|
|
Fundamentals of Computation Theory - 21st International Symposium, FCT 2017, Bordeaux, France, September 11-13, 2017, ProceedingsSpringer, 10472, 2017, Lecture Notes in Computer Science, ⟨10.1007/978-3-662-55751-8⟩
Ouvrages
hal-01871368v1
|
||
AltaRica refinement for heterogeneous granularity models analysisLambda-Mu 16, Oct 2008, Avignon, France. pp.2B-3
Communication dans un congrès
hal-00353285v1
|
|||
|
|
Minimization of counterexamples in SPINModel Checking Software: Proc. of the 11th International SPIN Workshop, SPIN04, 2004, Barcelone, Spain. pp.92-108, ⟨10.1007/b96721⟩
Communication dans un congrès
hal-00306314v1
|
||
Concatenation Hierarchies: New Bottle, Old WineComputer Science - Theory and Applications - 12th International Computer Science Symposium in Russia (CSR '17), 2017, Kazan, Russia. pp.25--37, ⟨10.1007/978-3-319-58747-9_5⟩
Communication dans un congrès
hal-02477395v1
|
|||
|
|
Separating Regular Languages by Locally Testable and Locally Threshold Testable LanguagesFSTTCS 2013, Dec 2013, Guwahati, India. pp.363-375, ⟨10.4230/LIPIcs.FSTTCS.2013.363⟩
Communication dans un congrès
hal-00948961v1
|
||
|
|
Accelerating Interpolation-Based Model-Checking14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'08), 2008, Budapest, Hungary. pp.428-442, ⟨10.1007/978-3-540-78800-3_32⟩
Communication dans un congrès
hal-00350416v1
|
||
|
|
Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model CheckingMFCS 2011, Aug 2011, Warsaw, Poland. pp.132-144, ⟨10.1007/978-3-642-22993-0_15⟩
Communication dans un congrès
hal-00591139v2
|
||
Separation for dot-depth two32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS '17), 2017, Reykjavik, Iceland. pp.1--12, ⟨10.1109/LICS.2017.8005070⟩
Communication dans un congrès
hal-02477397v1
|
|||
Scenarios and covert channels, another game...GDV 04, 2005, Boston, United States. pp.93--116
Communication dans un congrès
hal-00306319v1
|
|||
Covert channels detection in protocols using scenariosSecurity Protocols Verification, SPV'03, 2003, Unknown, France. pp.2125
Communication dans un congrès
hal-00306320v1
|
|||
Infinite-state high-level MSCs: Model-checking and realizabilityJournal of Computer and System Sciences, 2006, 72 (4), pp.617--647
Article dans une revue
hal-00306255v1
|
|||
|
|
A Probabilistic Kleene TheoremAutomated Technology for Verification and Analysis (ATVA'12), Oct 2012, Thiruvananthapuram, India. pp.400-415, ⟨10.1007/978-3-642-33386-6_31⟩
Communication dans un congrès
hal-00909042v1
|
||
|
|
The linear nature of pseudowordsPublicacions Matemàtiques, 2019, 63, pp.361-422. ⟨10.5565/PUBLMAT6321901⟩
Article dans une revue
hal-02488361v1
|
||
|
|
McCammond’s normal forms for free aperiodic semigroups revisitedLMS Journal of Computation and Mathematics, 2015, 18 (1), pp.130-147. ⟨10.1112/S1461157014000448⟩
Article dans une revue
hal-02488381v1
|
||
|
|
Distributed synthesis for well-connected architecturesFSTTCS06, 2006, Kolkata, India. pp.321-332, ⟨10.1007/11944836_30⟩
Communication dans un congrès
hal-00306316v1
|
||
The Complexity of Separation for Levels in Concatenation Hierarchies38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2018), 2018, Ahmedabad, India. pp.47:1--47:17, ⟨10.4230/LIPIcs.FSTTCS.2018.47⟩
Communication dans un congrès
hal-02477393v1
|
|||
A look at the control of asynchronous automataK. Lodaya, M. Mukund, R. Ramanujam. Perspectives in Concurrency Theory, Universities Press India, pp.356--371, 2009
Chapitre d'ouvrage
hal-00355528v1
|
|||
Omega-terms over finite aperiodic semigroupsROGICS'08, 2008, Madhia, Tunisia. pp.364-371
Communication dans un congrès
hal-00306423v1
|
|||
|
|
Closures of Regular Languages for Profinite TopologiesSemigroup Forum, 2014, pp.1-21. ⟨10.1007/s00233-014-9574-3⟩
Article dans une revue
hal-01005346v1
|
||
|
|
Separating Regular Languages by Piecewise Testable and Unambiguous LanguagesMathematical Foundations of Computer Science, Aug 2013, Austria. pp.729-740, ⟨10.1007/978-3-642-40313-2_64⟩
Communication dans un congrès
hal-00948943v1
|
||
|
|
Distributed games with causal memory are decidable for series-parallel systemsProc. of the 24th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS04, 2004, Chennai, India. pp.275-286, ⟨10.1007/b104325⟩
Communication dans un congrès
hal-00306315v1
|
||
|
|
Reducibility of pointlike problemsSemigroup Forum, 2017, 94 (2), pp.325-335. ⟨10.1007/s00233-015-9769-2⟩
Article dans une revue
hal-02488372v1
|
||
|
|
Separation and covering for group based concatenation hierarchies34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019, BC, Canada. pp.1--13, ⟨10.1109/LICS.2019.8785655⟩
Communication dans un congrès
hal-02477390v1
|
||
|
|
Quantifier Alternation for Infinite Words9th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'16), Apr 2016, Eindhoven, Netherlands. pp.234-251, ⟨10.1007/978-3-662-49630-5_14⟩
Communication dans un congrès
hal-02488310v1
|
||
|
|
Distributed synthesis for well-connected architecturesFormal Methods in System Design, 2009, 34 (3), pp.215-237. ⟨10.1007/s10703-008-0064-7⟩
Article dans une revue
hal-00408878v1
|