Project-Team Carte
Members
Overall Objectives
Research Program
Application Domains
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub

previous Previous | up Home

Bibliography

Major publications by the team in recent years
  • 1G. Bonfante, J.-Y. Marion, J.-Y. Moyen.
    Quasi-interpretations a way to control resources, in: Theoretical Computer Science, May 2011, vol. 412, no 25, pp. 2776-2796. [ DOI : 10.1016/j.tcs.2011.02.007 ]
    http://hal.inria.fr/hal-00591862/en
  • 2O. Bournez, D. Graça, E. Hainry.
    Computation with perturbed dynamical systems, in: Journal of Computer and System Sciences, August 2013, vol. 79, no 5, pp. 714-724. [ DOI : 10.1016/j.jcss.2013.01.025 ]
    http://hal.inria.fr/hal-00861041
  • 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, pp. 141-150.
    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, Republic of Korea, Jeju Island, Springer, Dec 2010, pp. 291-303.
  • 5H. Férée, M. Hoyrup, W. Gomaa.
    On the query complexity of real functionals, in: LICS - 28th ACM/IEEE Symposium on Logic in Computer Science, New Orleans, United States, January 2013, pp. 103-112. [ DOI : 10.1109/LICS.2013.15 ]
    http://hal.inria.fr/hal-00773653
  • 6I. Gnaedig, H. Kirchner.
    Proving Weak Properties of Rewriting, in: Theoretical Computer Science, 2011, vol. 412, pp. 4405-4438. [ DOI : 10.1016/j.tcs.2011.04.028 ]
    http://hal.inria.fr/inria-00592271/en
  • 7E. Hainry, J.-Y. Marion, R. Péchoux.
    Type-based complexity analysis for fork processes, in: 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS), Rome, Italy, F. Pfenning (editor), Lecture Notes in Computer Science, Springer, 2013, vol. 7794, pp. 305-320. [ DOI : 10.1007/978-3-642-37075-5_20 ]
    http://hal.inria.fr/hal-00755450
  • 8M. Hoyrup.
    Irreversible computable functions, in: STACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014, Lyon, France, March 2014, pp. 362-373.
    https://hal.inria.fr/hal-00915952
  • 9E. Jeandel, P. Vanier.
    Hardness of Conjugacy, Embedding and Factorization of multidimensional Subshifts of Finite Type, in: STACS - 30th International Symposium on Theoretical Aspects of Computer Science, Kiel, Germany, N. Portier, T. Wilke (editors), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, February 2013, vol. 20, pp. 490–501. [ DOI : 10.4230/LIPIcs.STACS.2013.490 ]
    http://hal.inria.fr/hal-00840384
  • 10J.-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, pp. 1–10.
    http://hal.inria.fr/hal-00591853/en
Publications of the year

Doctoral Dissertations and Habilitation Theses

Articles in International Peer-Reviewed Journals

  • 12A. Assaf, A. Díaz-Caro, S. Perdrix, C. Tasson, B. Valiron.
    Call-by-value, call-by-name and the vectorial behaviour of the algebraic λ-calculus, in: Logical Methods in Computer Science, December 2014, vol. 10:4, no 8, 40 p. [ DOI : 10.2168/LMCS-10(4:8)2014 ]
    https://hal.inria.fr/hal-01097602
  • 13G. Bonfante, F. Deloup, A. Henrot.
    Real or Natural numbers interpretations and their effect on complexity, in: Theoretical Computer Science, 2015, 23 p.
    https://hal.archives-ouvertes.fr/hal-01093579
  • 14H. Férée, W. Gomaa, M. Hoyrup.
    Analytical properties of resource-bounded real functionals, in: Journal of Complexity, October 2014, vol. 30, no 5, 33 p. [ DOI : 10.1016/j.jco.2014.02.008 ]
    https://hal.inria.fr/hal-00848482

