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, W. Gomaa.
  On the extension of computable real functions, in: 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2017, Reykjavik, Iceland, June 20-23, 2017, IEEE Computer Society, 2017, pp. 1–12.
  https://doi.org/10.1109/LICS.2017.8005067
• 7M. 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
• 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

• 11S. Abramsky, R. Soares Barbosa, G. Carù, S. Perdrix.
  A complete characterisation of All-versus-Nothing arguments for stabiliser states, in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, October 2017, vol. 375, n^o 2106, https://arxiv.org/abs/1705.08459. [ DOI : 10.1098/rsta.2016.0385 ]
  https://hal.inria.fr/hal-01528687
• 12L. Bienvenu, M. Hoyrup, A. Shen.
  Layerwise Computability and Image Randomness, in: Theory of Computing Systems, November 2017, vol. 61, n^o 4, pp. 1353-1375. [ DOI : 10.1007/s00224-017-9791-8 ]
  https://hal.inria.fr/hal-01650910
• 13M. Hoyrup.
  Genericity of weakly computable objects, in: Theory of Computing Systems, April 2017, vol. 60, n^o 3. [ DOI : 10.1007/s00224-016-9737-6 ]
  https://hal.inria.fr/hal-01095864
• 14M. Hoyrup, C. Rojas.
  On the Information Carried by Programs About the Objects they Compute, in: Theory of Computing Systems, November 2017. [ DOI : 10.1007/s00224-016-9726-9 ]
  https://hal.inria.fr/hal-01413066

International Conferences with Proceedings

• 15A. Anshu, P. Hoyer, M. Mhalla, S. Perdrix.
  Contextuality in multipartie pseudo-telepathy graph games, in: FCT’17- 21st International Symposium on Fundamentals of Computation Theory, Bordeaux, France, Lecture Notes in Computer Science, September 2017, vol. 10472, pp. 41-55, https://arxiv.org/abs/1609.09689. [ DOI : 10.1007/978-3-662-55751-8_5 ]
  https://hal.archives-ouvertes.fr/hal-01378413
• 16M. Couceiro, P. Mercuriali, R. Péchoux, A. Saffidine.
  Median based calculus for lattice polynomials and monotone Boolean functions, in: ISMVL 2017 - 47th IEEE International Symposium on Multiple-Valued Logic, Novi Sad, Serbia, IEEE Computer Society, May 2017, 6 p.
  https://hal.inria.fr/hal-01504010
• 17N. A. Fatès.
  Diploid Cellular Automata: First Experiments on the Random Mixtures of Two Elementary Rules, in: AUTOMATA 2017 - 23th International Workshop on Cellular Automata and Discrete Complex Systems, Milan, Italy, A. Dennunzio, E. Formenti, L. Manzoni, A. E. Porreca (editors), Cellular Automata and Discrete Complex Systems, Springer International Publishing, June 2017, vol. 10248, pp. 97-108, Part 2: Regular Papers. [ DOI : 10.1007/978-3-319-58631-1_8 ]
  https://hal.inria.fr/hal-01656351
• 18E. Hainry, R. Péchoux.
  Higher-order interpretations for higher-order complexity, in: LPAR 2017 - International Conferences on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, T. Eiter, D. Sands (editors), LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Geoff Sutcliffe, May 2017, vol. 46, pp. 269-285.
  https://hal.inria.fr/hal-01529170
• 19M. Hoyrup, W. Gomaa.
  On the extension of computable real functions, in: Logic In Computer Science (LICS), Reykjavik, Iceland, June 2017.
  https://hal.inria.fr/hal-01494332
• 20E. Jeandel.
  Enumeration reducibility in closure spaces with applications to logic and algebra, in: Logic in Computer Science (LICS), reyjkavik, Iceland, 2017.
  https://hal.inria.fr/hal-01652505
• 21E. Jeandel, S. Perdrix, R. Vilmart.
  Y-Calculus: A language for real Matrices derived from the ZX-Calculus, in: International Conference on Quantum Physics and Logics (QPL), Nijmegen, Netherlands, 2017, https://arxiv.org/abs/1702.00934.
  https://hal.archives-ouvertes.fr/hal-01445948
