Filtrer vos résultats
- 73
- 72
- 84
- 33
- 18
- 5
- 4
- 1
- 8
- 1
- 137
- 5
- 1
- 3
- 3
- 3
- 4
- 5
- 1
- 2
- 5
- 3
- 3
- 6
- 9
- 4
- 11
- 10
- 10
- 11
- 8
- 7
- 11
- 7
- 4
- 5
- 5
- 2
- 3
- 126
- 19
- 143
- 77
- 50
- 6
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 145
- 26
- 18
- 14
- 10
- 9
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 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
- 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
145 résultats
|
Quasi-interpretations a way to control resourcesTheoretical Computer Science, 2011, 412 (25), pp.2776-2796. ⟨10.1016/j.tcs.2011.02.007⟩
Article dans une revue
hal-00591862v1
|
||
Surfing Code Waves[Research Report] 2009
Rapport
inria-00378667v1
|
|||
|
A theory of reflexive computation based on soft intuitionistic logic2016
Pré-publication, Document de travail
hal-01394263v1
|
||
|
Informatique et société : Un laboratoire de haute sécurité en informatique : entretien avec Jean-Yves MarionLes Cahiers de l'INRIA - La Recherche, 2011, Les 10 découvertes de l'année, 448 janvier 2011
Article dans une revue
inria-00591075v1
|
||
|
CoDisasm: Medium Scale Concatic Disassembly of Self-Modifying Binaries with Overlapping Instructions22nd ACM Conference on Computer and Communications Security, Oct 2015, Denver, United States. ⟨10.1145/2810103.2813627⟩
Communication dans un congrès
hal-01257908v1
|
||
|
Learning tree languages from positive examples and membership queriesTheoretical Computer Science, 2007, 382 (3), pp.183-197. ⟨10.1016/j.tcs.2007.03.038⟩
Article dans une revue
hal-00175415v1
|
||
Malware Message Classification by Dynamic AnalysisThe 7th International Symposium on Foundations and Practice of Security, Nov 2014, Montreal, Canada. pp.16
Communication dans un congrès
hal-01099692v1
|
|||
|
Resource control of object-oriented programsThe International Workshop on Logic and Computational Complexity - LCC 2007, Jul 2007, Wroclaw/Poland, Poland
Communication dans un congrès
inria-00155288v1
|
||
|
Complexity Information Flow in a Multi-threaded Imperative Language[Research Report] 2012, pp.16
Rapport
hal-00684026v1
|
||
Logical Characterizations of $P_\mathcal{K}$ and $NP_\mathcal{K}$ Over an Arbitrary Structure $K$3rd APPSEM II Workshop - APPSEM'05, Sep 2005, Frauenchiemsee/Germany
Communication dans un congrès
inria-00000519v1
|
|||
Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time.Journal of Logic and Computation, 2005, 15 (1), pp.41--58
Article dans une revue
inria-00102942v1
|
|||
|
Expressiveness + Automation + Soundness: Towards Combining SMT Solvers and Interactive Proof Assistants12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems - TACAS'06, Mar 2006, Vienna/Austria, pp.167-181, ⟨10.1007/11691372_11⟩
Communication dans un congrès
inria-00001088v1
|
||
|
Toward an abstract computer virologySecond International Colloquium on Theoretical Aspects of Computing - ICTAC 2005, Oct 2005, Hanoï/Vietnam, pp.579-593, ⟨10.1007/11560647_38⟩
Communication dans un congrès
inria-00115208v1
|
||
|
A Logical Account of PSPACESymposium on Principles of Programming Languages - POPL'08, Jan 2008, San Francisco, United States. pp.121-131
Communication dans un congrès
hal-00342323v1
|
||
|
Scalable program clone search through spectral analysisESEC/FSE '23 - 31st ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering, Dec 2023, San Francisco, United States. ⟨10.48550/arXiv.2210.13063⟩
Communication dans un congrès
hal-03826726v4
|
||
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary StructuresIn 2nd APPSEM II Workshop - APPSEM'04, Apr 2004, Tallinn/Estonia
Communication dans un congrès
inria-00000520v1
|
|||
Actual arithmetic and feasibilityInternational Workshop on Computer Science Logic - CSl'2001, 2001, Paris, France, pp.115--129
Communication dans un congrès
inria-00100424v1
|
|||
Conclusion 2ème Assises universitaires Droit et Cybersécurité2ème Assises universitaires Droit et Cybersécurité, Faculté de droit et sciences économiques de Nancy; LORIA, Oct 2023, Nancy (Centre de Congrès), France
Communication dans un congrès
hal-04282443v1
|
|||
Une théorie informative de l'apprentissage[Interne] A01-R-014 || besombes01a, 2001, 7 p
Rapport
inria-00100690v1
|
|||
Analysing the implicit complexity of programsInformation and Computation, 2003, 183, pp.2-18
Article dans une revue
inria-00099505v1
|
|||
La virologie informatique - les virus, ennemis utilesPour la science, 2007, 55, pp.60-64
Article dans une revue
hal-00184983v1
|
|||
|
Server-Side Dynamic Code Analysis4th International Conference on Malicious and Unwanted Software - Malware 2009, Fernando C. Colon Osorio, Oct 2009, Montréal, Canada. pp.55-62
Communication dans un congrès
inria-00425554v1
|
||
|
Sup-interpretations, a semantic method for static analysis of program resourcesACM Transactions on Computational Logic, 2009, 10 (4), 30 p. ⟨10.1145/1555746.1555751⟩
Article dans une revue
inria-00446057v1
|
||
|
Two function algebras defining functions in NC k boolean circuitsInformation and Computation, 2016, ⟨10.1016/j.ic.2015.12.009⟩
Article dans une revue
hal-01113342v1
|
||
Predicative Analysis of Feasibility and DiagonalizationTyped Lambda Calculi and Applications, 8th International Conference - TLCA 2007, Jun 2007, Paris, France. pp.290-304
Communication dans un congrès
hal-00175412v1
|
|||
|
Control Flow Graphs as Malware SignaturesInternational Workshop on the Theory of Computer Viruses, Matthieu Kaczmarek; Guillaume Bonfante, May 2007, Nancy, France
Communication dans un congrès
inria-00176235v1
|
||
|
A Classification of Viruses through Recursion TheoremsComputability in Europe, Jun 2007, Sienna, Italy. pp.73-82, ⟨10.1007/978-3-540-73001-9_8⟩
Communication dans un congrès
inria-00175301v1
|
||
|
LockerGoga quickly reversedMALCON 2019 14th International Conference on Malicious and Unwanted Software, Oct 2019, Nantucket, United States
Communication dans un congrès
hal-03178806v1
|
||
|
Analyzing the Implicit Computational Complexity of object-oriented programsAnnual Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS 2008, IARCS, the Indian Association for Research in Computing Science, Dec 2008, Bangalore, India
Communication dans un congrès
inria-00332550v1
|
||
Kolmogorov complexity and non-determinism[Intern report] 98-R-274 || grigorieff98a, 1998, 11 p
Rapport
inria-00098564v1
|