EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1G. Bonfante, M. Kaczmarek, J.-Y. Marion.

    Architecture of a morphological malware detector, in: Journal in Computer Virology, 2009, vol. 5, no 3, p. 263-270. [ DOI : 10.1007/s11416-008-0102-4 ]

    http://hal.inria.fr/inria-00330022/en/
  • 2G. Bonfante, J.-Y. Marion, J.-Y. Moyen.

    Quasi-interpretations a way to control resources, in: Theoretical Computer Science, May 2011, vol. 412, no 25, p. 2776-2796. [ DOI : 10.1016/j.tcs.2011.02.007 ]

    http://hal.inria.fr/hal-00591862/en
  • 3J. Calvet, J. Fernandez, J.-Y. Marion.

    The case for in-the-lab botnet experimentation: creating and taking down a 3000-node botnet, in: Annual Computer Security Applications Conference, Austin, Texas États-Unis, 12 2010.

    http://hal.inria.fr/inria-00536706/en/
  • 4H. Férée, E. Hainry, M. Hoyrup, R. Péchoux.

    Interpretation of stream programs: characterizing type 2 polynomial time complexity, in: 21st International Symposium on Algorithms and Computation - ISAAC 2010, Corée, République De Jeju Island, Springer, Dec 2010.

    http://hal.inria.fr/inria-00518381
  • 5P. 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/
  • 6I. Gnaedig, H. Kirchner.

    Proving Weak Properties of Rewriting, in: Theoretical Computer Science, 2011, vol. 412, p. 4405-4438. [ DOI : 10.1016/j.tcs.2011.04.028 ]

    http://hal.inria.fr/inria-00592271/en
  • 7E. 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/
  • 8M. Hoyrup.

    The dimension of ergodic random sequences, in: STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Paris, France, C. Dürr, T. Wilke (editors), LIPIcs, March 2012, vol. 14, p. 567-576.

    http://hal.inria.fr/hal-00678161
  • 9J.-Y. Marion.

    A type system for complexity flow analysis, in: Twenty-Sixth Annual IEEE Symposium on Logic in Computer Science - LICS 2011, Toronto, Canada, ACM, June 2011, p. 1–10.

    http://hal.inria.fr/hal-00591853/en
  • 10J.-Y. Marion, R. Péchoux.

    Sup-interpretations, a semantic method for static analysis of program resources, in: ACM Trans. Comput. Logic, 2009, vol. 10, no 4, p. 1–31.

    http://doi.acm.org/10.1145/1555746.1555751
Publications of the year

Articles in International Peer-Reviewed Journals

  • 11L. Bienvenu, A. Day, M. Hoyrup, I. Mezhirov, A. Shen.

    A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points, in: Information and Computation, 2012, vol. 210, p. 21-30. [ DOI : 10.1016/j.ic.2011.10.006 ]

    http://hal.inria.fr/hal-00643629
  • 12M. Gaboardi, J.-Y. Marion, S. R. Della Rocca.

    An Implicit Characterization of PSPACE, in: ACM Trans. Comput. Log., October 2012, vol. 13, no 2. [ DOI : 10.1145/2159531.2159540 ]

    http://hal.inria.fr/hal-00763639
  • 13S. Galatolo, M. Hoyrup, C. Rojas.

    Statistical properties of dynamical systems - simulation and abstract computation., in: Chaos, Solitons and Fractals, January 2012, vol. 45, no 1, p. 1-14. [ DOI : 10.1016/j.chaos.2011.09.011 ]

    http://hal.inria.fr/hal-00644790
  • 14M. Hoyrup.

    Computability of the ergodic decomposition, in: Annals of Pure and Applied Logic, November 2012. [ DOI : 10.1016/j.apal.2012.11.005 ]

    http://hal.inria.fr/hal-00746473
  • 15M. Hoyrup, C. Rojas, K. Weihrauch.

    Computability of the Radon-Nikodym derivative., in: Computability, January 2012, vol. 1, no 1, p. 3-13. [ DOI : 10.3233/COM-2012-005 ]

    http://hal.inria.fr/hal-00726044
  • 16J.-Y. Marion.

    From Turing machines to computer viruses, in: Philosophical Transactions A: Mathematical, Physical and Engineering Sciences, 2012, vol. 370, p. 3319-3339. [ DOI : 10.1098/rsta.2011.0332 ]

    http://hal.inria.fr/hal-00762923
  • 17J.-Y. Marion.

    Viruses in Turing's Garden, in: ERCIM News, 2012, vol. 2012, no 91.

    http://hal.inria.fr/hal-00762918
  • 18J.-Y. Marion, T. Schwentick.

    Theoretical Aspects of Computer Science, in: Theory Comput. Syst., 2012, vol. 51, no 2, p. 123-124.

    http://hal.inria.fr/hal-00763646
  • 19R. Péchoux.

    Synthesis of sup-interpretations: a survey, in: Theoretical Computer Science, November 2012, 24 p. [ DOI : 10.1016/j.tcs.2012.11.003 ]

    http://hal.inria.fr/hal-00744915