• 22E. Jeandel, S. Perdrix, R. Vilmart, Q. Wang.
  ZX-Calculus: Cyclotomic Supplementarity and Incompleteness for Clifford+T quantum mechanics, in: MFCS 2017 - 42nd International Symposium on Mathematical Foundations of Computer Science, Aalborg, Denmark, August 2017, 15 p, https://arxiv.org/abs/1702.01945.
  https://hal.archives-ouvertes.fr/hal-01445707
• 23S. Perdrix, L. Sanselme.
  Determinism and Computational Power of Real Measurement-based Quantum Computation, in: FCT'17- 21st International Symposium on Fundamentals of Computation Theory, Bordeaux, France, September 2017, https://arxiv.org/abs/1610.02824. [ DOI : 10.1007/978-3-662-55751-8_31 ]
  https://hal.archives-ouvertes.fr/hal-01377339

National Conferences with Proceedings

• 24M. Couceiro, P. Mercuriali, R. Péchoux.
  On the efficiency of normal form systems of Boolean functions, in: LFA 2017 - 26èmes Rencontres Francophones sur la Logique Floue et ses Applications, Amiens, France, October 2017, pp. 1-8.
  https://hal.inria.fr/hal-01656033

Conferences without Proceedings

• 25S. Abramski, R. Soares Barbosa, G. Carù, S. Perdrix.
  A complete characterisation of All-versus-Nothing arguments for stabiliser states, in: 14th International Conference on Quantum Physics and Logic (QPL), Nijmegen, Netherlands, July 2017.
  https://hal.inria.fr/hal-01653557
• 26E. Hainry, R. Péchoux.
  Higher order interpretations for higher order complexity, in: 8th Workshop on Developments in Implicit Computational complExity and 5th Workshop on Foundational and Practical Aspects of Resource Analysis, Uppsala, Sweden, April 2017.
  https://hal.inria.fr/hal-01653659

Scientific Popularization

• 27N. A. Fatès.
  Le dire mathématique, CNRS, 2017, article pour le site Images des mathématiques.
  https://hal.inria.fr/hal-01653646

Other Publications

• 28M. Backens, S. Perdrix, Q. Wang.
  Towards a Minimal Stabilizer ZX-calculus, September 2017, https://arxiv.org/abs/1709.08903 - 13+15 pages.
  https://hal.inria.fr/hal-01597114
• 29M. Couceiro, P. Mercuriali, R. Péchoux.
  Comparing the efficiency of normal form systems to represent Boolean functions, June 2017, working paper or preprint.
  https://hal.inria.fr/hal-01551761
• 30N. Fatès, V. Chevrier, O. Bouré.
  Is there a trade-off between simplicity and robustness? Illustration on a lattice-gas model of swarming, 2018, TO APPEAR in 2018 in a monography with ISBN 978-3-319-65556-7.
  https://hal.inria.fr/hal-01230145
• 31N. A. Fatès.
  Asynchronous cellular automata [encyclopedia entry], December 2017, This text has been proposed for the Encyclopedia of Complexity and Systems Science edited by Springer Nature and should appear in 2018..
  https://hal.inria.fr/hal-01653675
• 32N. A. Fatès.
  Remarks on the cellular automaton global synchronisation problem – deterministic vs. stochastic models, December 2017, working paper or preprint.
  https://hal.inria.fr/hal-01653631
• 33N. Fatès, B. Sethi, S. Das.
  On the reversibility of ECAs with fully asynchronous updating: the recurrence point of view, August 2017, To appear in a monography edited by Andrew Adamatzky.
  https://hal.inria.fr/hal-01571847
• 34J. Francès de Mas.
  Coalescence in fully asynchronous elementary cellular automata, Université de Lorraine (Nancy), June 2017.
  https://hal.inria.fr/hal-01627454
