Filtrer vos résultats
- 42
- 6
- 2
- 21
- 20
- 5
- 1
- 1
- 1
- 1
- 15
- 3
- 50
- 1
- 3
- 4
- 6
- 1
- 4
- 2
- 4
- 4
- 2
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 2
- 2
- 46
- 4
- 45
- 45
- 8
- 5
- 4
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 50
- 7
- 5
- 5
- 3
- 3
- 3
- 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
50 résultats
|
|
|
triés par
|
Induction for Termination[Intern report] 99-R-338 || gnaedig99a, 1999, pp.21
Rapport
inria-00098943v1
|
|||
|
|
Equational Abstraction Refinement for Certified Tree Regular Model Checking[Technical Report] 2010
Rapport
inria-00501487v2
|
||
|
|
Towards Static Analysis of Functional Programs using Tree Automata Completion[Research Report] 2013, pp.15
Rapport
hal-00921814v1
|
||
|
|
Automata-Based Verification of Relational Properties of Functions over Algebraic Data StructuresFSCD 2023 - 8th International Conference on Formal Structures for Computation and Deduction, Jun 2023, Rome, Italy. pp.1-21, ⟨10.4230/LIPIcs.FSCD.2023.7⟩
Communication dans un congrès
hal-04216680v1
|
||
|
|
On the Unobservability of a Trust Relation in Mobile Ad Hoc NetworksInformation Security Theory and Practice. Smart Devices, Pervasive Systems, and Ubiquitous Networks, 2009, Belgium. pp.1-11
Communication dans un congrès
hal-00780724v1
|
||
|
|
Towards Static Analysis of Functional Programs Using Tree Automata CompletionWorkshop on Rewriting Logic and its Applications, Santiago Escobar, Apr 2014, Grenoble, France. pp.147 - 161, ⟨10.1007/978-3-319-12904-4_8⟩
Communication dans un congrès
hal-01089993v1
|
||
|
|
Vers un outil de vérification formelle légere pour OCamlAFADL, 2015, Bordeaux, France. pp.6
Communication dans un congrès
hal-01194538v1
|
||
Using Animation to Improve Formal Specifications of Security ProtocolsThe 2nd National Conference on Security in Network Architectures and Information Systems, 2007, France
Communication dans un congrès
hal-00468718v1
|
|||
|
|
Termination of Ethereum’s Smart ContractsSECRYPT 2020 - 17th International Conference on Security and Cryptography, Jul 2020, Lieusaint - Paris / Virtual, France. pp.39-51, ⟨10.5220/0009564100390051⟩
Communication dans un congrès
hal-03122008v1
|
||
|
|
Kharon : Découvrir, comprendre et reconnaître des malware Android par suivi de flux d'informationRendez-vous de la Recherche et de l'Enseignement de la Sécurité des Systèmes d'Information, May 2015, Troyes, France
Communication dans un congrès
hal-01154368v1
|
||
|
|
Termination criteria for tree automata completionJournal of Logical and Algebraic Methods in Programming, 2016, 85, Issue 1, part 1, pp.3-33. ⟨10.1016/j.jlamp.2015.05.003⟩
Article dans une revue
hal-01194533v1
|
||
|
|
A Short SPAN+AVISPA Tutorial[Research Report] IRISA. 2015
Rapport
hal-01213074v5
|
||
|
|
Termination Proofs Using gpo Ordering Constraints : Extended Version[Research Report] RR-3087, INRIA. 1997, pp.37
Rapport
inria-00073604v1
|
||
|
|
Rewriting for Cryptographic Protocol Verification - Extended Version[Research Report] RR-3921, INRIA. 2000
Rapport
inria-00072731v1
|
||
|
|
Rewriting for Fast Prototyping of Static Analyzers[Research Report] RR-5997, INRIA. 2006, pp.20
Rapport
inria-00106330v2
|
||
|
|
Towards an Efficient Implementation of Tree Automata Completion12th International Conference on Algebraic Methodology and Software Technology - AMAST'08, Jul 2008, Urbana, Illinois, United States. pp.67-82
Communication dans un congrès
inria-00304010v1
|
||
Feasible Trace Reconstruction for Rewriting ApproximationsRTA'2006, Aug 2006, Seattle, United States. pp.123-135
Communication dans un congrès
hal-00463426v1
|
|||
|
|
Reachability Analysis of Innermost Rewriting - extended versionLogical Methods in Computer Science, 2017, ⟨10.2168/LMCS-???⟩
Article dans une revue
hal-01532090v1
|
||
|
|
Verifying Higher-Order Functions with Tree Automata: Extended Version[Technical Report] Irisa. 2017, pp.1-20
Rapport
hal-01614380v4
|
||
|
|
Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation[Research Report] RR-4576, INRIA. 2002
Rapport
inria-00072012v1
|
||
A completion algorithm for lattice tree automataCIAA 2013 - 18th International Conference on Implementation and Application of Automata, Jul 2013, Halifax, NS, Canada. pp.134-145, ⟨10.1007/978-3-642-39274-0_13⟩
Communication dans un congrès
istex
cea-01834984v1
|
|||
|
|
Reachability Analysis of Innermost Rewriting[Research Report] 2013
Rapport
hal-00848260v5
|
||
|
|
Termination of Ethereum's Smart Contracts[Research Report] Univ Rennes, Inria, CNRS, IRISA. 2020
Rapport
hal-02555738v3
|
||
|
|
Reachability analysis of rewriting for software verificationSoftware Engineering [cs.SE]. Université Rennes 1, 2009
HDR
tel-00477013v2
|
||
|
|
A Note on the Precision of the Tree Automata Completion[Research Report] IRISA. 2014, pp.13
Rapport
hal-01091393v1
|
||
Automata and Equations based Approximations for Reachability AnalysisWRLA 2018 - 12th International Workshop on Rewriting Logic and its Applications, Apr 2018, Thessalonique, Greece. pp.1
Communication dans un congrès
hal-01775202v1
|
|||
|
|
Decidable Approximations of Sets of Descendants and Sets of Normal Forms - extended version[Research Report] RR-3325, INRIA. 1997, pp.28
Rapport
inria-00073364v1
|
||
|
|
Decidable Approximations of Sets of Descendants and Sets of Normal forms9th Conference on Rewriting Techniques and Applications, 1998, Tsukuba, Japan, pp.151-165
Communication dans un congrès
inria-00098700v1
|
||
|
|
Tree Automata Completion for Static Analysis of Functional Programs2013
Rapport
hal-00780124v2
|
||
|
|
Proofs as Cryptography: a new interpretation of the Curry-Howard isomorphism for software certificates2012
Pré-publication, Document de travail
hal-00715726v1
|
- 1
- 2