Inria / Raweb 2009
Presentation of the Project CARTE

Bibliography

Major publications by the team in recent years

[1]: G. Bonfante, M. Kaczmarek, J.-Y. Marion.
Architecture of a morphological malware detector, in: Journal in Computer Virology, 2009, vol. 5, n^o 3, p. 263-270
http://hal.inria.fr/inria-00330022/en/.
[2]: O. Bournez, M. L. Campagnolo, D. S. Graça, E. Hainry.
Polynomial differential equation compute all real computable functions, in: Journal of Complexity, 2007, vol. 23, p. 317-335
http://hal.inria.fr/inria-00102947/en/.
[3]: M. Gaboardi, J.-Y. Marion, S. Ronchi Della Rocca.
A Logical Account of PSPACE, in: Symposium on Principles of Programming Languages - POPL'08, États-Unis d'Amérique San Francisco, ACM, 2008, vol. 43, p. 121-131
http://hal.archives-ouvertes.fr/hal-00342323/en/.
[4]: P. Gacs, M. Hoyrup, C. Rojas.
Randomness on Computable Probability Spaces - A Dynamical Point of View, in: Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science STACS 2009, Freiburg Allemagne, S. Albers, J.-Y. Marion (editors), IBFI Schloss Dagstuhl, February 2009, p. 469-480
http://hal.inria.fr/inria-00360519/en/.
[5]: I. Gnaedig, H. Kirchner.
Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, n^o 2, p. 1–52
http://hal.inria.fr/inria-00182432/en/.
[6]: I. Gnaedig, H. Kirchner.
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations, in: Rewriting, Computation and Proof - Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, Paris, France, H. Comon, C. Kirchner, H. Kirchner (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4600, p. 44-67
http://hal.inria.fr/inria-00182434/en/.
[7]: E. Hainry.
Reachability in linear dynamical systems, in: Computability in Europe Logic and Theory of Algorithms Lecture Notes in Computer Sciences, Grèce Athènes, A. Beckmann, C. Dimitracopoulos, B. Löwe (editors), Springer, 2008, vol. 5028, p. 241-250
http://hal.inria.fr/inria-00202674/en/.
[8]: M. Hoyrup, C. Rojas.
Applications of Effective Probability Theory to Martin-Löf Randomness, in: 36th International Colloquium on Automata, Languages and Programming - ICALP 2009, Grèce Rhodes, S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, W. Thomas (editors), Springer Berlin / Heidelberg, July 2009, vol. 5555, p. 549-561
http://hal.archives-ouvertes.fr/hal-00425560/en/.
[9]: J.-Y. Marion, R. Péchoux.
Sup-interpretations, a semantic method for static analysis of program resources, in: ACM Trans. Comput. Logic, 2009, vol. 10, n^o 4, p. 1–31
http://doi.acm.org/10.1145/1555746.1555751.
[10]: J.-Y. Marion, R. Péchoux.
Analyzing the Implicit Computational Complexity of object-oriented programs, in: Annual Conference on Foundations of Software Technology and Theoretical Computer Science - FSTTCS 2008, Inde Bangalore, V. V. R. Hariharan (editor), Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License: Creative Commons-NC-ND, IARCS, the Indian Association for Research in Computing Science, 2008
http://hal.inria.fr/inria-00332550/en/.

Publications of the year

Articles in International Peer-Reviewed Journal

[11]: P. Baillot, J.-Y. Marion, S. Ronchi Della Rocca.
Guest editorial: Special issue on implicit computational complexity, in: ACM Trans. Comput. Log., 2009, vol. 10, n^o 4
http://doi.acm.org/10.1145/1555746.1555747.
[12]: D. Barth, O. Bournez, O. Boussaton, J. Cohen.
Distributed Learning of Equilibria in a Routing Game, in: Parallel Processing Letters, 2009, vol. 19, p. 189–204
http://dx.doi.org/10.1142/S012962640900016X.
[13]: P. Beaucamps.
Extended recursion-based formalization of virus mutation, in: Journal in Computer Virology, 2009, vol. 5, n^o 3, p. 209-219
http://dx.doi.org/10.1007/s11416-008-0090-4.
[14]: G. Bonfante, Y. Guiraud.
Polygraphic programs and polynomial-time functions, in: Logical Methods in Computer Science (LMCS), 2009, vol. 5, n^o 2:14, p. 1-37
http://hal.inria.fr/inria-00122932/en/.
[15]: G. Bonfante, M. Kaczmarek, J.-Y. Marion.
Architecture of a morphological malware detector, in: Journal in Computer Virology, 2009, vol. 5, n^o 3, p. 263-270
http://hal.inria.fr/inria-00330022/en/.
[16]: I. Gnaedig, H. Kirchner.
Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, n^o 2, p. 1–52
http://hal.inria.fr/inria-00182432/en/.
[17]: J.-Y. Marion.
On tiered small jump operators, in: Logical Methods in Computer Science, 2009, vol. 5, n^o 1
http://arxiv.org/abs/0903.2410.
[18]: J.-Y. Marion, R. Péchoux.
Sup-interpretations, a semantic method for static analysis of program resources, in: ACM Trans. Comput. Logic, 2009, vol. 10, n^o 4, p. 1–31
http://doi.acm.org/10.1145/1555746.1555751.

Invited Conferences

[19]: D. Barth, O. Bournez, O. Boussaton, J. Cohen.
A dynamic approach to load balancing, in: Gamecomm 2009, 2009.

International Peer-Reviewed Conference/Proceedings

[20]: P. Beaucamps, J.-Y. Marion.
On Behavioral Detection, in: Proceedings of EICAR'09, 2009
http://www.loria.fr/~beaucphi/articles/beaucamps-marion-behavioral_detection-eicar09.pdf.
[21]: P. Beaucamps, D. Reynaud, J.-Y. Marion, E. Filiol.
On the Use of Internet Voting on Compromised Computers, in: Proceedings of ICIW'09, 2009
http://www.loria.fr/~beaucphi/articles/beaucamps-reynaud-marion-filiol-internet_voting-iciw09.pdf.
[22]: G. Bonfante, D. Florian, A. Henrot.
Polynomials over the reals are safe for program interpretations, in: Foundational and Practical Aspects of Resource Analysis (FOPARA '09), 2009.
[23]: G. Bonfante, B. Guillaume, M. Morey.
Dependency Constraints for Lexical Disambiguation, in: Proceedings of the 11th International Conference on Parsing Technologies (IWPT'09), Paris, France, Association for Computational Linguistics, October 2009, p. 242–253
http://www.aclweb.org/anthology/W09-3840.
[24]: G. Bonfante, J.-Y. Marion, D. Reynaud.
A computability perspective on self-modifying programs, in: 7th IEEE International Conference on Software Engineering and Formal Methods, Hanoi Viet Nam, November 2009
http://hal.inria.fr/inria-00431667/en/.
[25]: M. Gaboardi, R. Péchoux.
Upper Bounds on Stream I/O Using Semantic Interpretations, in: 23rd international Workshop on Computer Science Logic, CSL 2009, 18th Annual Conference of the EACSL Computer Science Logic, Coimbra Portugal, E. Grädel, R. Kahle (editors), Lecture Notes in Computer Science, Springer, September 2009, vol. 5771, p. 271-286
http://hal.inria.fr/inria-00431469/en/.
[26]: P. Gacs, M. Hoyrup, C. Rojas.
Randomness on Computable Probability Spaces - A Dynamical Point of View, in: Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science STACS 2009, Freiburg Allemagne, S. Albers, J.-Y. Marion (editors), IBFI Schloss Dagstuhl, February 2009, p. 469-480
http://hal.inria.fr/inria-00360519/en/.
[27]: I. Gnaedig.
Termination of Priority Rewriting, in: Third International Conference on Language and Automata Theory and Applications - LATA 2009, Espagne Tarragona, A. H. Dediu, A. M. Ionescu, C. Martin-Vide (editors), Springer, 2009, vol. 5457, p. 386-397
http://hal.inria.fr/inria-00428679/en/.
[28]: W. Gomaa.
A Survey of Recursive Analysis and Moore's Notion of Real Computation, in: Proceedings of Physics and Computation, 2009
http://www.lix.polytechnique.fr/~bournez/PC2009/uploads/Main/WalidGomaaF.pdf.
[29]: W. Gomaa.
Characterizing Polynomial Time Computability of Rational and Real Functions, in: EPTCS - Proceedings of DCM09, 2009, vol. 9, p. 54-64
http://arxiv.org/abs/0911.2325v1, 0911.2325.
[30]: W. Gomaa.
Polynomial Time Computation in the Context of Recursive Analysis, in: Proceedings of FOPARA, 2009.
[31]: W. Guizani, J.-Y. Marion, D. Reynaud.
Server-Side Dynamic Code Analysis, in: 4th International Conference on Malicious and Unwanted Software - Malware 2009, Canada Montréal, IEEE, Fernando C. Colon Osorio, 2009, p. 55-62
http://hal.inria.fr/inria-00425554/en/.
[32]: M. Hoyrup, C. Rojas.
An Application of Martin-Löf Randomness to Effective Probability Theory, in: 5th Conference on Computability in Europe - CiE 2009, Allemagne Heidelberg, K. Ambos-Spies, B. Löwe, W. Merkle (editors), Springer Berlin / Heidelberg, July 2009, vol. 5635, p. 260-269
http://hal.archives-ouvertes.fr/hal-00425556/en/.
[33]: M. Hoyrup, C. Rojas.
Applications of Effective Probability Theory to Martin-Löf Randomness, in: 36th International Colloquium on Automata, Languages and Programming - ICALP 2009, Grèce Rhodes, S. Albers, A. Marchetti-Spaccamela, Y. Matias, S. Nikoletseas, W. Thomas (editors), Springer Berlin / Heidelberg, July 2009, vol. 5555, p. 549-561
http://hal.archives-ouvertes.fr/hal-00425560/en/.

Workshops without Proceedings

[34]: P. Beaucamps, E. Filiol, J.-Y. Marion, D. Reynaud.
On the Impact of Malware on Internet Voting, in: 1st Luxembourg Day on Security and Reliability, Luxembourg Luxembourg, 2009
http://hal.inria.fr/inria-00425584/en/.
[35]: O. Bournez, W. Gomaa, E. Hainry.
Implicit complexity in recursive analysis, in: Tenth International Workshop on Logic and Computational Complexity - LCC'09, États-Unis d'Amérique Los Angeles, 2009
http://hal.inria.fr/inria-00429964/en/.
[36]: W. Gomaa.
Analog Computation and Function Algebras, in: The Science and Philosophy of Unconventional Computing (SPUC09), Cambridge (UK), 2009.
[37]: D. Reynaud, J.-Y. Marion.
Dynamic Binary Instrumentation for Deobfuscation and Unpacking, in: IN-DEPTH SECURITY CONFERENCE 2009 EUROPE, Vienne Autriche, 2009
http://hal.inria.fr/inria-00431666/en/.

Books or Proceedings Editing

[38]: S. Albers, J.-Y. Marion (editors)
26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2009, vol. 09001.

Internal Reports

[39]: O. Bournez, W. Gomaa, E. Hainry.
Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions, Laboratoire d'informatique de l'école polytechnique - LIX - CNRS : UMR7161 - Polytechnique - X - CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Université Henri Poincaré - Nancy I - Université Nancy II - Institut National Polytechnique de Lorraine - Faculty of Engineering, Alexandria University - Alexandria University, 2009
http://hal.inria.fr/inria-00421561/en/, Rapport de recherche.
[40]: I. Gnaedig, H. Kirchner.
Modeling reducibility on ground terms using constraints, CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Université Henri Poincaré - Nancy I - Université Nancy II - Institut National Polytechnique de Lorraine - Centre de Recherche INRIA Bordeaux - Sud-Ouest - INRIA, 2009
http://hal.inria.fr/inria-00387058/en/, Rapport de recherche.
[41]: I. Gnaedig, H. Kirchner.
Proving weak properties of rewriting, CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Université Henri Poincaré - Nancy I - Université Nancy II - Institut National Polytechnique de Lorraine - Centre de Recherche INRIA Bordeaux - Sud-Ouest - INRIA - INRIA, 2009
http://hal.inria.fr/inria-00338181/en/, Research Report.
[42]: E. Hainry.
Decidability and Undecidability in Dynamical Systems, CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Université Henri Poincaré - Nancy I - Université Nancy II - Institut National Polytechnique de Lorraine, 2009
http://hal.inria.fr/inria-00429965/en/, Rapport de recherche.
[43]: J.-Y. Marion, D. Reynaud.
Surfing Code Waves, CARTE - INRIA Lorraine - LORIA - CNRS : UMR7503 - INRIA - Université Henri Poincaré - Nancy I - Université Nancy II - Institut National Polytechnique de Lorraine, 2009
http://hal.inria.fr/inria-00378667/en/, Rapport de recherche.

References in notes

[44]: L. Adleman.
An Abstract Theory of Computer Viruses, in: Advances in Cryptology — CRYPTO'88, Lecture Notes in Computer Science, 1988, vol. 403.
[45]: E. Anshelevich, A. Dasgupta, E. Tardos, T. Wexler.
Near-optimal network design with selfish agents, in: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, ACM Press, 2003, p. 511–520
http://doi.acm.org/10.1145/780542.780617.
[46]: E. Asarin, O. Maler, A. Pnueli.
Reachability analysis of dynamical systems having piecewise-constant derivatives, in: Theoretical Computer Science, February 1995, vol. 138, n^o 1, p. 35–65.
[47]: F. Baader, T. Nipkow.
Term rewriting and all that, Cambridge University Press, New York, NY, USA, 1998.
[48]: D. Barth, O. Bournez, O. Boussaton, J. Cohen.
Convergences et dynamiques du routage dans les réseaux, in: Journées Pôle ResCom, Toulouse France, 2007
http://hal.inria.fr/inria-00182739/en/.
[49]: D. Barth, J. Cohen, L. Echabbi, C. Hamlaoui.
Transit prices negotiation: Combined repeated game and distributed algorithmic approach, in: First EuroFGI International Conference on Network Control and Optimization - NET-COOP 2007 Network Control and Optimization First EuroFGI International Conference, NET-COOP 2007, Avignon, France, June 5-7, 2007. Proceedings Lecture Notes in Computer Science, Avignon France, T. Chahed, B. Tuffin (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2007, vol. 4465, p. 266-275
http://hal.inria.fr/inria-00180914/en/, ISBN 978-3-540-72708-8.
[50]: P. Bell, J.-C. Delvenne, R. Jungers, V. D. Blondel.
The Continuous Skolem-Pisot Problem: On the Complexity of Reachability for Linear Ordinary Differential Equations, 2008
http://arxiv.org/abs/0809.2189.
[51]: L. Blum, M. Shub, S. Smale.
On a theory of computation and complexity over the real numbers; NP completeness, recursive functions and universal machines, in: Bulletin of the American Mathematical Society, July 1989, vol. 21, n^o 1, p. 1–46.
[52]: G. Bonfante, M. Kaczmarek, J.-Y. Marion.
On Abstract Computer Virology from a Recursion Theoretic Perspective, in: Journal in Computer Virology, 2006, vol. 1, n^o 3-4, p. 45-54.
[53]: G. Bonfante, M. Kaczmarek, J.-Y. Marion.
On abstract computer virology: from a recursion-theoretic perspective, in: Journal in Computer Virology, 2006, vol. 1, n^o 3-4.
[54]: O. Bournez, Manuel L. Campagnolo.
A Survey on Continuous Time Computation, in: New Computational Paradigms, B. Cooper (editor), Springer-Verlag, 2008.
[55]: O. Bournez, M. L. Campagnolo.
A Survey on Continuous Time Computation, in: New Computational Paradigms, B. Cooper (editor), Springer, 2007
http://hal.inria.fr/inria-00102948/en/.
[56]: O. Bournez, E. Hainry.
On the Computational Capabilities of Several Models, in: 5th International Conference on Machines, Computations and Universality - MCU 2007 Machines, Computations and Universality 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007. Proceedings Lecture Notes in Computer Science, Orléans France, J. Durand-Lose, M. Margenstern (editors), Lecture Notes in Computer Science, Springer Berlin / Heidelberg, 2007, vol. 4664, p. 12-23
http://hal.inria.fr/inria-00182738/en/, ISBN 978-3-540-74592-1.
[57]: M.G.J. van den. Brand, A. van. Deursen, J. Heering, H.A. de Jong, M. de Jonge, T. Kuipers, P. Klint, L. Moonen, P. Olivier, J. Scheerder, J. Vinju, E. Visser, J. Visser.
The ASF+SDF Meta-Environment: a Component-Based Language Development Environment, in: Compiler Construction (CC '01), R. Wilhelm (editor), Lecture Notes in Computer Science, Springer, 2001, vol. 2027, p. 365–370.
[58]: M. S. Branicky.
Universal computation and other capabilities of hybrid and continuous dynamical systems, in: Theoretical Computer Science, 6 February 1995, vol. 138, n^o 1, p. 67–100.
[59]: M. L. Campagnolo, K. Ojakian.
The methods of approximation and lifting in real computation, in: Third International Conference on Computability and Complexity in Analysis (CCA 2006), 2006.
[60]: M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-Oliet, J. Meseguer, C. Talcott.
The Maude 2.0 System, in: Proceedings of the 14th International Conference on Rewriting Techniques and Applications, R. Nieuwenhuis (editor), Lecture Notes in Computer Science, Springer, June 2003, vol. 2706, p. 76-87.
[61]: F. Cohen.
Computer Viruses, University of Southern California, January 1986, Ph. D. Thesis.
[62]: H. Comon.
Inductionless Induction, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 14, p. 913-962.
[63]: N. Dershowitz, D. Plaisted.
Rewriting, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 9, p. 535-610.
[64]: J. Feigenbaum, C. H. Papadimitriou, S. Shenker.
Sharing the Cost of Multicast Transmissions, in: Journal of Computer and System Sciences, 2001, vol. 63, n^o 1, p. 21–41
http://dx.doi.org/doi:10.1006/jcss.2001.1754.
[65]: E. Filiol.
Les virus informatiques: théorie, pratique et applications, Springer-Verlag France, 2004, Translation.
[66]: E. Filiol.
Computer Viruses: from Theory to Applications, Springer-Verlag, 2005.
[67]: E. Filiol.
Malware Pattern Scanning Schemes Secure Against Black-box Analysis, in: Journal in Computer Virology, 2006, vol. 2, n^o 1, p. 35-50.
[68]: E. Filiol.
Techniques virales avancées, Springer, 2007.
[69]: E. Filiol, G. Jacob, M. Le Liard.
Evaluation methodology and theoretical model for antiviral behavioural detection strategies, in: Journal in Computer Virology, 2007, vol. 3, n^o 1, p. 23-37.
[70]: O. Fissore, I. Gnaedig, H. Kirchner.
Termination of rewriting with local strategies, in: Selected papers of the 4th International Workshop on Strategies in Automated Deduction, M. P. Bonacina, B. Gramlich (editors), Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, 2001, vol. 58.
[71]: O. Fissore, I. Gnaedig, H. Kirchner.
CARIBOO : An induction based proof tool for termination with strategies, in: Proceedings of the Fourth International Conference on Principles and Practice of Declarative Programming, Pittsburgh (USA), ACM Press, October 2002, p. 62–73.
[72]: O. Fissore, I. Gnaedig, H. Kirchner.
Outermost ground termination, in: Proceedings of the Fourth International Workshop on Rewriting Logic and Its Applications, Pisa, Italy, Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, September 2002, vol. 71.
[73]: O. Fissore, I. Gnaedig, H. Kirchner.
A proof of weak termination providing the right way to terminate, in: First International Colloquium on Theoretical Aspect of Computing, Guiyang, China, Lecture Notes in Computer Science, Springer, September 2004, vol. 3407, p. 356-371.
[74]: O. Fissore, I. Gnaedig, H. Kirchner.
CARIBOO, a termination proof tool for rewriting-based programming languages with strategies, Version 1.0, August 2004, Free GPL Licence, APP registration IDDN.FR.001.170013.000.R.P.2005.000.10600.
[75]: O. Fissore, I. Gnaedig, H. Kirchner, L. Moussa.
CARIBOO, a termination proof tool for rewriting-based programming languages with strategies, Version 1.1, December 2005
http://protheo.loria.fr/softwares/cariboo/, Free GPL Licence, APP registration IDDN.FR.001.170013.000.S.P.2005.000.10600.
[76]: I. Gnaedig.
Induction for Positive Almost Sure Termination, in: Proceedings of the Ninth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming, Wroclaw, Poland, ACM Press, July 2007, p. 167–177.
[77]: I. Gnaedig, H. Kirchner.
Computing Constructor Forms with Non Terminating Rewrite Programs, in: Proceedings of the Eighth ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming, Venice, Italy, ACM Press, July 2006, p. 121–132.
[78]: I. Gnaedig, H. Kirchner.
Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, n^o 2, p. 1-52
http://hal.inria.fr/inria-00182432/en/.
[79]: I. Gnaedig, H. Kirchner.
Narrowing, Abstraction and Constraints for Proving Properties of Reduction Relations, in: Rewriting, Computation and Proof - Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, Paris, France, H. Comon, C. Kirchner, H. Kirchner (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4600, p. 44-67
http://hal.inria.fr/inria-00182434/en/.
[80]: E. Hainry.
Computing omega-limit Sets in Linear Dynamical Systems, in: Unconventional Computation, Autriche Vienne, C. S. Calude, J. F. Costa, R. Freund, M. Oswald, G. Rozenberg (editors), Springer, 2008, vol. 5204, p. 83–95
http://hal.inria.fr/inria-00250111/en/.
[81]: E. Hainry.
Reachability in linear dynamical systems, in: Computability in Europe Logic and Theory of Algorithms, Grèce Athènes, A. Beckmann, C. Dimitracopoulos, B. Löwe (editors), Springer, 2008, vol. 5028, p. 241-250
http://hal.inria.fr/inria-00202674/en/.
[82]: M. W. Hirsch, S. Smale, R. Devaney.
Differential Equations, Dynamical Systems, and an Introduction to Chaos, Elsevier Academic Press, 2003.
[83]: S. Kleene.
Introduction to Metamathematics, Van Nostrand, 1952.
[84]: K.-I. Ko.
Complexity Theory of Real Functions, Birkhäuser, 1991.
[85]: D. Lacey, N. D. Jones, E. V. Wyk, C. C. Frederiksen.
Compiler Optimization Correctness by Temporal Logic, in: Higher Order and Symbolic Computation, 2003, vol. 17, p. 173–206.
[86]: M. Ludwig.
The Giant Black Book of Computer Viruses, American Eagle Publications, 1998.
[87]: C.-K. Luk, R. Cohn, R. Muth, H. Patil, A. Klauser, G. Lowney, S. Wallace, K. Hazelwood, V. J. Reddi.
Pin: Building Customized Program Analysis Tools with Dynamic Instrumentation, in: Programming Language Design and Implementation (PLDI), 2005.
[88]: J.-Y. Marion.
Complexité implicite des calculs, de la théorie à la pratique, Université Nancy 2, 2000, Habilitation à diriger les recherches.
[89]: J.-Y. Marion, J.-Y. Moyen.
Efficient first order functional program interpreter with time bound certifications, in: Logic for Programming and Automated Reasoning, 7th International Conference, LPAR 2000, Reunion Island, France, M. Parigot, A. Voronkov (editors), Lecture Notes in Computer Science, Springer, Nov 2000, vol. 1955, p. 25–42.
[90]: J.-Y. Marion, R. Péchoux.
Resource Analysis by Sup-interpretation, in: FLOPS, Lecture Notes in Computer Science, Springer, 2006, vol. 3945, p. 163–176.
[91]: J.-Y. Marion, R. Péchoux.
Analyzing the Implicit Computational Complexity of object-oriented programs, in: FSTTCS, Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, 2008, vol. 08004.
[92]: P. Martin-Löf.
The Definition of Random Sequences, in: Information and Control, 1966, vol. 9, n^o 6, p. 602-619.
[93]: R. McKelvey, A. McLennan.
Computation of equilibria in finite games, in: Handbook of Computational Economics, Elsevier, 1996
https://eprints.kfupm.edu.sa/31257/.
[94]: C. Moore.
Recursion Theory on the Reals and Continuous-Time Computation, in: Theor. Comput. Sci., 1996, vol. 162, n^o 1, p. 23-44.
[95]: P.-E. Moreau, C. Ringeissen, M. Vittek.
A Pattern Matching Compiler for Multiple Target Languages, in: 12th Conference on Compiler Construction, Warsaw (Poland), G. Hedin (editor), LNCS, Springer-Verlag, May 2003, vol. 2622, p. 61–76
http://www.loria.fr/~moreau/Papers/MoreauRV-CC2003.ps.gz.
[96]: B. Morin, L. Mé.
Intrusion detection and virology: an analysis of differences, similarities and complementariness, in: Journal in Computer Virology, 2007, vol. 3, n^o 1, p. 33-49.
[97]: J. D. Murray.
Mathematical Biology. I: An Introduction, in: Biomathematics, Springer Verlag, 2002, vol. 17.
[98]: J. F. Nash.
Equilibrium points in n -person games, in: Proc. of the National Academy of Sciences, 1950, vol. 36, p. 48-49.
[99]: N. Nisan, A. Ronen.
Algorithmic mechanism design (extended abstract), in: Proceedings of the thirty-first annual ACM symposium on Theory of computing, ACM Press, 1999, p. 129–140
http://doi.acm.org/10.1145/301250.301287.
[100]: P. Orponen.
A Survey of Continuous-Time Computation Theory, in: Advances in Algorithms, Languages, and Complexity, D.-Z. Du, K.-I. Ko (editors), Kluwer Academic Publishers, 1997, p. 209-224
http://citeseer.ist.psu.edu/old/orponen97survey.html.
[101]: M. J. Osbourne, A. Rubinstein.
A Course in Game Theory, MIT Press, 1994.
[102]: C. E. Shannon.
Mathematical Theory of the Differential Analyser, in: Journal of Mathematics and Physics MIT, 1941, vol. 20, p. 337-354.
[103]: P. Szor.
The Art of Computer Virus Research and Defense, Addison-Wesley Professional, 2005.
[104]: Terese.
Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2003, n^o 55.
[105]: K. Thompson.
Reflections on Trusting Trust, in: Communication of the ACM, august 1984, vol. 27, p. 761–763, Also appears in ACM Turing Award Lectures: The First Twenty Years 1965-1985.
[106]: J. von Neumann, O. Morgenstern.
Theory of Games and Economic Behavior, First, Princeton University Press, Princeton, New Jersey, 1944.
[107]: J. von Neumann.
Theory of Self-Reproducing Automata, University of Illinois Press, Urbana, Illinois, 1966, edited and completed by A.W.Burks.
[108]: M. Webster, G. Malcolm.
Detection of metamorphic computer viruses using algebraic specification, in: Journal in Computer Virology, 2006, vol. 2, n^o 3, p. 149-161.
[109]: M. Webster, G. Malcolm.
Detection of metamorphic and virtualization-based malware using algebraic specification, in: Journal in Computer Virology, 2009, vol. 5, n^o 3, p. 221-245.
[110]: K. Weihrauch.
Computable Analysis, Springer, 2000.

Logo Inria