International Conferences with Proceedings

  • 20P. Beaucamps, I. Gnaedig, J.-Y. Marion.

    Abstraction-based Malware Analysis Using Rewriting and Model Checking, in: ESORICS, Pisa, Italie, S. Foresti, M. Yung (editors), LNCS, Springer, 2012, vol. 7459, p. 806-823. [ DOI : 10.1007/978-3-642-33167-1 ]

    http://hal.inria.fr/hal-00762252
  • 21G. Bonfante, J.-Y. Marion, F. Sabatier, A. Thierry.

    Code synchronization by morphological analysis, in: 7th International Conference on Malicious and Unwanted Software (Malware 2012), IEEE Xplore, October 2012.

    http://hal.inria.fr/hal-00764286
  • 22J. Calvet, J. Fernandez, J.-Y. Marion.

    Aligot: cryptographic function identification in obfuscated binary programs, in: ACM Conference on Computer and Communications Security, Raleigh, États-Unis, 2012, p. 169-182.

    http://hal.inria.fr/hal-00762924
  • 23M. Hoyrup.

    The dimension of ergodic random sequences, in: STACS'12 (29th Symposium on Theoretical Aspects of Computer Science), Paris, France, C. Dürr, T. Wilke (editors), LIPIcs, March 2012, vol. 14, p. 567-576.

    http://hal.inria.fr/hal-00678161

Internal Reports

Scientific Popularization