International Conferences with Proceedings

  • 15B. Bauwens.
    Asymmetry of the Kolmogorov complexity of online predicting odd and even bits, in: STACS - 31th Symposium on Theoretical Aspects of Computer Science - 2014, Lyon, France, March 2014.
    https://hal.inria.fr/hal-00920894
  • 16G. Bonfante, J.-Y. Marion, T. Dinh Ta.
    Malware Message Classification by Dynamic Analysis, in: The 7th International Symposium on Foundations and Practice of Security, Montreal, Canada, Springer, November 2014, vol. 8930, 16 p.
    https://hal.inria.fr/hal-01099692
  • 17D. Cattanéo, S. Perdrix.
    The Parameterized Complexity of Domination-type Problems and Application to Linear Codes, in: Theory and Applications of Models of Computation, Chennai, India, Lecture Notes in Computer Science, April 2014, vol. 8402, pp. 86-103. [ DOI : 10.1007/978-3-319-06089-7_7 ]
    https://hal.archives-ouvertes.fr/hal-00944653
  • 18S. Facchini, S. Perdrix.
    Quantum Circuits for the Unitary Permutation Problem, in: TAMC 2015, Singapore, May 2015.
    https://hal.inria.fr/hal-00994182
  • 19M. Hoyrup.
    Irreversible computable functions, in: STACS - 31st Symposium on Theoretical Aspects of Computer Science - 2014, Lyon, France, March 2014.
    https://hal.inria.fr/hal-00915952
  • 20M. Hoyrup, C. Rojas.
    On the information carried by programs about the objects they compute, in: STACS15, Munich, Germany, March 2015.
    https://hal.inria.fr/hal-01067618
  • 21E. Jeandel.
    Computability of the entropy of one-tape Turing Machines, in: STACS - Symposium on Theoretical Aspects of Computer Science, Lyon, France, E. Mayr, N. Portier (editors), LIPCS, March 2014, vol. 25, pp. 421-432, First version. [ DOI : 10.4230/LIPIcs.STACS.2014.421 ]
    https://hal.inria.fr/hal-00785232
  • 22J.-Y. Marion, R. Péchoux.
    Complexity Information Flow in a Multi-threaded Imperative Language, in: TAMC 2014, Chennai, India, T. V. Gopal, M. Agrawal, A. Li, S. B. Cooper (editors), Theory and Applications of Models of Computation, Springer, April 2014, pp. 124 - 140. [ DOI : 10.1007/978-3-319-06089-7_9 ]
    https://hal.inria.fr/hal-01084043
  • 23R. Péchoux, T. Dinh Ta.
    A Categorical Treatment of Malicious Behavioral Obfuscation, in: TAMC 2014, Chennai, India, T. V. Gopal, M. Agrawal, A. Li, S. B. Cooper (editors), Theory and Applications of Models of Computation., Springer, April 2014, pp. 280 - 299. [ DOI : 10.1007/978-3-319-06089-7_20 ]
    https://hal.inria.fr/hal-01084041

Scientific Books (or Scientific Book chapters)

  • 24G. Bonfante, B. Guillaume, M. Morey, G. Perrier.
    Supertagging with Constraints, in: Constraint and Language, P. Blache, H. Christiansen, V. Dahl, D. Duchier, J. Villadsen (editors), Cambridge Scholar Publishing, 2014.
    https://hal.inria.fr/hal-01097999

Other Publications