• 35M. Hoyrup.
  Results in descriptive set theory on some represented spaces, December 2017, working paper or preprint.
  https://hal.inria.fr/hal-01657883
• 36E. Jeandel.
  Surjective Cellular Automata of neighborhood size at most 6, 2017, Data files.
  https://hal.inria.fr/hal-01583896
• 37E. Jeandel, S. Perdrix, R. Vilmart.
  A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics, May 2017, working paper or preprint.
  https://hal.archives-ouvertes.fr/hal-01529623
• 38Q. Ladeveze.
  Infotaxie collective : coordonner une équipe d'agents pour trouver une source, Université de Lorraine (Nancy), June 2017, Rapport de stage de Licence 3.
  https://hal.inria.fr/hal-01575568

References in notes

• 39E. 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.
• 40F. Baader, T. Nipkow.
  Term rewriting and all that, Cambridge University Press, New York, NY, USA, 1998.
• 41P. 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/
• 42P. 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
• 43J. S. Bell.
  On the problem of hidden variables in quantum mechanics, in: Rev. Mod. Phys., 1966, vol. 38, pp. 447-452.
• 44P. 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
• 45L. 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.
• 46M.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.
• 47M. 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.
• 48D. E. Browne, E. Kashefi, M. Mhalla, S. Perdrix.
  Generalized Flow and Determinism in Measurement-based Quantum Computation, in: New Journal of Physics (NJP), 2007, vol. 9, n^o 8.
  http://iopscience.iop.org/1367-2630/9/8/250/fulltext/
• 49M. 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.
• 50H. Comon.
  Inductionless Induction, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 14, pp. 913-962.
• 51V. Danos, E. Kashefi.
  Determinism in the one-way model, in: Physical Review A, 2006, vol. 74, n^o 052310.
• 52N. Dershowitz, D. Plaisted.
  Rewriting, in: Handbook of Automated Reasoning, A. Robinson, A. Voronkov (editors), Elsevier Science, 2001, vol. I, chap. 9, pp. 535-610.
• 53A. 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.
• 54O. 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.
• 55O. 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.
• 56O. 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.
• 57O. 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.
• 58I. 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.
• 59I. 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/
• 60I. 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/
• 61I. 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/
• 62E. 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/
• 63E. 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/
• 64K.-I. Ko.
  Complexity Theory of Real Functions, Birkhäuser, 1991.
• 65S. Kochen, E. P. Specker.
  , The Problem of Hidden Variables in Quantum MechanicsC. A. Hooker (editor), Springer Netherlands, Dordrecht, 1975, pp. 293–328.
  https://doi.org/10.1007/978-94-010-1795-4_17
• 66J.-Y. Marion.
  Complexité implicite des calculs, de la théorie à la pratique, Université Nancy 2, 2000, Habilitation à diriger les recherches.
• 67J.-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.
• 68J.-Y. Marion, R. Péchoux.
  Resource Analysis by Sup-interpretation, in: FLOPS, Lecture Notes in Computer Science, Springer, 2006, vol. 3945, pp. 163–176.
• 69M. Mhalla, S. Perdrix.
  Finding Optimal Flows Efficiently, in: the 35th International Colloquium on Automata, Languages and Programming (ICALP), LNCS, 2008, vol. 5125, pp. 857-868.
• 70C. Moore.
  Recursion Theory on the Reals and Continuous-Time Computation, in: Theor. Comput. Sci., 1996, vol. 162, n^o 1, pp. 23-44.
• 71P.-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
• 72P. 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
• 73S. 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
• 74R. Raussendorf, H. J. Briegel.
  A one-way quantum computer, in: Phys. Rev. Lett., 2001, vol. 86, pp. 5188-5191.
• 75C. E. Shannon.
  Mathematical Theory of the Differential Analyser, in: Journal of Mathematics and Physics MIT, 1941, vol. 20, pp. 337-354.
• 76Terese.
  Term Rewriting Systems, Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2003, n^o 55.
• 77M. 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.
• 78M. 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.
• 79K. Weihrauch.
  Computable Analysis, Springer, 2000.