Filtrer vos résultats
- 79
- 29
- 53
- 16
- 11
- 10
- 10
- 4
- 2
- 1
- 1
- 8
- 1
- 106
- 2
- 1
- 1
- 10
- 5
- 8
- 9
- 13
- 16
- 21
- 25
- 91
- 17
- 108
- 81
- 31
- 20
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 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
- 17
- 14
- 11
- 10
- 9
- 8
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 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
- 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
108 résultats
|
Automated Certification of Implicit Induction ProofsCertified Programs and Proofs, Dec 2011, Kenting, Taiwan
Communication dans un congrès
hal-00644876v1
|
||
Analysis of Rewrite-Based Access Control Policies3rd International Workshop on Security and Rewriting Techniques, Jun 2008, Pittsburgh, United States
Communication dans un congrès
inria-00335088v1
|
|||
|
Refinement types as higher order dependency pairsRTA'11 - 22nd International Conference on Rewriting Techniques and Applications, May 2011, Novi Sad, Serbia. pp.299-312
Communication dans un congrès
inria-00598567v1
|
||
|
Regaining Cut Admissibility in Deduction Modulo using Abstract CompletionInformation and Computation, 2010, 208 (2), pp.140-164. ⟨10.1016/j.ic.2009.10.005⟩
Article dans une revue
inria-00132964v2
|
||
Défis 2025Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2015, 34 (3), pp.311-324. ⟨10.3166/TSI.34.293-306⟩
Article dans une revue
hal-01345654v1
|
|||
|
A Type System for TomProceedings Tenth International Workshop on Rule-Based Programming - RULE 2009, Jun 2009, Brasilia, Brazil. ⟨10.4204/EPTCS.21.5⟩
Communication dans un congrès
inria-00426439v2
|
||
|
Bonnes démonstrations en déduction moduloInformatique [cs]. Université Henri Poincaré - Nancy 1, 2009. Français. ⟨NNT : 2009NAN10014⟩
Thèse
tel-01748505v2
|
||
|
Méthodes algébriques pour la formalisation et l'analyse de politiques de sécuritéLogique en informatique [cs.LO]. Université Henri Poincaré - Nancy I, 2011. Français. ⟨NNT : ⟩
Thèse
tel-00646401v1
|
||
|
Inductive Proof Search ModuloAnnals of Mathematics and Artificial Intelligence, 2009, Special Issue on First-Order Theorem Proving / Guest Edited by Silvio Ranise and Ullrich Hustadt, 55 (1), pp.123-154. ⟨10.1007/s10472-009-9154-5⟩
Article dans une revue
istex
inria-00337380v1
|
||
|
Contraintes d'anti-filtrage et programmation par réécritureGénie logiciel [cs.SE]. Institut National Polytechnique de Lorraine - INPL, 2008. Français. ⟨NNT : 2008INPL045N⟩
Thèse
tel-01748690v2
|
||
|
Strategic Computation and DeductionChristoph Benzmüller and Chad E. Brown and Jörg Siekmann and Richard Statman. Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday, 17, College Publications, pp.339-364, 2008, Studies in Logic and the Foundations of Mathematics, 978-1-904987-70-3
Chapitre d'ouvrage
inria-00433745v1
|
||
Integrating Implicit Induction Proofs into Certified Proof EnvironmentsIntegrated Formal Methods - IFM 2010, INRIA Nancy Grand Est, Oct 2010, Nancy, France. pp.320-335
Communication dans un congrès
inria-00525187v1
|
|||
|
A faithful encoding of programmable strategies into term rewriting systemsRewriting Techniques and Application 2015, Jun 2015, Warsaw, Poland. pp.15, ⟨10.4230/LIPIcs.RTA.2015.74⟩
Communication dans un congrès
hal-01168956v1
|
||
|
A faithful encoding of programmable strategies into term rewriting systems2015
Pré-publication, Document de travail
hal-01119941v1
|
||
Idée reçue : l'informatique nomade, c'est la liberté !Interstices, 2013
Article dans une revue
hal-00794187v1
|
|||
|
Higher-dimensional categories with finite derivation typeTheory and Applications of Categories, 2009, 22 (18), pp.420-478. ⟨10.48550/arXiv.0810.1442⟩
Article dans une revue
hal-00326974v2
|
||
|
Environmental Bisimulations for Delimited-Control Operators with Dynamic Prompt Generation1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016), Jun 2016, Porto, Portugal. ⟨10.4230/LIPIcs.FSCD.2016.9⟩
Communication dans un congrès
hal-01335959v1
|
||
|
A constraint language for algebraic term based on rewriting theory[Research Report] 2011, pp.8
Rapport
hal-00646343v1
|
||
A Java Framework for Test Data Generation2015
Pré-publication, Document de travail
hal-01261975v1
|
|||
|
Automating Theories in Intuitionistic Logic7th International Symposium on Frontiers of Combining Systems -FroCoS'09, Sep 2009, Trento, Italy. pp.181-197, ⟨10.1007/978-3-642-04222-5_11⟩
Communication dans un congrès
inria-00395934v2
|
||
|
Secure Interoperation in Heterogeneous Systems based on Colored Petri Nets2009
Pré-publication, Document de travail
inria-00396952v1
|
||
Specification, analysis and transformation of security policies via rewriting techniquesJournal of Information Assurance and Security, 2011, 6 (5), pp.357-368
Article dans une revue
inria-00525761v1
|
|||
Component-based Security Policy Design with Colored Petri NetsSemantics and Algebraic Specification, Marina Lenisa, Sep 2009, Udine, Italy. pp.21-42
Communication dans un congrès
inria-00433372v1
|
|||
Rewrite Based Specification of Access Control Policies3rd International Workshop on Security and Rewriting Techniques - SecReT 2008, Jun 2008, Pittsburgh, United States. pp.37-54
Communication dans un congrès
inria-00335091v1
|
|||
|
A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations[Research Report] RR-6411, INRIA. 2008, pp.6
Rapport
inria-00204579v2
|
||
TomML: A Rule Language For Structured DataInternational RuleML Symposium on Rule Interchange and Applications - RuleML 2009, Nov 2009, Las Vegas, United States. pp.262-271
Communication dans un congrès
inria-00429229v1
|
|||
|
Tom Manual[Technical Report] 2009, pp.155
Rapport
inria-00121885v4
|
||
|
Conception d'un langage dédié à l'analyse et la transformation de programmesGénie logiciel [cs.SE]. Université Henri Poincaré - Nancy 1, 2009. Français. ⟨NNT : 2009NAN10026⟩
Thèse
tel-01748507v2
|
||
|
Sound and Complete Bisimilarities for Call-by-Name and Call-by-Value Lambda-mu Calculus[Research Report] RR-8447, INRIA. 2014
Rapport
hal-00926100v2
|
||
|
Applicative Bisimilarities for Call-by-Name and Call-by-Value λμ-CalculusMathematical Foundations of Programming Semantics Thirtieth Conference, Jun 2014, Ithaca, United States. pp.49 - 64, ⟨10.1016/j.entcs.2014.10.004⟩
Communication dans un congrès
hal-01080960v1
|