References in notes
  • 28L. Adleman.
    An Abstract Theory of Computer Viruses, in: Advances in Cryptology — CRYPTO'88, Lecture Notes in Computer Science, 1988, vol. 403.
  • 29E. Asarin, O. Maler, A. Pnueli.
    Reachability analysis of dynamical systems having piecewise-constant derivatives, in: Theoretical Computer Science, February 1995, vol. 138, no 1, pp. 35–65.
  • 30F. Baader, T. Nipkow.
    Term rewriting and all that, Cambridge University Press, New York, NY, USA, 1998.
  • 31P. 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, pp. 168-182.
    http://hal.inria.fr/inria-00536500/en/
  • 32P. 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, pp. 806-823. [ DOI : 10.1007/978-3-642-33167-1 ]
    http://hal.inria.fr/hal-00762252
  • 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, pp. 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, pp. 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, pp. 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, pp. 76-87.
  • 39F. Cohen.
    Computer Viruses, University of Southern California, January 1986.
  • 40T. Colnaghi, G. M. D'Ariano, S. Facchini, P. Perinotti.
    Quantum computation with programmable connections between gates, in: Physics Letters A, 2012, vol. 376, no 45, pp. 2940 - 2943.
    http://dx.doi.org/10.1016/j.physleta.2012.08.028
  • 41H. Comon.
    Inductionless Induction, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 14, pp. 913-962.
  • 42N. Dershowitz, D. Plaisted.
    Rewriting, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 9, pp. 535-610.
  • 43A. Edalat, P. Sünderhauf.
    A domain-theoretic approach to computability on the real line, in: Theoretical Computer Science, 1999, vol. 210, no 1, pp. 73–98.
  • 44E. Filiol.
    Computer Viruses: from Theory to Applications, Springer-Verlag, 2005.
  • 45E. Filiol.
    Malware Pattern Scanning Schemes Secure Against Black-box Analysis, in: Journal in Computer Virology, 2006, vol. 2, no 1, pp. 35-50.
  • 46E. Filiol.
    Techniques virales avancées, Springer, 2007.
  • 47E. 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, pp. 23-37.
  • 48O. 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.
  • 49O. 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, pp. 62–73.
  • 50O. 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.
  • 51O. 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, pp. 356-371.
  • 52H. Férée, M. Hoyrup, W. Gomaa.
    On the query complexity of real functionals, in: LICS - 28th ACM/IEEE Symposium on Logic in Computer Science, New Orleans, United States, January 2013, pp. 103-112. [ DOI : 10.1109/LICS.2013.15 ]
    http://hal.inria.fr/hal-00773653
  • 53I. 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, pp. 121–132.
  • 54I. Gnaedig, H. Kirchner.
    Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, no 2, pp. 1-52.
    http://hal.inria.fr/inria-00182432/en/
  • 55I. Gnaedig.
    Induction for Positive Almost Sure Termination, in: Proceedings of the 9th ACM-SIGPLAN International Symposium on Principles and Practice of Declarative Programming - PPDP 2007, Wroclaw, Pologne, ACM, 2007, pp. 167-177.
    http://hal.inria.fr/inria-00182435/en/
  • 56I. 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, pp. 44-67.
    http://hal.inria.fr/inria-00182434/en/
  • 57E. 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, pp. 83–95.
    http://hal.inria.fr/inria-00250111/en/
  • 58E. 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, pp. 241-250.
    http://hal.inria.fr/inria-00202674/en/
  • 59S. Kleene.
    Introduction to Metamathematics, Van Nostrand, 1952.
  • 60K.-I. Ko.
    Complexity Theory of Real Functions, Birkhäuser, 1991.
  • 61B. A. Kushner.
    The Constructive Mathematics of A. A. Markov, in: The American Mathematical Monthly, 2006, vol. 113, no 6, pp. 559-566.
    http://www.jstor.org/stable/27641983
  • 62J.-Y. Marion.
    Complexité implicite des calculs, de la théorie à la pratique, Université Nancy 2, 2000, Habilitation à diriger les recherches.
  • 63J.-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, pp. 25–42.
  • 64J.-Y. Marion, R. Péchoux.
    Resource Analysis by Sup-interpretation, in: FLOPS, Lecture Notes in Computer Science, Springer, 2006, vol. 3945, pp. 163–176.
  • 65C. Moore.
    Recursion Theory on the Reals and Continuous-Time Computation, in: Theor. Comput. Sci., 1996, vol. 162, no 1, pp. 23-44.
  • 66P.-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, pp. 61–76.
    http://www.loria.fr/~moreau/Papers/MoreauRV-CC2003.ps.gz
  • 67B. Morin, L. Mé.
    Intrusion detection and virology: an analysis of differences, similarities and complementariness, in: Journal in Computer Virology, 2007, vol. 3, no 1, pp. 33-49.
  • 68P. 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, pp. 209-224.
    http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.1991
  • 69C. E. Shannon.
    Mathematical Theory of the Differential Analyser, in: Journal of Mathematics and Physics MIT, 1941, vol. 20, pp. 337-354.
  • 70Terese.
    Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2003, no 55.
  • 71K. Thompson.
    Reflections on Trusting Trust, in: Communication of the ACM, august 1984, vol. 27, pp. 761–763, Also appears in ACM Turing Award Lectures: The First Twenty Years 1965-1985.
  • 72M. Webster, G. Malcolm.
    Detection of metamorphic computer viruses using algebraic specification, in: Journal in Computer Virology, 2006, vol. 2, no 3, pp. 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, pp. 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