Bibliography

Major publications by the team in recent years

• 1O. Bournez, D. Graça, E. Hainry.
  
  Computation with perturbed dynamical systems, in: Journal of Computer and System Sciences, August 2013, vol. 79, n^o 5, pp. 714-724. [ DOI : 10.1016/j.jcss.2013.01.025 ]
  
  http://hal.inria.fr/hal-00861041
• 2N. Fatès, I. Marcovici, S. Taati.
  
  Two-dimensional traffic rules and the density classification problem, in: International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2016, Zürich, France, Lecture Notes of Computer Science, June 2016, vol. 9664. [ DOI : 10.1007/978-3-319-39300-1_11 ]
  
  https://hal.inria.fr/hal-01290290
• 3H. Férée, E. Hainry, M. Hoyrup, R. Péchoux.
  
  Characterizing polynomial time complexity of stream programs using interpretations, in: Journal of Theoretical Computer Science (TCS), January 2015, vol. 585, pp. 41-54. [ DOI : 10.1016/j.tcs.2015.03.008 ]
  
  https://hal.inria.fr/hal-01112160
• 4I. 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
• 5E. Hainry, R. Péchoux.
  
  Objects in Polynomial Time, in: APLAS 2015, Pohang, South Korea, X. Feng, S. Park (editors), Lecture Notes in Computer Science, Springer, November 2015, vol. 9458, pp. 387–404. [ DOI : 10.1007/978-3-319-26529-2_21 ]
  
  https://hal.inria.fr/hal-01206161
• 6M. Hoyrup.
  
  The decidable properties of subrecursive functions, in: International Colloquium on Automata, Languages, and Programming (ICALP) 2016, Rome, Italy, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 12-15, 2016, Rome, Italy, July 2016. [ DOI : 10.4230/LIPIcs.ICALP.2016.108 ]
  
  https://hal.inria.fr/hal-01308224
• 7M. 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
• 8E. 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
• 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
• 10S. Perdrix, Q. Wang.
  
  Supplementarity is Necessary for Quantum Diagram Reasoning *, in: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland, Leibniz International Proceedings in Informatics (LIPIcs), August 2016, vol. 58, pp. 76:1–76:14. [ DOI : 10.4230/LIPIcs.MFCS.2016.76 ]
  
  https://hal.archives-ouvertes.fr/hal-01361419

Publications of the year

Articles in International Peer-Reviewed Journals

• 11G. Bonfante, R. Kahle, J.-Y. Marion, I. Oitavem.
  
  Two function algebras defining functions in NC k boolean circuits, in: Journal of Information and Computation, 2016, accepté à Information and Computation.
  
  https://hal.inria.fr/hal-01113342
• 12M. Hoyrup.
  
  Genericity of weakly computable objects, in: Theory of Computing Systems, December 2016. [ DOI : 10.1007/s00224-016-9737-6 ]
  
  https://hal.inria.fr/hal-01095864
• 13M. Hoyrup, C. Rojas.
  
  On the Information Carried by Programs About the Objects they Compute, in: Theory of Computing Systems, December 2016. [ DOI : 10.1007/s00224-016-9726-9 ]
  
  https://hal.inria.fr/hal-01413066

Invited Conferences

• 14M. Hoyrup.
  
  The Typical Constructible Object, in: Computability In Europe, Paris, France, June 2016, pp. 115 - 123. [ DOI : 10.1007/978-3-319-40189-8_12 ]
  
  https://hal.inria.fr/hal-01396167

International Conferences with Proceedings

• 15P. Arrighi, S. Martiel, S. Perdrix.
  
  Reversible Causal Graph Dynamics, in: Reversible Computation, Bologna, Italy, Lecture Notes in Computer Science, July 2016, vol. 9720, pp. 73-88. [ DOI : 10.1007/978-3-319-40578-0_5 ]
  
  https://hal.archives-ouvertes.fr/hal-01361427
• 16M. Backens, S. Perdrix, Q. Wang.
  
  A Simplified Stabilizer ZX-calculus, in: 13th International Conference on Quantum Physics and Logic, Glasgow, United Kingdom, June 2016, 27 pages.
  
  https://hal.inria.fr/hal-01404591
• 17N. Fatès.
  
  Collective infotaxis with reactive amoebae: a note on a simple bio-inspired mechanism, in: 12th International Conference on Cellular Automata for Research and Industry, ACRI 2016, Fez, Morocco, Lecture Notes of Computer Science, Springer, September 2016, vol. 9863. [ DOI : 10.1007/978-3-319-44365-2_15 ]
  
  https://hal.inria.fr/hal-01327983
• 18N. Fatès, I. Marcovici, S. Taati.
  
  Two-dimensional traffic rules and the density classification problem, in: International Workshop on Cellular Automata and Discrete Complex Systems, AUTOMATA 2016, Zürich, France, Lecture Notes of Computer Science, June 2016, vol. 9664. [ DOI : 10.1007/978-3-319-39300-1_11 ]
  
  https://hal.inria.fr/hal-01290290
• 19M. Hoyrup.
  
  The decidable properties of subrecursive functions, in: International Colloquium on Automata, Languages, and Programming (ICALP) 2016, Rome, Italy, 43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016, July 12-15, 2016, Rome, Italy, July 2016. [ DOI : 10.4230/LIPIcs.ICALP.2016.108 ]
  
  https://hal.inria.fr/hal-01308224
