{"id":939,"date":"2017-08-27T12:58:44","date_gmt":"2017-08-27T15:58:44","guid":{"rendered":"http:\/\/www.infinis.org\/?page_id=939"},"modified":"2026-04-17T05:53:52","modified_gmt":"2026-04-17T08:53:52","slug":"co-publications","status":"publish","type":"page","link":"http:\/\/www.irp-sinfin.org\/?page_id=939","title":{"rendered":"Co-publications"},"content":{"rendered":"

In this page we detail only the co-publications, that is, publications co-authored by both Argentinean and French members of SINFIN (and previously, INFINIS).<\/p>\n

Information for members:<\/strong> Please acknowledge the IRP in your publications with the following text \u00abThis work was partially\/fully funded by the French-Argentinian IRP SINFIN.\u00bb<\/p>\n

Book chapters<\/strong><\/p>\n

    \n
  1. Ver\u00f3nica Becher and Olivier Carton. Normal numbers and computer science<\/a>. Chapter of Sequences, Groups and Number Theory, ed: Val\u00e9rie Berth\u00e9 and Michel Rig\u00f3. Trends in Mathematics Series. Birkhauser\/Springer, 2018.<\/li>\n
  2. Eda Cesaratto and Brigitte Vall\u00e9e. Pseudo-randomness of a random Kronecker sequence. An instance of dynamical analysis<\/a>. Chapitre 11 (pp 405-448) in Combinatorics, Words and Symbolic Dynamics, Encyclopedia of mathematics and its applications 159, ed: M. Rigo et V. Berth\u00e9. Cambridge University Press, 2016.<\/li>\n
  3. Carlos Areces, Pascal Fontaine, and Stephan Merz. Modal Satisfiability via SMT Solving<\/a>. In R. De Nicola, and R. Hennicker, editors, Software, Services, and Systems, LNCS 8950, pp. 30-45. Springer International Publishing, 2015.<\/li>\n
  4. Philippe Clauss, Diego Gabervetsky, Vincent Loechner, and Sven Verdoolaege. Polyhedral Techniques for Parametric Memory Requirement Estimation<\/a>. Chapter of Energy Aware Memory Management for Embedded Multimedia Systems : a Computer-Aided Design Approach, ed: Florin Balasa. Chapman & Hall\/CRC Press, 2011.<\/li>\n<\/ol>\n

    Editorial<\/strong><\/p>\n

      \n
    1. Alejandro D\u00edaz-Caro, Ognyan Oreshkov, and Ana Bel\u00e9n Sainz. Proceedings of the 22nd Conference on Quantum Physics and Logic<\/a>. Electronic Proceedings in Theoretical Computer Science 426, 2025.<\/li>\n
    2. Alejandro D\u00edaz-Caro and Vladimir Zamdzhiev. Proceedings of the 21st International Conference on Quantum Physics and Logic<\/a>. Electronic Proceedings in Theoretical Computer Science 406, 2024.<\/li>\n
    3. Fr\u00e9d\u00e9rique Bassino, Flavia Bonomo-Braberman, Lionel Pournin, and Mario Valencia-Pabon. LAGOS\u201917: IX Latin and American Algorithms, Graphs and Optimization Symposium, C.I.R.M., Marseille, France<\/a> – 2017<\/em>. Special Issue of Discrete Applied Mathematics. Volume 281, 2020.<\/li>\n
    4. Ver\u00f3nica Becher, Laurent Bienvenu, Rodney Downey, and Elvira Mayordomo. Report from Dagstuhl Seminar Computability, Complexity and Randomness 2012<\/a>. Schloss Dagstuhl, Seminar 12021, January 8-13, 2012.<\/li>\n<\/ol>\n

      Journal publications<\/strong><\/p>\n

        \n
      1. Alejandro D\u00edaz-Caro, Malena Ivnisky, and Octavio Malherbe. An Algebraic Extension of Intuitionistic Linear Logic: The LS!-Calculus and Its Categorical Model<\/a>. Journal of Logic and Computation 35(8):exaf053, 2025<\/li>\n
      2. Ver\u00f3nica Becher, Olivier Carton, and Santiago Figueira. Rauzy complexity and block entropy<\/a>. Information and Computation 306:105330, 2025.<\/li>\n
      3. Ver\u00f3nica Becher and Olivier Carton. Nested perfect arrays<\/a>. IEEE Transactions on Information Theory 70(10):7463-7471, 2024.<\/li>\n
      4. Alejandro D\u00edaz-Caro and Gilles Dowek. A linear linear lambda-calculus<\/a>. Mathematical Structures in Computer Science 34(10):1103-1137, 2024.<\/li>\n
      5. Agustina Ledezma, Adrian Pastine, Pablo Torres, Mario Valencia-Pabon. On the diameter of Schrijver graphs<\/a>. Discrete Applied Mathematics 350:15-30, 2024.<\/li>\n
      6. Alejandro D\u00edaz-Caro and Gilles Dowek. Extensional proofs in a propositional logic modulo isomorphisms<\/a>. Theoretical Computer Science 977:114172, 2023.<\/li>\n
      7. Ver\u00f3nica Becher, Agust\u00edn Marchionna, and G\u00e9rald Tenenbaum. On simply normal numbers with digit dependencies<\/a>. Mathematica 69(4):988-991, 2023.<\/li>\n
      8. Antonio Bucciarelli, Delia Kesner, Alejandro R\u00edos, and Andr\u00e9s Viso. The Bang Calculus Revisited<\/a>. Information and Computation 293:105047, 2023.<\/li>\n
      9. Bartosz Bednarczyk, St\u00e9phane Demri, Raul Fervari, and Alessio Mansutti. On Composing Finite Forests with Modal Logics<\/a>. ACM Transactions on Computational Logic 24(2:12):1-46, 2023.<\/li>\n
      10. Alejandro D\u00edaz-Caro and Gilles Dowek. A new connective in Natural Deduction, and its application to quantum computing<\/a>. Theoretical Computer Science 957:113840, 2023.<\/li>\n
      11. Val\u00e9rie Berth\u00e9, Eda Cesaratto, Pablo Rotondo, and Mart\u00edn Dar\u00edo Safe. Lochs-type theorems beyond positive entropy<\/a>. Monatshefte f\u00fcr Mathematik 200:737-779, 2023.<\/li>\n
      12. Ver\u00f3nica Becher and Serge Grigorieff. Randomness and uniform distribution modulo one<\/a>. Information and Computation 285(B):104857, 2022.<\/li>\n
      13. Luciano Grippo, Adri\u00e1n Pastine, Pablo Torres, Mario Valencia-Pabon, Juan Vera. On the P\u2083-hull number of Kneser graphs<\/a>. The Electronic Journal of Combinatorics, 28(3) P3.32, 2021.<\/li>\n
      14. St\u00e9phane Demri, Ra\u00fal Fervari, and Alessio Mansutti. Internal Proof Calculi for Modal Logics with Separating Conjunction<\/a>. Journal of Logic and Computation, exab016, 2021.<\/li>\n
      15. Eda Cesaratto and Brigitte Vall\u00e9e. Gaussian behavior of quadratic irrationals<\/a>. Acta Arithmetica 197:159-205, 2021.<\/li>\n
      16. Olivier Carton and Elisa Orduna. Preservation of normality by transducers<\/a>. Information and Computation, In Press, 2020.<\/li>\n
      17. Flavia Bonomo-Braberman, Guillermo Dur\u00e1n, Mart\u00edn D. Safe, and Annegret K. Wagler. On graph classes related to perfect graphs: A survey<\/a>. Discrete Applied Mathematics 281:42-60, 2020.<\/li>\n
      18. Nicol\u00e1s Alvarez, and Olivier Carton. On Normality in Shifts of Finite Type<\/a>. Theory Computing Systems 64:783\u2013798, 2020.<\/li>\n
      19. St\u00e9phane Demri and Raul Fervari. The Power of Modal Separation Logics<\/a>. Journal of Logic and Computation 29(8):1139\u20131184, 2019.<\/li>\n
      20. Flavia Bonomo-Braberman, Mitre C. Dourado, Mario Valencia-Pabon, and Juan C. Vera. A note on homomorphisms of Kneser hypergraphs<\/a>. Applied Mathematics and Computation 366:124764, 2019.<\/li>\n
      21. Ver\u00f3nica Becher and Olivier Carton. Normal numbers and nested perfect necklaces<\/a>. Journal of Complexity 54:101403, 2019.<\/li>\n
      22. Ver\u00f3nica Becher, Olivier Carton, and Ignacio Mollo Cunningham. Low discrepancy sequences failing Poissonian pair correlations<\/a>. Archiv der Mathematik 113(2):169\u2013178, 2019.<\/li>\n
      23. Alejandro D\u00edaz-Caro, Gilles Dowek, and Juan Pablo Rinaldi. Two linearities for quantum computing in the lambda calculus<\/a>. BioSystems 186:104012, 2019.<\/li>\n
      24. Nicol\u00e1s Alvarez, Ver\u00f3nica Becher, and Olivier Carton. Finite-state independence and normal sequences<\/a>. Journal of Computer and System Sciences 103:1-17, 2019.<\/li>\n
      25. Christoph Aistleitner, Ver\u00f3nica Becher, and Olivier Carton. Normal numbers with digit dependencies<\/a>. Transactions of American Mathematical Society 372(6):4425-4446, 2019.<\/li>\n
      26. Guido Chari, Diego Garbervetsky, Stefan Marr, and Stephane Ducasse. Fully Reflective Execution Environments: Virtual Machines for More Flexible Software<\/a>. IEEE Transactions on Software Engineering 45(9):858-876, 2018.<\/li>\n
      27. Flavia Bonomo, Ivo Koch, Pablo Torres, and Mario Valencia-Pabon. k-tuple colorings of the cartesian product of graphs<\/a>. Discrete Applied Mathematics 245:177-182, 2018.<\/li>\n
      28. Ver\u00f3nica Becher, Olivier Carton, and Pablo Ariel Heiber. Finite-state independence<\/a>. Theory of Computing Systems 62(7):1555-1572, 2018.<\/li>\n
      29. Pablo Torres and Mario Valencia-Pabon. Shifts of the stable Kneser graphs and hom-idempotence<\/a>. European Journal of Combinatorics 62:50-57, 2017.<\/li>\n
      30. Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro R\u00edos. On abstract normalisation beyond neededness<\/a>. Theoretical Computer Science. 672:36-63, 2017.<\/li>\n
      31. Pablo Arrighi, Alejandro D\u00edaz-Caro, and Beno\u00eet Valiron. The vectorial \u03bb-calculus<\/a>. Information and Computation 254(1):105-139, 2017.<\/li>\n
      32. Pablo Torres and Mario Valencia-Pabon. The packing chromatic number of hypercubes<\/a>. Discrete Applied Mathematics 190-191:127-140, 2015.<\/li>\n
      33. Liliana Alc\u00f3n, Flavia Bonomo, Guillermo Dur\u00e1n, Marisa Gutierrez, Maria Pia Mazzoleni, Bernard Ries, and Mario Valencia-Pabon. On the bend number of circular-arc graphs as edge intersection graphs of paths on a grid<\/a>. Electronic Notes in Discrete Mathematics 50:249-254, 2015.<\/li>\n
      34. Ver\u00f3nica Becher, Olivier Carton, and Pablo Ariel Heiber. Normality and automata<\/a>. Journal of Computer and System Sciences. 81(8): 1592-1613, 2015.<\/li>\n
      35. Ver\u00f3nica Becher and Serge Grigorieff. Borel and Hausdorff hierarchies in topological spaces of Choquet games and their effectivization<\/a>. Mathematical Structures in Computer Science, 25(7): 1490-1519, 2015.<\/li>\n
      36. Ver\u00f3nica Becher and Serge Grigorieff. Wadge hardness in Scott spaces and its effectivization<\/a>. Mathematical Structures in Computer Science, 25(7): 1520-1545, 2015.<\/li>\n
      37. Flavia Bonomo, Ivo Koch, Pablo Torres, and Mario Valencia-Pabon. K-tuple chromatic number of the cartesian product of graphs<\/a>. Electronic Notes in Discrete Mathematics 50, 243-248, 2015.<\/li>\n
      38. Flavia Bonomo, Guillermo Dur\u00e1n, and Mario Valencia-Pabon. Complexity of the cluster deletion problem on subclasses of chordal graphs<\/a>. Theoretical Computer Science 600: 59-69, 2015.<\/li>\n
      39. Flavia Bonomo, Dur\u00e1n Guillermo, Amedeo Napoli, and Mario Valencia-Pabon. A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to P4-sparse graphs<\/a>. Information Processing Letters 115 (6-8): 600-603, 2015.<\/li>\n
      40. Flavia Bonomo, Oliver Schaudt, Maya Jakobine Stein, and Mario Valencia-Pabon. b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs<\/a>. Algorithmica 73(2): 289-305, 2015.<\/li>\n
      41. Olivier Carton and Pablo Ariel Heiber. Normality and two-way automata<\/a>. Information and Computation. 241: 264-276, 2015.<\/li>\n
      42. Eda Cesaratto, Brigitte Vall\u00e9e. Gaussian Distribution of Trie Depth for Strongly Tame Sources<\/a>. Combinatorics, Probability and Computing, 24(3) : 54-103, 2015.<\/li>\n
      43. Diego Figueira, Santiago Figueira, and Carlos Areces. Model Theory of XPath on Data Trees. Part I: Bisimulation and Characterization<\/a>. Journal of Artificial Intelligence Research 53:271-314, 2015.<\/li>\n
      44. Ali Assaf, Alejandro D\u00edaz-Caro, Simon Perdrix, Christine Tasson, and Beno\u00eet Valiron. Call-by-value, call-by-name and the vectorial behaviour of the algebraic \u03bb-calculus<\/a>. Logical Methods in Computer Science 10(4:8), 2014.<\/li>\n
      45. Flavia Bonomo and Mario Valencia-Pabon. On the Minimum Sum Coloring of P4-sparse graphs<\/a>. Graphs and Combinatorics 30(2):303-314, 2014.<\/li>\n
      46. V\u0131ctor Braberman, Diego Garbervetsky, Samuel Hym, and Sergio Yovine. Summary based inference of quantitative bounds of live heap objects<\/a>. Science of Computer Programming 92(A):56-84, 2014.<\/li>\n
      47. Flavia Bonomo, Denis Cornaz, Tinaz Ekim, and Bernard Ries. Perfectness of clustered graphs<\/a>. Discrete Optimization 10:296-303, 2013.<\/li>\n
      48. Ver\u00f3nica Becher and Serge Grigorieff. From index sets to randomness in the n-th jump of the halting problem: Random reals and possibly infinite computations part II<\/a>. Journal of Symbolic Logic, 74(1):124-156, 2009.<\/li>\n
      49. Ver\u00f3nica Becher and Serge Grigorieff. Random reals \u00e0 la Chaitin with or without prefix freeness<\/a>. Theoretical Computer Science 385(1-3):193-201, 2007.<\/li>\n
      50. Ver\u00f3nica Becher, Santiago Figueira, Serge Grigorieff, and Joseph S. Miller. Randomness and halting probabilities<\/a>. Journal of Symbolic Logic 71(4):1411-1430, 2006.<\/li>\n
      51. Ver\u00f3nica Becher and Serge Grigorieff. Random reals and possibly infinite computations. Part I: Randomness in the Halting Problem<\/a>. Journal of Symbolic Logic 70(3):891-913, 2005.<\/li>\n
      52. Ver\u00f3nica Becher and Serge Grigorieff. Recursion and topology on the space of finite and infinite words for possibly infinite computations<\/a>. Theoretical Computer Science, 322(1):85-136, 2004.<\/li>\n<\/ol>\n

        Peer-reviewed international conference publications<\/strong><\/p>\n

          \n
        1. Diego Figueira, Santiago Figueira, and Yoshiki Nakamura. Guarded Negation Transitive Closure<\/a>. In: Forty-First Annual Symposium on Logic in Computer Science (LICS), 2026 (to appear).<\/li>\n
        2. Pablo Barenbaum, Delia Kesner, and Mariana Milicich. Useful Call-by-Value: A Semantic Interpretation via Quantitative Types<\/a>. In: The 34th EACSL Annual Conference on Computer Science Logic (CSL). LIPIcs 363, 47:1-47:24, 2026.<\/li>\n
        3. St\u00e9phane Demri, Laurent Doyen, and Raul Fervari. Knowing-How Reasoning with Budgets Recasted: Universal Reachability Problem on VASS<\/a>. In: The 19th International Conference on Reachability Problems (RP 2025), to appear.<\/li>\n
        4. Kinari Dave, Alejandro D\u00edaz-Caro, and Vladimir Zamdzhiev. IMALL with a Mixed-State Modality: A Logical Approach to Quantum Computation<\/a>. In: The 23rd Asian Symposium on Programming Languages and Systems (APLAS 2025) – LNCS 16201:131-150, 2025.<\/li>\n
        5. St\u00e9phane Demri and Raul Fervari. On the Effects of Adding Assignments in Linear-Time Temporal Logics Modulo Theories. In: 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025), to appear.<\/li>\n
        6. Pablo Barenbaum, Delia Kesner, and Mariana Milicich. Hybrid Intersection Types for PCF<\/a>. In: 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2024), EPiC Series in Computing 100:181-197, 2024.<\/li>\n
        7. Alejandro D\u00edaz-Caro, Gilles Dowek, Malena Ivnisky, and Octavio Malherbe. A linear proof language for second-order intuitionistic linear logic<\/a>. In: 30th Workshop on Logic, Language, Information and Computation (WoLLIC 2024), LNCS 14672:18-35, 2024.<\/li>\n
        8. St\u00e9phane Demri and Raul Fervari. Model-Checking for Ability-Based Logics with Constrained Plans<\/a>. In: 37th AAAI Conference on Artificial Intelligence (AAAI-23), Volume 37:5. 2023.<\/li>\n
        9. Diego Figueira, Santiago Figueira, and Edwin Pin Baque. PDL on Steroids: on expressive extensions of PDL with intersection and converse<\/a>. In: 39th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2023), IEEE, 2023.<\/li>\n
        10. Agust\u00edn Borgna and Rafael Romero. Encoding High-level Quantum Programs as SZX-diagrams<\/a>. In:18th International Conference on Quantum Physics and Logic (QPL 2022). EPTCS 394, 2023.<\/li>\n
        11. Alejandro D\u00edaz-Caro and Gilles Dowek. Linear lambda-calculus is linear<\/a>. In: 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). LIPIcs 228:21, 2022.<\/li>\n
        12. Delia Kesner and Andr\u00e9s Ezequiel Viso. Encoding Tight Typing in a Unified Framework<\/a>. In: 30th EACSL Annual Conference on Computer Science Logic (CSL 2022). LIPIcs 216(27), 2022.<\/li>\n
        13. Alejandro D\u00edaz-Caro and Gilles Dowek. A new connective in natural deduction, and its application to quantum computing<\/a>. In: 18th International Colloquium on Theoretical Aspects of Computing (ICTAC 2021). LNCS 12819:175-193, 2021. (Winner of the best paper award<\/em>)<\/li>\n
        14. Adri\u00e1n Pastine, Pablo Torres, and Mario Valencia. On the diameter of Schrijver graphs<\/a>. In: XI Latin and American Algorithms, Graphs and Optimization Symposium (LAGOS 2021). PCS 195:266-274, 2021.<\/li>\n
        15. Delia Kesner, Eduardo Bonelli, and Andr\u00e9s Viso. Strong Bisimulation for Control Operators (Invited Talk)<\/a>. In: 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). LIPIcs 152(4), 2020.<\/li>\n
        16. Diego Figueira, Santiago Figueira, and Edwin Pin Baque. Finite Controllability for Ontology-Mediated Query Answering of CRPQ<\/a>. In: 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Main Track, pages 381-391, 2020.<\/li>\n
        17. Bartosz Bednarczyk, St\u00e9phane Demri, Ra\u00fal Fervari, and Alessio Mansutti. Modal Logics with Composition on Finite Forests: Expressivity and Complexity<\/a>. In: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2020), IEEE, 2020.<\/li>\n
        18. Val\u00e9rie Berth\u00e9, Eda Cesaratto, Fr\u00e9d\u00e9ric Paccaut, Pablo Rotondo, Mart\u00edn Safe, and Brigitte Vall\u00e9e. Two\u00a0 arithmetical sources and their associated\u00a0 tries<\/a>. In: 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA2020). LIPIcs 159(4), 2020.<\/li>\n
        19. Antonio Bucciarelli, Delia Kesner, Alejandro R\u00edos, and Andr\u00e9s Viso. The Bang Calculus Revisited<\/a>. In: 15th International Symposium on Functional and Logic Programming (FLOPS 2020). LNCS 12073:13-32, 2020.<\/li>\n
        20. Beniamino Accattoli and Alejandro D\u00edaz-Caro. Functional Pearl: The Distributive \u03bb-Calculus<\/a>. In: 15th International Symposium on Functional and Logic Programming (FLOPS 2020). LNCS 12073:33-49, 2020.<\/li>\n
        21. Mar\u00eda Emilia Descotte, Diego Figueira, and Santiago Figueira. Closure properties of synchronized relations<\/a>. In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). LIPICS 126(22), 2019.<\/li>\n
        22. St\u00e9phane Demri, Raul Fervari, and Alessio Mansutti. Axiomatising Logics with Separating Conjunction and Modalities<\/a>. In: Proceedings of the 16th European Conference on Logics in Artificial Intelligence (JELIA 2019). LNCS 11468:692-708, 2019.<\/li>\n
        23. Alejandro D\u00edaz-Caro and Gilles Dowek. Proof Normalisation in a Logic Identifying Isomorphic Propositions<\/a>. In: 4th International Conference on Formal Structures for Computation and Deduction (FSCD 2019). LIPICS 131(14), 2019.<\/li>\n
        24. Alejandro D\u00edaz-Caro, Mauricio Guillermo, Alexandre Miquel, and Beno\u00eet Valiron. Realizability in the Unitary Sphere<\/a>. In: 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS 2019), IEEE, 2019.<\/li>\n
        25. \n
        26. Delia Kesner, Alejandro Rios, and Andres Viso. Call-by-need, neededness and all that<\/a>. In: 21st International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2018). LNCS 10803:241-257, 2018.<\/li>\n
        27. Alejandro D\u00edaz-Caro and Gilles Dowek. Typing quantum superpositions and measurement<\/a>. In: 6th International Conference on the Theory and Practice of Natural Computing (TPNC 2017). LNCS 10687:281-293, 2017.<\/li>\n
        28. Sergio Abriola, Pablo Barcel\u00f3, Diego Figueira, and Santiago Figueira. Bisimulations on Data Graphs<\/a>. In: 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 2016). ACM, pages 309-318, 2016.<\/li>\n
        29. Sophie Laplante, Mathieu Lauri\u00e8re, Alexandre Nolin, J\u00e9r\u00e9mie Roland, and Gabriel Senno. Robust Bell Inequalities from Communication Complexity<\/a>. In: 11th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2016). LIPIcs 61:1-24, 2016.<\/li>\n
        30. Beniamino Accattoli, Pablo Barenbaum, and Damiano Mazza. A Strong Distillery<\/a>. In: The 13th Asian Symposium on Programming Languages and Systems (APLAS 2015). LNCS 9458:231-250, 2015.<\/li>\n
        31. Val\u00e9rie Berth\u00e9, Eda Cesaratto, Pablo Rotondo, Brigitte Vall\u00e9e, and Alfredo Viola. Recurrence function on Sturmian words: a probabilistic study<\/a>. In: The 40th International Symposium on Mathematical Foundations of Computer Science (MFCS 2015). LNCS 9234:116-128, 2015.<\/li>\n
        32. Guido Chari, Diego Garbervetsky, Stefan Marr, and St\u00e9phane Ducasse. Towards fully reflective environments<\/a>. In: ACM International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software (Onward!), ACM, pages 240-253, 2015.<\/li>\n
        33. Diego Figueira, Santiago Figueira, and Carlos Areces. Basic Model Theory of XPath on Data Trees<\/a>. In: 17th International Conference on Database Theory (ICDT 2014), 2014.<\/li>\n
        34. Beniamino Accattoli, Eduardo Bonelli, Delia Kesner, and Carlos Lombardi. A Nonstandard Standardization Theorem<\/a>. In: ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2014), pages 659-670, 2014.<\/li>\n
        35. Carlos Areces, Hans van Ditmarsch, Ra\u00fal Fervari, and Fran\u00e7ois Schwarzentruber. Logics with Copy and Remove<\/a>. In: 21th Workshop of Logic, Language, Information and Computation (WoLLIC 2014), LNCS 8652:51-65, 2014.<\/li>\n
        36. Flavia Bonomo, Oliver Schaudt, Maya Stein, and Mario Valencia-Pabon. b-Coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs<\/a>. In: 3rd International Symposium on Combinatorial Optimization (ISCO 2014). LNCS 8596:100-111, 2014.<\/li>\n
        37. Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, and Gautier Stauffer. Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property<\/a>. In: 16th International Conference on Integer Programming and Combinatorial Optimization (IPCO 2013), LNCS 7801:86-97, 2013.<\/li>\n
        38. Carlos Areces and Pascal Fontaine. Combining Theories: The Ackerman and Guarded Fragments<\/a>. In: 8th International Symposium on Frontiers of Combining Systems (FroCos 2011), LNCS 6989:40-54, 2011.<\/li>\n<\/ol>\n

          Peer-reviewed international workshop publications<\/strong><\/p>\n

            \n
          1. Raul Fervari and Benjamin Icard. Arbitrary Radical Upgrades<\/a>. In: The International Workshop on Reconfigurable Transition Systems: Semantics, Logics and Applications (ReacTS 2024). To appear in LNCS, 2024<\/li>\n
          2. Flavia Bonomo, Ivan Koch, and Mario Valencia-Pabon. A linear algorithm for the k-tuple chromatic number of partner limited graphs. In: VII Latin American Workshop on Cliques in Graphs, La Plata, Argentina, November 2016.<\/li>\n
          3. Carlos Areces, David Deharbe, Pascal Fontaine, and Ezequiel Orbe. SyMT: finding symmetries in SMT formulas. In: International Workshop on Satisfiability Modulo Theories (SMT 2013), Helsinki, Finland, July 2013.<\/li>\n
          4. Alejandro D\u00edaz-Caro and Gilles Dowek. The probability of non-confluent systems<\/a>. In: 9th International Workshop on Developments in Computational Models (DCM 2013). EPTCS 144:1-15, 2014.<\/li>\n
          5. Alejandro D\u00edaz-Caro and Gilles Dowek. Non determinism through type isomorphism<\/a>. In: 7th Workshop on Logical and Semantic Frameworks, with Applications (LSFA 2012). EPTCS 113:137-144, 2013.<\/li>\n
          6. Delia Kesner, Carlos Lombardi, and Alejandro R\u00edos. A Standardisation proof for algebraic pattern calculi<\/a>. In: 5th International Workshop on Higher-Order Rewriting (HOR 2010). EPTCS 49:58-72, 2010.<\/li>\n<\/ol>\n","protected":false},"excerpt":{"rendered":"

            In this page we detail only the co-publications, that is, publications co-authored by both Argentinean and French members of SINFIN (and previously, INFINIS). Information for members: Please acknowledge the IRP in your publications with the following text \u00abThis work was partially\/fully funded by the French-Argentinian IRP SINFIN.\u00bb Book chapters Ver\u00f3nica Becher and Olivier Carton. Normal … Continue reading Co-publications<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-939","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/pages\/939","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/pages"}],"about":[{"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=%2Fwp%2Fv2%2Fcomments&post=939"}],"version-history":[{"count":84,"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/pages\/939\/revisions"}],"predecessor-version":[{"id":2122,"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=\/wp\/v2\/pages\/939\/revisions\/2122"}],"wp:attachment":[{"href":"http:\/\/www.irp-sinfin.org\/index.php?rest_route=%2Fwp%2Fv2%2Fmedia&parent=939"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}