Filtrer vos résultats
- 25
- 16
- 24
- 13
- 2
- 1
- 1
- 1
- 38
- 2
- 1
- 1
- 1
- 2
- 3
- 1
- 2
- 4
- 3
- 2
- 1
- 1
- 4
- 1
- 4
- 3
- 5
- 1
- 2
- 41
- 35
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 41
- 10
- 8
- 8
- 5
- 4
- 4
- 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
41 résultats
|
|
|
triés par
|
|
|
Flat Acceleration in Symbolic Model CheckingThird International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.474-488, ⟨10.1007/11562948_35⟩
Communication dans un congrès
hal-00346302v1
|
||
|
|
On Termination for Faulty Channel MachinesSTACS 2008, Feb 2008, Bordeaux, France. pp.121-132
Communication dans un congrès
hal-00220515v1
|
||
|
|
Temporal Logic with Forgettable PastProceedings of the 17th Annual IEEE Symposium on Logic in Computer Science (LICS'02), 2002, Copenhagen, Denmark. pp.383-392, ⟨10.1109/LICS.2002.1029846⟩
Communication dans un congrès
hal-01194631v1
|
||
|
|
A Parametric Analysis of the State-Explosion Problem in Model CheckingJournal of Computer and System Sciences, 2006, 72 (4), pp.547--575. ⟨10.1016/j.jcss.2005.11.003⟩
Article dans une revue
hal-03189811v1
|
||
|
|
On the state complexity of closures and interiors of regular languages with subwords and superwordsTheoretical Computer Science, 2016, 610, pp.91-107. ⟨10.1016/j.tcs.2015.09.028⟩
Article dans une revue
hal-03441921v1
|
||
The height of piecewise-testable languages and the complexity of the logic of subwordsLogical Methods in Computer Science, 2019
Article dans une revue
hal-02408723v1
|
|||
On the Expressivity and Complexity of Quantitative Branching-Time Temporal Logics.LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, Apr 2000, Punta del Este, Uruguay, pp.437-446
Communication dans un congrès
inria-00104142v1
|
|||
|
|
Efficient Timed Model Checking for Discrete-Time SystemsTheoretical Computer Science, 2006, 353 (1-3), pp.249-271. ⟨10.1016/j.tcs.2005.11.020⟩
Article dans une revue
hal-01194608v1
|
||
|
|
The Power of Priority Channel SystemsLogical Methods in Computer Science, 2014, 10 (4:4), pp.1--39. ⟨10.2168/LMCS-10(4:4)2014⟩
Article dans une revue
hal-01091086v1
|
||
|
|
A PTIME-Complete Matching Problem for SLP-Compressed WordsInformation Processing Letters, 2004, 90 (1), pp.3-6. ⟨10.1016/j.ipl.2004.01.002⟩
Article dans une revue
hal-01194622v1
|
||
|
|
Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma26th Annual IEEE Symposium on Logic in Computer Science, Jun 2011, Toronto, Canada. p. 269--278, ⟨10.1109/LICS.2011.39⟩
Communication dans un congrès
hal-00609871v1
|
||
|
|
On Arch Factorization and Subword Universality for Words and Compressed Words14th International Conference Combinatorics on Words (WORDS 2023), Jun 2023, Umea, Sweden. pp.274-287, ⟨10.1007/978-3-031-33180-0_21⟩
Communication dans un congrès
hal-04287016v1
|
||
|
|
Algorithmic Aspects of WQO TheoryMaster. France. 2012
Cours
cel-00727025v2
|
||
|
|
On flat lossy channel machines29th EACSL Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.37⟩
Communication dans un congrès
hal-03441933v1
|
||
|
|
On Functions Weakly Computable by Petri Nets and Vector Addition SystemsReachability Problems - 8th International Workshop, {RP} 2014, Sep 2014, Oxford, United Kingdom. pp.190 - 202, ⟨10.1007/978-3-319-11439-2_15⟩
Communication dans un congrès
hal-01084971v1
|
||
|
|
Symbolic Model Checking for Simply-Timed SystemsProceedings of the Joint Conferences Formal Modelling and Analysis of Timed Systems (FORMATS'04) and Formal Techniques in Real-Time and Fault-Tolerant Systems (FTRTFT'04), 2004, Grenoble, France. pp.102-117
Communication dans un congrès
hal-01194620v1
|
||
|
|
On Model Checking Durational Kripke Structures (Extended Abstract)Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), 2002, Grenoble, France. pp.264-279
Communication dans un congrès
hal-01194632v1
|
||
|
|
Model Checking Timed Automata with One or Two ClocksProceedings of the 15th International Conference on Concurrency Theory (CONCUR'04), 2004, London, UK, Unknown Region. pp.387-401, ⟨10.1007/978-3-540-28644-8_25⟩
Communication dans un congrès
hal-01194617v1
|
||
|
|
The complexity of propositional linear temporal logics in simple casesAnnual Symposium on Theoretical Aspects of Computer Science (STACS 1998), Jan 1998, Paris, France. pp.61-72, ⟨10.1007/BFb0028549⟩
Communication dans un congrès
hal-03199998v1
|
||
|
|
TSMV: A Symbolic Model Checker for Quantitative Analysis of SystemsProceedings of the 1st International Conference on Quantitative Evaluation of Systems (QEST'04), 2004, Enschede, Netherlands. pp.330-331, ⟨10.1109/QEST.2004.10028⟩
Communication dans un congrès
hal-01194623v1
|
||
|
|
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR'06), Nov 2006, Phnom Penh, Cambodia. ⟨10.1007/11916277_24⟩
Communication dans un congrès
inria-00424346v1
|
||
|
|
Verifying nondeterministic probabilistic channel systems against omega-regular linear-time properties.ACM Transactions on Computational Logic, 2007, 9 (1), ⟨10.1145/1297658.1297663⟩
Article dans une revue
inria-00424516v1
|
||
|
|
On Ordinal Invariants in Well Quasi Orders and Finite Antichain OrdersPeter M. Schuster; Monika Seisenberger; Andreas Weiermann. Well-Quasi Orders in Computation, Logic, Language and Reasoning, 53, Springer, 2020, Trends in Logic, ⟨10.1007/978-3-030-30229-0_2⟩
Chapitre d'ouvrage
halshs-01625981v1
|
||
|
|
The Ideal Approach to Computing Closed Subsets in Well-Quasi-orderingsWell Quasi-Orders in Computation, Logic, Language and Reasoning, 53, Springer, pp.55-105, 2020, Trends in Logic, 978-3-030-30228-3. ⟨10.1007/978-3-030-30229-0_3⟩
Chapitre d'ouvrage
hal-03083290v1
|
||
|
|
On shuffle products, acyclic automata and piecewise-testable languagesInformation Processing Letters, 2019, 145, pp.68-73. ⟨10.1016/j.ipl.2019.01.012⟩
Article dans une revue
hal-02408648v1
|
||
Model Checking Lossy Channels Systems Is Probably Decidable.6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Apr 2003, Warsaw, Poland. pp.120-135
Communication dans un congrès
inria-00424339v1
|
|||
|
|
On Solving Temporal Logic Queries9th International Conference on Algebraic Methodology and Software Technology (AMAST'02), Sep 2002, Saint Gilles les Bains, Réunion. ⟨10.1007/3-540-45719-4_12⟩
Communication dans un congrès
hal-01756107v1
|
||
|
|
Model Checking a Path (Preliminary Report)Proceedings of the 14th International Conference on Concurrency Theory (CONCUR'03), 2003, Marseilles, France. pp.251-265, ⟨10.1007/b11938⟩
Communication dans un congrès
hal-01194626v1
|
||
|
|
Multiply-Recursive Upper Bounds with Higman's Lemma38th International Colloquium on Automata, Languages and Programming, Jul 2011, Zürich, Switzerland. p. 441--452, ⟨10.1007/978-3-642-22012-8_35⟩
Communication dans un congrès
hal-00609865v1
|
||
|
|
Computable fixpoints in well-structured symbolic model checkingFormal Methods in System Design, 2013, 43 (2), pp.233-267. ⟨10.1007/s10703-012-0168-y⟩
Article dans une revue
hal-00906826v1
|
- 1
- 2