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
|
||
|
Tiered complexity at higher orderDICE-FOPARA 2019 - Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis, Apr 2019, Praha, Czech Republic
Communication dans un congrès
hal-02499318v1
|
||
|
Obfuscation-Resilient Executable Payload Extraction From Packed Malware30th Usenix Security Sympoisum, Aug 2021, Virtual, United States
Communication dans un congrès
hal-03549482v1
|
||
Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time[Intern report] A02-R-322 || bournez02d, 2002, 24 p
Rapport
inria-00101068v1
|
|||
|
BINSEC/SE: A Dynamic Symbolic Execution Toolkit for Binary-level Analysis3rd IEEE International Conference on Software Analysis, Evolution, and Reengineering, Mar 2016, Osaka, Japan
Communication dans un congrès
hal-01721502v1
|
||
Quasi-interpretation: a way to control ressources[Intern report] 2005, pp.35
Rapport
inria-00001257v1
|
|||
Kolmogorov complexity and non-determinismTheoretical Computer Science, 2002, 271 (1-2), pp.151-180. ⟨10.1016/S0304-3975(01)00038-X⟩
Article dans une revue
inria-00100709v1
|
|||
On lexicographic termination ordering with space bound certificationsInternational Andrei Ershov Memorial Conference - PSI'01, 2001, Novosibirsk, Russia, pp.482-493
Communication dans un congrès
inria-00100523v1
|
|||
|
Complexity classes and rewrite systems with polynomial interpretationCSl'98, 1998, Brno, République Tchèque, pp.372-384
Communication dans un congrès
inria-00098689v1
|
||
|
Architecture of a Morphological Malware DetectorJournal in Computer Virology, 2009, 5 (3), pp.263-270. ⟨10.1007/s11416-008-0102-4⟩
Article dans une revue
inria-00330022v1
|
||
|
Complexity Information Flow in a Multi-threaded Imperative LanguageTAMC 2014, Apr 2014, Chennai, India. pp.124 - 140, ⟨10.1007/978-3-319-06089-7_9⟩
Communication dans un congrès
hal-01084043v1
|
||
|
From Turing machines to computer virusesPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, 2012, 370 (1971), pp.3319-3339. ⟨10.1098/rsta.2011.0332⟩
Article dans une revue
hal-00762923v1
|
||
|
Quasi-interpretation Synthesis by Decomposition : An application to higher-order programsICTAC, Sep 2007, Macao, China
Communication dans un congrès
inria-00130920v1
|
||
|
How to kill symbolic deobfuscation for free (or: unleashing the potential of path-oriented protections)ACSAC '19: 2019 Annual Computer Security Applications Conference, Dec 2019, San Juan, Puerto Rico, United States. pp.177-189, ⟨10.1145/3359789.3359812⟩
Communication dans un congrès
hal-02564103v1
|
||
|
Abstraction-based Malware Analysis Using Rewriting and Model CheckingESORICS - 17th European Symposium on Research in Computer Security - 2012, Sep 2012, Pisa, Italy. pp.806-823, ⟨10.1007/978-3-642-33167-1⟩
Communication dans un congrès
hal-00762252v1
|
||
|
Behavior Abstraction in Malware Analysis - Extended Version2010
Pré-publication, Document de travail
inria-00509486v2
|