References in notes
  • 29L. Adleman.

    An Abstract Theory of Computer Viruses, in: Advances in Cryptology — CRYPTO'88, Lecture Notes in Computer Science, 1988, vol. 403.
  • 30E. Asarin, O. Maler, A. Pnueli.

    Reachability analysis of dynamical systems having piecewise-constant derivatives, in: Theoretical Computer Science, February 1995, vol. 138, no 1, p. 35–65.
  • 31F. Baader, T. Nipkow.

    Term rewriting and all that, Cambridge University Press, New York, NY, USA, 1998.
  • 32P. Beaucamps, I. Gnaedig, J.-Y. Marion.

    Behavior Abstraction in Malware Analysis, in: 1st International Conference on Runtime Verification, St. Julians, Malte, G. Rosu, O. Sokolsky (editors), Lecture Notes in Computer Science, Springer-Verlag, August 2010, vol. 6418, p. 168-182.

    http://hal.inria.fr/inria-00536500/en/
  • 33P. 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
  • 34L. 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, no 1, p. 1–46.
  • 35G. Bonfante, M. Kaczmarek, J.-Y. Marion.

    On abstract computer virology: from a recursion-theoretic perspective, in: Journal in Computer Virology, 2006, vol. 1, no 3-4.
  • 36M.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.
  • 37M. S. Branicky.

    Universal computation and other capabilities of hybrid and continuous dynamical systems, in: Theoretical Computer Science, 6 February 1995, vol. 138, no 1, p. 67–100.
  • 38M. 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.
  • 39F. Cohen.

    Computer Viruses, University of Southern California, January 1986.
  • 40H. Comon.

    Inductionless Induction, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 14, p. 913-962.
  • 41N. Dershowitz, D. Plaisted.

    Rewriting, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 9, p. 535-610.
  • 42A. Edalat, P. Sünderhauf.

    A domain-theoretic approach to computability on the real line, in: Theoretical Computer Science, 1999, vol. 210, no 1, p. 73–98.
  • 43E. Filiol.

    Computer Viruses: from Theory to Applications, Springer-Verlag, 2005.
  • 44E. Filiol.

    Malware Pattern Scanning Schemes Secure Against Black-box Analysis, in: Journal in Computer Virology, 2006, vol. 2, no 1, p. 35-50.
  • 45E. Filiol.

    Techniques virales avancées, Springer, 2007.
  • 46E. Filiol, G. Jacob, M. Le Liard.

    Evaluation methodology and theoretical model for antiviral behavioural detection strategies, in: Journal in Computer Virology, 2007, vol. 3, no 1, p. 23-37.
  • 47O. 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.
  • 48O. 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.
  • 49O. 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.
  • 50O. 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.
  • 51I. 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.
  • 52I. 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.
  • 53I. Gnaedig, H. Kirchner.

    Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, no 2, p. 1-52.

    http://hal.inria.fr/inria-00182432/en/
  • 54I. 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/
  • 55E. 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/
  • 56E. 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/
  • 57M. Hoyrup, C. Rojas, K. Weihrauch.

    Computability of the Radon-Nikodym derivative, in: Computability in Europe, Sofia, Bulgarie, B. Löwe, D. Normann, I. Soskov, A. Soskova (editors), LNCS, Springer-Verlag, June 2011, vol. 6735, p. 132-141.

    http://hal.inria.fr/inria-00586740
  • 58S. Kleene.

    Introduction to Metamathematics, Van Nostrand, 1952.
  • 59K.-I. Ko.

    Complexity Theory of Real Functions, Birkhäuser, 1991.
  • 60J.-Y. Marion.

    Complexité implicite des calculs, de la théorie à la pratique, Université Nancy 2, 2000, Habilitation à diriger les recherches.
  • 61J.-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.
  • 62J.-Y. Marion, R. Péchoux.

    Resource Analysis by Sup-interpretation, in: FLOPS, Lecture Notes in Computer Science, Springer, 2006, vol. 3945, p. 163–176.
  • 63C. Moore.

    Recursion Theory on the Reals and Continuous-Time Computation, in: Theor. Comput. Sci., 1996, vol. 162, no 1, p. 23-44.
  • 64P.-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
  • 65B. Morin, L. Mé.

    Intrusion detection and virology: an analysis of differences, similarities and complementariness, in: Journal in Computer Virology, 2007, vol. 3, no 1, p. 33-49.
  • 66P. 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://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.1991
  • 67M. B. Pour-El, J. I. Richards.

    Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
  • 68C. E. Shannon.

    Mathematical Theory of the Differential Analyser, in: Journal of Mathematics and Physics MIT, 1941, vol. 20, p. 337-354.
  • 69 Terese.

    Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2003, no 55.
  • 70K. 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.
  • 71V. V. V'yugin.

    Ergodic Theorems for Individual Random Sequences, in: Theoretical Computer Science, 1998, vol. 207, no 4, p. 343–361.
  • 72M. Webster, G. Malcolm.

    Detection of metamorphic computer viruses using algebraic specification, in: Journal in Computer Virology, 2006, vol. 2, no 3, p. 149-161.
  • 73M. Webster, G. Malcolm.

    Detection of metamorphic and virtualization-based malware using algebraic specification, in: Journal in Computer Virology, 2009, vol. 5, no 3, p. 221-245.
  • 74K. Weihrauch.

    Computable Analysis, Springer, 2000.
  • 75J. von Neumann.

    Theory of Self-Reproducing Automata, University of Illinois Press, Urbana, Illinois, 1966, edited and completed by A.W.Burks.


previous Previous | up Home