Filtrer vos résultats
- 139
- 76
- 85
- 59
- 32
- 24
- 6
- 5
- 3
- 1
- 21
- 9
- 210
- 16
- 1
- 787
- 659
- 608
- 589
- 532
- 478
- 431
- 390
- 369
- 323
- 320
- 317
- 312
- 307
- 304
- 294
- 290
- 283
- 266
- 259
- 250
- 226
- 219
- 218
- 218
- 218
- 216
- 215
- 213
- 211
- 210
- 205
- 201
- 201
- 198
- 197
- 195
- 193
- 192
- 191
- 191
- 188
- 183
- 182
- 179
- 179
- 178
- 176
- 174
- 171
- 170
- 167
- 164
- 162
- 161
- 161
- 159
- 157
- 157
- 156
- 155
- 154
- 154
- 152
- 152
- 151
- 150
- 150
- 149
- 148
- 147
- 147
- 144
- 142
- 142
- 141
- 141
- 140
- 140
- 139
- 139
- 138
- 137
- 137
- 137
- 136
- 136
- 136
- 136
- 136
- 135
- 135
- 133
- 132
- 131
- 131
- 131
- 131
- 131
- 128
- 1
- 4
- 5
- 6
- 6
- 5
- 3
- 4
- 2
- 9
- 3
- 3
- 9
- 9
- 7
- 10
- 6
- 7
- 4
- 7
- 15
- 23
- 18
- 14
- 13
- 6
- 10
- 2
- 2
- 1
- 1
- 177
- 38
- 150
- 121
- 29
- 27
- 19
- 14
- 11
- 10
- 8
- 8
- 8
- 7
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 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
- 34
- 25
- 24
- 23
- 19
- 17
- 17
- 11
- 7
- 7
- 7
- 7
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 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
- 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
|
Rule based programming in Java for protocol verification5th International Workshop on Rewriting Logic and its Applications - WRLA'2004, Narciso Marti-Oliet, 2004, Barcelona, Spain. 18 p, ⟨10.1016/j.entcs.2004.06.022⟩
Communication dans un congrès
inria-00100025v1
|
||
Certification of Termination Proofs Using Polynomial Interpretations17th European Summer School in Logic, Language and Information - ESSLLI '05, Aug 2005, Edimbourg/Grande Bretagne
Communication dans un congrès
inria-00001205v1
|
|||
|
Représentation et interaction des preuves en superdéduction moduloGénie logiciel [cs.SE]. Université Henri Poincaré - Nancy I, 2010. Français. ⟨NNT : 2010NAN10026⟩
Thèse
tel-00553219v1
|
||
|
Refinement Types as Higher Order Dependency Pairs[Research Report] 2011, pp.19
Rapport
inria-00552046v2
|
||
|
Introduction to the Rewriting Calculus[Research Report] RR-3818, INRIA. 1999, pp.50
Rapport
inria-00072840v1
|
||
|
Theorem Proving Modulo[Research Report] RR-3400, INRIA. 1998, pp.27
Rapport
inria-00077199v1
|
||
Encoding the Hydra battle as a rewrite systemInternational Symposium on the Mathematical Foundations of Computer Science - MFCS'98, Aug 1998, Brno, Czech Republic, pp.267-276
Communication dans un congrès
inria-00098575v1
|
|||
Algorithms and Reductions for Rewriting ProblemsProceedings 9th Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan, pp.166-180
Communication dans un congrès
inria-00098607v1
|
|||
On the Exploration of the Query Rewriting Space with Existential Rules[Research Report] RR-13016, Lirmm. 2013
Rapport
lirmm-00825634v1
|
|||
|
Factorize FactorizationCSL 2021 - 29th EACSL Annual Conference on Computer Science Logic, Jan 2021, Ljubljana, Slovenia. ⟨10.4230/LIPIcs.CSL.2021.22⟩
Communication dans un congrès
hal-03044338v1
|
||
Towards an Automatic Analysis of Web Service Security6th International Symposium on Frontiers of Combining Systems - FroCoS'07, Sep 2007, Liverpool, United Kingdom. pp.133-147, ⟨10.1007/978-3-540-74621-8_9⟩
Communication dans un congrès
istex
inria-00557707v1
|
|||
|
Tactics for Reasoning modulo AC in CoqCertified Proofs and Programs, 2011, Taiwan. pp167-182, ⟨10.1007/978-3-642-25379-9_14⟩
Communication dans un congrès
hal-00484871v4
|
||
|
Gouvernance et étude de l'impact du changement des processus métiers sur les architectures orientées services : une approche dirigée par les modèlesArchitectures Matérielles [cs.AR]. Université de Lorraine, 2012. Français. ⟨NNT : 2012LORR0241⟩
Thèse
tel-01749632v2
|
||
|
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typageAutre [cs.OH]. Institut National Polytechnique de Lorraine, 2007. Français. ⟨NNT : 2007INPL102N⟩
Thèse
tel-01752911v1
|
||
|
Asymptotic Determinacy of Path Queries using Union-of-Paths Views18th International Conference on Database Theory (ICDT 2015), Mar 2015, Brussels, Belgium. ⟨10.4230/LIPIcs.ICDT.2015.44⟩
Communication dans un congrès
hal-01150780v1
|
||
|
Proof reconstruction (preliminary version).[Research Report] LIP 1996-26, Laboratoire de l'informatique du parallélisme. 1996, 2+14p
Rapport
hal-02101787v1
|
||
|
Using Deduction Modulo in Set TheorySETS14, 1st International Workshop about Sets and Tools, Jun 2014, Toulouse, France. pp.12
Communication dans un congrès
hal-01100512v1
|
||
|
Some Axioms for MathematicsFSCD 2021 - 6th International Conference on Formal Structures for Computation and Deduction, Jul 2021, Buenos Aires / Virtual, Argentina. ⟨10.4230/LIPIcs.FSCD.2021.20⟩
Communication dans un congrès
hal-03279749v1
|
||
|
Behavior Abstraction in Malware Analysis1st International Conference on Runtime Verification, Howard Barringer, Klaus Havelund, Insup Lee, Nov 2010, St. Julians, Malta. pp.168-182, ⟨10.1007/978-3-642-16612-9_14⟩
Communication dans un congrès
inria-00536500v1
|
||
Projet GasEl. Elaboration d'un logiciel de génération de mécanismes détaillés d'oxydation et de combustion de molécules d'hydrocarbures. Rapport No 5[Contrat] A03-R-541 || ibanescu03b, 2003, 42 p
Rapport
inria-00099760v1
|
|||
|
Unbounded Proof-Length Speed-up in Deduction Modulo16th EACSL Annual Conference on Computer Science and Logic - CSL 2007, Jacques Duparc, Sep 2007, Lausanne, Switzerland. pp.496-511, ⟨10.1007/978-3-540-74915-8_37⟩
Communication dans un congrès
inria-00138195v3
|
||
|
Higher-dimensional normalisation strategies for acyclicityAdvances in Mathematics, 2012, 231 (3-4), pp.2294-2351. ⟨10.1016/j.aim.2012.05.010⟩
Article dans une revue
hal-00531242v3
|
||
|
CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificatesMathematical Structures in Computer Science, 2011, 21 (4), pp.827-859. ⟨10.1017/S0960129511000120⟩
Article dans une revue
inria-00543157v1
|
||
A Computability Path Ordering for Polymorphic Terms11th International Workshop on Termination, Jul 2010, Edinburgh, United Kingdom
Communication dans un congrès
inria-00497405v1
|
|||
|
The Taming of the Rew: A Type Theory with Computational AssumptionsProceedings of the ACM on Programming Languages, 2021, POPL 2021, ⟨10.1145/3434341⟩
Article dans une revue
hal-02901011v2
|
||
|
Size-based termination of higher-order rewritingJournal of Functional Programming, 2018, ⟨10.1017/S0956796818000072⟩
Article dans une revue
hal-01424921v5
|
||
|
Computability Closure: Ten Years LaterColloquium in honor of Jean-Pierre Jouannaud, Jun 2007, Cachan, France. ⟨10.1007/978-3-540-73147-4_4⟩
Communication dans un congrès
inria-00161092v1
|
||
A Rho Cube[Intern report] A00-R-344 || cirstea00d, LORIA, UMR 7503, Université de Lorraine, CNRS, Vandoeuvre-lès-Nancy. 2000, 18 p
Rapport
inria-00099309v1
|
|||
Outermost ground termination - Extended version[Intern report] A02-R-493 || fissore02d, 2002, 38 p
Rapport
inria-00101079v1
|
|||
|
CARIBOO: An Induction Based Proof Tool for Termination with StrategiesFourth International Conference on Principles and Practice of Declarative Programming - PPDP'02, Oct 2002, Pittsburgh, USA, 12 p
Communication dans un congrès
inria-00107557v1
|