Filtrer vos résultats
- 25
- 11
- 29
- 4
- 1
- 1
- 1
- 36
- 1
- 1
- 1
- 2
- 4
- 2
- 1
- 2
- 3
- 3
- 3
- 3
- 4
- 3
- 1
- 1
- 1
- 1
- 36
- 35
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 36
- 21
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
36 résultats
|
|
|
triés par
|
|
|
Reachability in Two-Dimensional Vector Addition Systems with States: One Test Is for FreeCONCUR 2020 - 31st International Conference on Concurrency Theory, Sep 2020, Vienne, Austria. pp.37:1--37:17, ⟨10.4230/LIPIcs.CONCUR.2020.37⟩
Communication dans un congrès
hal-03030982v1
|
||
|
|
Accelerated Data-Flow AnalysisStatic Analysis, 2007, Kongens Lyngby, Denmark. pp.184-199, ⟨10.1007/978-3-540-74061-2_12⟩
Communication dans un congrès
hal-00346005v1
|
||
Modeling and Verifying Behavioral AspectsFormal Methods for Embedded Distributed Systems - How to master the complexity, Kluwer Academic Publishers, pp.171-211, 2004, 1-4020-7996-6
Chapitre d'ouvrage
hal-01520010v1
|
|||
|
|
Reachability Analysis of Communicating Pushdown SystemsFOSSACS 2010, 2010, Cyprus. pp.267-281, ⟨10.1007/978-3-642-12032-9_19⟩
Communication dans un congrès
hal-00527648v1
|
||
Model Checking AllTL Properties for Set AutomataMOVEP, 2006, Bordeaux, France. pp.203-209
Communication dans un congrès
hal-00407478v1
|
|||
|
|
Decidable Topologies for Communicating Automata with FIFO and Bag ChannelsCONCUR 2014 - 25th International Conference on Concurrency Theory, Sep 2014, Rome, Italy. pp.281-296, ⟨10.1007/978-3-662-44584-6_20⟩
Communication dans un congrès
hal-01023456v1
|
||
|
|
A Relational Trace Logic for Vector Addition Systems with Application to Context-FreenessCONCUR 2013 - 24th International Conference on Concurrency Theory, Aug 2013, Buenos Aires, Argentina. pp.137-151, ⟨10.1007/978-3-642-40184-8_11⟩
Communication dans un congrès
hal-00851915v1
|
||
|
|
Reachability Analysis of Communicating Pushdown Systems2010
Pré-publication, Document de travail
hal-00443529v1
|
||
|
|
Verification of Embedded Reactive Fiffo SystemsLATIN 2002: Theoretical Informatics, 5th Latin American Symposium, Apr 2002, Cancun, Mexico. pp.400-414
Communication dans un congrès
hal-00477233v1
|
||
|
|
Backward coverability with pruning for lossy channel systemsSPIN 2017 - 24th ACM SIGSOFT International SPIN Symposium on Model Checking of Software, Jul 2017, Santa Barbara, United States. pp.132-141, ⟨10.1145/3092282.3092292⟩
Communication dans un congrès
hal-02391841v1
|
||
|
|
On the Boundedness Problem for Higher-Order Pushdown Vector Addition SystemsFSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.44:1-44:20, ⟨10.4230/LIPIcs.FSTTCS.2018.44⟩
Communication dans un congrès
hal-01962407v1
|
||
|
|
McScM: A General Framework for the Verification of Communicating Machines18th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), Apr 2012, Tallinn, Estonia. pp.487-484, ⟨10.1007/978-3-642-28756-5⟩
Communication dans un congrès
hal-00688776v1
|
||
|
|
On the Coverability Problem for Pushdown Vector Addition Systems in One DimensionICALP 2015 - 42nd International Colloquium on Automata, Languages, and Programming, Jul 2015, Kyoto, Japan. pp.324-336, ⟨10.1007/978-3-662-47666-6_26⟩
Communication dans un congrès
hal-02391883v1
|
||
|
|
SPaCIFY: a Formal Model-Driven Engineering for Spacecraft On-Board Software5th European Congress on Embedded Real Time Software and Systems (ERTS2 2010), AAAF : Association Aéronautique et Astronautique de France; SEE : French Electrical, Electronics, and Information & Communication Technologies Society; SIA: Société des Ingénieurs de l'Automobile, May 2010, Toulouse, France
Communication dans un congrès
hal-02267838v1
|
||
|
|
Unfolding Concurrent Well-Structured Transition SystemsProc. of the 13th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS07), Mar 2007, Portugal. pp.706--720
Communication dans un congrès
hal-00306299v1
|
||
|
|
Hyper-Ackermannian Bounds for Pushdown Vector Addition SystemsCSL-LICS 2014 - Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science, Jul 2014, Vienna, Austria. pp.Article 63, ⟨10.1145/2603088.2603146⟩
Communication dans un congrès
hal-00989109v1
|
||
|
|
Reachability of Communicating Timed ProcessesFoSSaCS - 16th International Conference on Foundations of Software Science and Computation Structures, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS - 2013, Mar 2013, Rome, Italy. pp.81-96, ⟨10.1007/978-3-642-37075-5_6⟩
Communication dans un congrès
hal-00744085v1
|
||
|
|
Extrapolation-based Path Invariants for Abstraction Refinement of Fifo Systems2009
Autre publication scientifique
hal-00380517v2
|
||
Safety Verification of Communicating One-Counter MachinesFSTTCS 2012 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2012, Hyderabad, India. pp.224-235, ⟨10.4230/LIPIcs.FSTTCS.2012.224⟩
Communication dans un congrès
hal-00955500v1
|
|||
|
|
Reachability for Two-Counter Machines with One Test and One ResetFSTTCS 2018 - 38th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2018, Ahmedabad, India. pp.31:1-31:14, ⟨10.4230/LIPIcs.FSTTCS.2018.31⟩
Communication dans un congrès
hal-01848554v2
|
||
|
|
Occam's Razor applied to the Petri net coverability problemTheoretical Computer Science, 2018, 750, pp.38-52. ⟨10.1016/j.tcs.2018.04.014⟩
Article dans une revue
hal-02390655v1
|
||
|
|
The Context-Freeness Problem Is coNP-Complete for Flat Counter SystemsATVA'14, Nov 2014, Sydney, Australia. pp.248 - 263, ⟨10.1007/978-3-319-11936-6_19⟩
Communication dans un congrès
hal-01084819v1
|
||
Qualitative Transition Systems for the Abstraction and Comparison of Transient Behavior in Parametrized Dynamic ModelsComputational Methods in Systems Biology (CMSB'09), 2009, Bologna, Italy. pp.313--327
Communication dans un congrès
hal-00408909v1
|
|||
|
|
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with StatesPETRI NETS 2018 - 39th International Conference on the Application and Theory of Petri Nets and Concurrency, Jun 2018, Bratislava, Slovakia. pp.184-203, ⟨10.1007/978-3-319-91268-4_10⟩
Communication dans un congrès
hal-01792566v1
|
||
|
|
Co-Finiteness and Co-Emptiness of Reachability Sets in Vector Addition Systems with StatesFundamenta Informaticae, 2019, 169 (1-2), pp.123-150. ⟨10.3233/FI-2019-1841⟩
Article dans une revue
hal-02390597v1
|
||
|
|
Polynomial-Space Completeness of Reachability for Succinct Branching VASS in Dimension OneInternational Colloquium on Automata, Languages, and Programming (ICALP), Jul 2017, Varsovie, Poland. pp.119, ⟨10.4230/LIPIcs.ICALP.2017.119⟩
Communication dans un congrès
hal-01688742v1
|
||
|
|
On Functions Weakly Computable by Pushdown Petri Nets and Related SystemsLogical Methods in Computer Science, 2019, 15 (4), ⟨10.23638/LMCS-15(4:15)2019⟩
Article dans une revue
hal-02506437v1
|
||
|
|
REACHABILITY ANALYSIS OF COMMUNICATING PUSHDOWN SYSTEMSLogical Methods in Computer Science, 2012, 8 (3:23), pp.1--20. ⟨10.2168/LMCS-8(3:23)2012⟩
Article dans une revue
hal-00760287v1
|
||
|
|
Acceleration in Convex Data-Flow AnalysisFSTTCS, 2007, New Delhi, India. pp.520-531, ⟨10.1007/978-3-540-77050-3_43⟩
Communication dans un congrès
hal-00346295v1
|
||
|
|
Flat Counter Automata Almost Everywhere!Third International Symposium, ATVA 2005, 2005, Taipei, Taiwan. pp.489-503, ⟨10.1007/11562948_36⟩
Communication dans un congrès
hal-00346310v1
|
- 1
- 2