Filtrer vos résultats
- 116
- 23
- 46
- 35
- 23
- 21
- 4
- 4
- 3
- 1
- 1
- 1
- 17
- 134
- 4
- 3
- 2
- 790
- 659
- 609
- 589
- 535
- 478
- 431
- 391
- 370
- 324
- 322
- 317
- 312
- 307
- 305
- 294
- 290
- 283
- 266
- 259
- 251
- 226
- 220
- 218
- 218
- 218
- 216
- 215
- 213
- 212
- 211
- 205
- 202
- 201
- 200
- 197
- 196
- 194
- 192
- 191
- 191
- 189
- 183
- 182
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 168
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 154
- 152
- 152
- 152
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 141
- 140
- 139
- 139
- 139
- 138
- 137
- 137
- 137
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 10
- 8
- 6
- 6
- 10
- 7
- 2
- 13
- 6
- 14
- 5
- 5
- 5
- 7
- 3
- 2
- 4
- 5
- 2
- 4
- 4
- 2
- 4
- 2
- 1
- 1
- 1
- 130
- 9
- 29
- 27
- 20
- 19
- 18
- 16
- 16
- 15
- 11
- 11
- 9
- 8
- 8
- 6
- 5
- 5
- 5
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 7
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 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
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 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
|
A Simple Snapshot Algorithm for Multicore Systems[Research Report] PI 1955, 2010
Rapport
inria-00505233v1
|
||
|
Petri Net SynthesisSpringer, pp.339, 2015, Text in Theoretical Computer Science, an EATCS Series, M. Henzinger, J. Hromkovic, M. Nielsen, G. Rozenberg, A. Salomaa, 978-3-662-47966-7. ⟨10.1007/978-3-662-47967-4⟩
Ouvrages
hal-01237142v1
|
||
|
Investigations classiques, complexes et concurrentes à l'aide de la logique linéaireMathématiques [math]. Université Paris-Diderot - Paris VII, 2010
HDR
tel-00460805v1
|
||
|
Resource-Tracking Concurrent GamesFoundations of Software Science and Computation Structures, Apr 2019, Prague, Czech Republic. pp.27-44, ⟨10.1007/978-3-030-17127-8_2⟩
Communication dans un congrès
hal-02096306v1
|
||
|
A Fine-Grained Concurrent Completion Procedure[Research Report] RR-2990, INRIA. 1996, pp.56
Rapport
inria-00073707v1
|
||
|
Choice Trees: Representing Nondeterministic, Recursive, and Impure Programs in CoqProceedings of the ACM on Programming Languages, 2023, pp.1-31. ⟨10.1145/3571254⟩
Article dans une revue
hal-03886910v1
|
||
|
Seamless concurrent programming of objects, aspects and eventsProgramming Languages [cs.PL]. Ecole des Mines de Nantes, 2015. English. ⟨NNT : 2015EMNA0118⟩
Thèse
tel-01238752v1
|
||
Special Issue FMPPTA'98World Scientific, 1999, Parallel Processing Letters
Ouvrages
inria-00108068v1
|
|||
|
Assessing the Scalability of Garbage Collectors on Many CoresPLOS '11 - 6th Workshop on Programming Languages and Operating Systems, Oct 2011, Cascais, Portugal. pp.7:1-7:5, ⟨10.1145/2039239.2039249⟩
Communication dans un congrès
hal-00932818v1
|
||
|
Innocent strategies as presheaves and interactive equivalences for CCS (expanded version)Scientific Annals of Computer Science, 2012, 22 (1), pp.147-199. ⟨10.7561/SACS.2012.1.147⟩
Article dans une revue
hal-00555144v3
|
||
|
Construction et simulation graphiques de comportements : le modèle des IcobjsAutre [cs.OH]. École Nationale Supérieure des Mines de Paris, 2004. Français. ⟨NNT : ⟩
Thèse
tel-00327441v1
|
||
|
Reasoning between Programming Languages and ArchitecturesComputer Science [cs]. ENS Paris - Ecole Normale Supérieure de Paris, 2014
HDR
tel-01110117v1
|
||
|
Symbolic domains and reachability for nets with trajectories2023
Pré-publication, Document de travail
hal-04330097v1
|
||
Modélisation de systèmes biologiques en programmation concurrente par contraintes hybridesOnzièmes Journées Francophone de Programmation en logique avec contraintes - JFPLC'02, 2002, Nice, France, pp.167-180
Communication dans un congrès
inria-00100782v1
|
|||
|
Formally Verifying Information Flow Type Systems for Concurrent and Thread Systems2nd ACM Workshop on Formal Methods in Security Engineering - FMSE'2004, Michael Backes, David Basin, and Michael Waidner, Oct 2004, Washington D.C./USA, pp.13-22, ⟨10.1145/1029133.1029136⟩
Communication dans un congrès
inria-00000632v1
|
||
|
On the Complexity of Concurrent Multiset RewritingInternational Journal of Foundations of Computer Science, 2016, 27 (1), ⟨10.1142/S0129054116500052⟩
Article dans une revue
hal-01326849v1
|
||
|
Power and limits of distributed computing shared memory models[Research Report] PI-1974, 2011, pp.15
Rapport
inria-00583304v1
|
||
|
Programming in JoCaml --- Extended Version[Research Report] RR-6261, INRIA. 2007
Rapport
inria-00166125v2
|
||
|
Dépliages et interprétation abstraite pour réseaux de régulation biologiques paramétrésBioinformatics [q-bio.QM]. Université Paris-Saclay, 2021. English. ⟨NNT : 2021UPASG048⟩
Thèse
tel-03338961v1
|
||
Philosophers may Dine - Definitively!16th International Conference on Integrated Formal Methods, 2020, ⟨10.1007/978-3-030-63461-2_23⟩
Chapitre d'ouvrage
hal-03134972v1
|
|||
|
The Renaming Problem in Shared Memory Systems: an Introduction[Research Report] PI-1960, 2010, pp.29
Rapport
inria-00537914v1
|
||
|
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open MapsMFPS XXIX - Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, Jun 2013, New Orleans, United States. pp.165 - 178, ⟨10.1016/j.entcs.2013.09.012⟩
Communication dans un congrès
hal-01087917v1
|
||
|
A mechanized program logic for concurrent programs with the weak memory model of Multicore OCamlOther [cs.OH]. Université Paris Cité, 2022. English. ⟨NNT : 2022UNIP7173⟩
Thèse
tel-04356627v1
|
||
|
Calcul d'objet asynchrone : confluence et déterminismeModélisation et simulation. Université Nice Sophia Antipolis, 2003. Français. ⟨NNT : ⟩
Thèse
tel-00505940v1
|
||
|
Type Systems for Distributed Programs: Components and SessionsProgramming Languages [cs.PL]. Università degli studi di Bologna, 2014. English. ⟨NNT : ⟩
Thèse
tel-01020998v1
|
||
|
Compositional verification of priority systems using sharp bisimulationFormal Methods in System Design, 2023, ⟨10.1007/s10703-023-00422-1⟩
Article dans une revue
hal-04103681v1
|
||
|
Compositional Verification of Priority Systems using Sharp Bisimulation[Research Report] INRIA. 2022, pp.1-32
Rapport
hal-03640683v1
|
||
|
Component-Oriented Programming with Sharing: Containment is not OwnershipGenerative Programming and Component Engineering (GPCE), 2005, Tallinn, Estonia. pp.389-404, ⟨10.1007/11561347_26⟩
Communication dans un congrès
hal-00310126v1
|
||
|
OFence: Pairing Barriers to Find Concurrency Bugs in the Linux KernelEuroSys 2023 : Eighteenth European Conference on Computer Systems, May 2023, Rome, Italy. pp.33-45, ⟨10.1145/3552326.3567504⟩
Communication dans un congrès
hal-04109096v1
|
||
|
Ecosystem Causal Analysis Using Petri Net UnfoldingsComputer science. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG105⟩
Thèse
tel-04556225v1
|