• 20S. Perdrix, Q. Wang.
  
  Supplementarity is Necessary for Quantum Diagram Reasoning *, in: 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland, Leibniz International Proceedings in Informatics (LIPIcs), August 2016, vol. 58, pp. 76:1–76:14. [ DOI : 10.4230/LIPIcs.MFCS.2016.76 ]
  
  https://hal.archives-ouvertes.fr/hal-01361419

Scientific Books (or Scientific Book chapters)

• 21N. Fatès.
  
  Aesthetics and randomness in cellular automata, in: Designing Beauty: The Art of Cellular Automata, A. Adamatzky, G. J. Martínez (editors), Emergence, Complexity and Computation, Springer, 2016. [ DOI : 10.1007/978-3-319-27270-2_23 ]
  
  https://hal.inria.fr/hal-01256384

Scientific Popularization

• 22N. Fatès.
  
  Lettres à Turing : contribution de Nazim Fatès (lettre de Socrate à Turing): Théoreo ! Je vois !, in: Lettres à Turing, ed. Thierry Marchaisse, May 2016, Livre à paraître aux éditions Thierry Marchaisse, sous la direction de Jean-Marc Lévy-Leblond ; parution prévue le 5 mai 2016.
  
  https://hal.inria.fr/hal-01253263

Other Publications

• 23N. Fatès, V. Chevrier, O. Bouré.
  
  Is there a trade-off between simplicity and robustness? Illustration on a lattice-gas model of swarming, February 2016, forthcoming.
  
  https://hal.inria.fr/hal-01230145
• 24H. Godfroy, J.-Y. Marion.
  
  A theory of reflexive computation based on soft intuitionistic logic, October 2016, working paper or preprint.
  
  https://hal.inria.fr/hal-01394263
• 25H. Godfroy, J.-Y. Marion.
  
  Abstract Self Modifying Machines, November 2016, working paper or preprint.
  
  https://hal.inria.fr/hal-01390838
• 26P. Hoyer, M. Mhalla, S. Perdrix.
  
  Contextuality in multipartie pseudo-telepathy graph games, October 2016, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01378413
• 27E. Jeandel.
  
  Aperiodic Subshifts on Polycyclic Groups, August 2016, Previous version had a mistake in the proof of the polycyclic case. The new proof needs a very strong new result by Barbieri and Sablik, that the authors hopes is avoidable.
  
  https://hal.inria.fr/hal-01213364
• 28S. Perdrix, L. Sanselme.
  
  Determinism and Computational Power of Real Measurement-based Quantum Computation, October 2016, working paper or preprint.
  
  https://hal.archives-ouvertes.fr/hal-01377339

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.
• 30P. Arrighi, G. Dowek.
  
  Causal graph dynamics, in: Proceedings of ICALP 2012, Warwick, Springer, July 2012, vol. 7392, pp. 54–66.
• 31E. 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, pp. 35–65.
• 32F. Baader, T. Nipkow.
  
  Term rewriting and all that, Cambridge University Press, New York, NY, USA, 1998.
• 33M. Backens.
  
  The ZX-calculus is complete for stabilizer quantum mechanics, in: New Journal of Physics, 2014, vol. 16, 093021.
• 34P. 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/
• 35P. 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
• 36P. 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
• 37L. 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, pp. 1–46.
• 38G. 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.
• 39M.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.
• 40M. 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, pp. 67–100.
• 41M. 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.
• 42F. Cohen.
  
  Computer Viruses, University of Southern California, January 1986.
• 43H. Comon.
  
  Inductionless Induction, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 14, pp. 913-962.
• 44N. Dershowitz, D. Plaisted.
  
  Rewriting, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 9, pp. 535-610.
• 45A. Edalat, P. Sünderhauf.
  
  A domain-theoretic approach to computability on the real line, in: Theoretical Computer Science, 1999, vol. 210, n^o 1, pp. 73–98.
• 46E. Filiol.
  
  Computer Viruses: from Theory to Applications, Springer-Verlag, 2005.
• 47E. Filiol.
  
  Malware Pattern Scanning Schemes Secure Against Black-box Analysis, in: Journal in Computer Virology, 2006, vol. 2, n^o 1, pp. 35-50.
• 48E. Filiol.
  
  Techniques virales avancées, Springer, 2007.
• 49E. 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, pp. 23-37.
• 50O. 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.
• 51O. 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.
• 52O. 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.
• 53O. 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.
• 54I. 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.
• 55I. Gnaedig, H. Kirchner.
  
  Termination of Rewriting under Strategies, in: ACM Transactions on Computational Logic, 2009, vol. 10, n^o 2, pp. 1-52.
  
  http://hal.inria.fr/inria-00182432/en/
• 56I. 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/
• 57I. 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/
• 58E. 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/
• 59E. 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/
• 60S. Kleene.
  
  Introduction to Metamathematics, Van Nostrand, 1952.
• 61K.-I. Ko.
  
  Complexity Theory of Real Functions, Birkhäuser, 1991.
• 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, n^o 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, n^o 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, n^o 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, n^o 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, n^o 3, pp. 221-245.
• 74K. Weihrauch.
  
  Computable Analysis, Springer, 2000.
• 75C. S. de Witt, V. Zamdzhiev.
  
  The ZX-calculus is incomplete for quantum mechanics, in: EPTCS, 2014, vol. 172, pp. 285–292.
  
  10.4204/EPTCS.172.20.2014
• 76J. von Neumann.
  
  Theory of Self-Reproducing Automata, University of Illinois Press, Urbana, Illinois, 1966, edited and completed by A.W.Burks.