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
|
||
Ramified Recurrence and Computational Complexity IV : Predicative Functionals and Poly-SpaceInformation and Computation, 2000, 12 p
Article dans une revue
inria-00099077v1
|
|||
|
|
From multiple sequent for Additive Linear Logic to decision procedures for Free LatticesTheoretical Computer Science, 1999, 224 (1-2), pp.157-172. ⟨10.1016/S0304-3975(98)00311-9⟩
Article dans une revue
inria-00098803v1
|
||
|
|
Recursion Schemata for NCk22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, Sep 2008, Bertinoro, Italy. pp.49-63, ⟨10.1007/978-3-540-87531-4_6⟩
Communication dans un congrès
hal-00342366v1
|
||
|
|
Viruses in Turing's GardenERCIM News, 2012, 2012 (91)
Article dans une revue
hal-00762918v1
|
||
|
|
A Characterization of NCk by First Order Functional Programs5th International Conference on Theory and Applications of Models of Computation - TAMC 2008, Xidian University, Apr 2008, Xian, China. pp.136-147, ⟨10.1007/978-3-540-79228-4⟩
Communication dans un congrès
inria-00332390v1
|
||
|
|
Analysis and Diversion of Duqu's DriverMalware 2013 - 8th International Conference on Malicious and Unwanted Software, Oct 2013, Fajardo, Puerto Rico
Communication dans un congrès
hal-00925517v1
|
||
|
|
Isolated virtualised clusters: testbeds for high-risk security experimentation and training3rd Workshop on Cyber Security Experimentation and Test (CSET '10), Aug 2010, Washington DC, United States
Communication dans un congrès
inria-00536712v1
|
||
Boulevard du cybercrimePour la Science. Dossier, 2010, 66, pp.78-85
Article dans une revue
inria-00506082v1
|
|||
Obfuscation: where are we in anti-DSE protections? (a first attempt)the 9th Workshop SSPREW, Dec 2019, San Juan, United States. pp.1-8, ⟨10.1145/3371307.3371309⟩
Communication dans un congrès
hal-02573099v1
|
|||
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures3rd IFIP International Conference on Theoretical Computer Science - TCS'2004, Aug 2004, Toulouse, France, 14 p
Communication dans un congrès
inria-00099896v1
|
|||
A proof theoretic approach to feasible computation[Interne] A00-R-375 || marion00d, 2000, 17 p
Rapport
inria-00099327v1
|
|||
Learning Reversible Categorial Grammars from StructuresCategorial Grammars, 2004, Montpellier, France, 10 p
Communication dans un congrès
inria-00101086v1
|
|||
Resource Analysis by Quasi-InterpretationsSixth International Workshop on Logic and Computational Complexity, Neil Jones, 2004, Turku, Finlande, 95 p
Communication dans un congrès
inria-00110364v1
|
|||
|
|
A characterization of Alternating log time by first order functional programs13th International Conference on Logic for Programming Artificial Intelligence and Reasoning - LPAR-13, Nov 2006, Phnom Penh/Cambodia
Communication dans un congrès
inria-00110014v1
|
||
Identification reversible dependency tree languages3rd Learning Language in Logic (LLL) Workshop, L. Popelinsky, M. Nepil, Sep 2001, Strasbourg, France, 12 p
Communication dans un congrès
inria-00100423v1
|