Juan Pablo Galeotti has been promoted to Investigador Adjunto at CONICET.Juan Pablo Galeotti a été promu Investigador Adjunto à CONICET.Juan Pablo Galeotti fue promovido a Investigador Adjunto del CONICET.
Diego Garbervetsky is member of the program committee of FM2018
Diego Garbervetsky is member of the program committee of the 22nd International Symposium on Formal Methods.Diego Garbervetsky est membre du comité du programme du 22nd International Symposium on Formal Methods.Diego Garbervetsky es miembro del comité de programa de 22nd International Symposium on Formal Methods.
Recent publications of the team "Formal Specification, Verification and Implementation of Concurrent Real-Time Embedded Systems"
- Hernan Melgratti and Luca Padovani. “Chaperone Contracts for Higher-Order Sessions”. 22nd ACM SIGPLAN International Conference on Functional Programming (ICFP 2017).
- Diego Garbervetsky, Edgardo Zoppi, and Benjamin Livshits, “Toward Full Elasticity in Distributed Static Analysis: The Case of Callgraph Analysis”, acepted for the main track of ESEC/FSE 2017.
- Diego Garbervetsky, Zvonimir Pavlinovic, Michael Barnett, Madanlal Musuvathi, Todd Mytkowicz, and Edgardo Zoppi, “Static Analysis for Optimizing Big Data Queries” acepted for the industrial track of ESEC/FSE 2017.
- Nikolas Havrikov, Alessio Gambi, Andreas Zeller, Andrea Arcuri, and Juan Pablo Galeotti, “Generating unit tests with structured system interactions”. May 2017 AST’17: Proceedings of the 12th International Workshop on Automation of Software Testing.
- Juan Pablo Galeotti and Justyna Petke, “SBST ’17: Proceedings of the 10th International Workshop on Search-Based Software Testing“, May 2017.
- Hernan Melgratti et Luca Padovani. “Chaperone Contracts for Higher-Order Sessions”. 22nd ACM SIGPLAN International Conference on Functional Programming (ICFP 2017).
- Diego Garbervetsky, Edgardo Zoppi et Benjamin Livshits, “Toward Full Elasticity in Distributed Static Analysis: The Case of Callgraph Analysis”, acepté dans le main track à ESEC/FSE 2017.
- Diego Garbervetsky, Zvonimir Pavlinovic, Michael Barnett, Madanlal Musuvathi, Todd Mytkowicz et Edgardo Zoppi, “Static Analysis for Optimizing Big Data Queries” acepté au industrial track à ESEC/FSE 2017.
- Nikolas Havrikov, Alessio Gambi, Andreas Zeller, Andrea Arcuri et Juan Pablo Galeotti, “Generating unit tests with structured system interactions”. Mai 2017 AST’17: Proceedings of the 12th International Workshop on Automation of Software Testing.
- Juan Pablo Galeotti et Justyna Petke, “SBST ’17: Proceedings of the 10th International Workshop on Search-Based Software Testing“, Mai 2017.
- Hernan Melgratti y Luca Padovani. “Chaperone Contracts for Higher-Order Sessions”. 22nd ACM SIGPLAN International Conference on Functional Programming (ICFP 2017).
- Diego Garbervetsky, Edgardo Zoppi y Benjamin Livshits, “Toward Full Elasticity in Distributed Static Analysis: The Case of Callgraph Analysis”, aceptado en track principal de ESEC/FSE 2017.
- Diego Garbervetsky, Zvonimir Pavlinovic, Michael Barnett, Madanlal Musuvathi, Todd Mytkowicz y Edgardo Zoppi, “Static Analysis for Optimizing Big Data Queries” aceptado al track industrial de ESEC/FSE 2017.
- Nikolas Havrikov, Alessio Gambi, Andreas Zeller, Andrea Arcuri y Juan Pablo Galeotti, “Generating unit tests with structured system interactions”. Mayo 2017 AST’17: Proceedings of the 12th International Workshop on Automation of Software Testing.
- Juan Pablo Galeotti y Justyna Petke, “SBST ’17: Proceedings of the 10th International Workshop on Search-Based Software Testing“, Mayo 2017.
Antonio Cafure and Martín Safe gave invited talks at MCA in Canada. 24-28/Jul/17
Antonio Cafure and Martín Safe gave invited talks at Special Sessions of the Mathematical Congress of the Americas. July 24-28, Montreal, Canada.Antonio Cafure et Martín Safe ont donné des séminaires invités aux Sessions Spéciaux du Mathematical Congress of the Americas. 24 au 28 juillet 2017, Montreal, Canada.Antonio Cafure y Martín Safe dieron charlas invitadas en las Sesiones Especiales del Mathematical Congress of the Americas. 24 al 28 de julio de 2017, Montreal, Canadá.
Alejandro Díaz-Caro will give a course at ECI – 24-28/Jul/17
Alejandro Díaz-Caro (CONICET/UNQ) will give the cours “Fundamentos de lenguajes para computación cuántica” (Foundations of quantum computing languages) at the “Escuela de Ciencias Informáticas” – UBA – 24-28 July 2017.Alejandro Díaz-Caro (CONICET/UNQ) donnera le cours “Fundamentos de lenguajes para computación cuántica” (Fondements des langages quantiques) à l’« Escuela de Ciencias Informáticas » – UBA – Buenos Aires, 24-28 Juillet 2017.
Alejandro Díaz-Caro (CONICET/UNQ) dictará el curso “Fundamentos de lenguajes para computación cuántica” en la “Escuela de Ciencias Informáticas” – UBA – 24 al 28 de julio de 2017.
Verónica Becher is invited speaker at Fourteenth International Conference on Computability and Complexity in Analysis in Korea -24-27/Jul/17
Verónica Becher is invited speaker at Fourteenth International Conference on Computability and Complexity in Analysis, Daejeon, Republic of Korea, July 24 – 27, 2017Verónica Becher est oratrice invité au Fourteenth International Conference on Computability and Complexity in Analysis à Daejeon, République de Korea – 24 au 27 juillet 2017
Verónica Becher est oradora invitada en el Fourteenth International Conference on Computability and Complexity in Analysis en Daejeon, República de Korea – 24 al 27 de julio de 2017
Workshop on Quantum Logic, Computation, and Information – 13/July/2017
2a Jornada de Lógica, Computación e Información Cuántica
Jueves 13 de julio de 2017
Universidad Nacional Arturo Jauretche
Av. Calchaquí 6200, Florencio Varela
— Salón Auditorio —
El 13 de julio se realizará la 2a jornada de lógica, computación e información cuántica. El objetivo de las jornadas es proveer un espacio de encuentro para quienes trabajamos en fundamentos lógicos de la computación cuántica desde una perspectiva interdisciplinaria. Contaremos con charlas de Guido Bellomo (postdoctorando en el Dpto. Computación de Ciencias Exactas-UBA), Simon Perdrix (investigador CNRS en el laboratorio LORIA de Nancy, Francia) y Christian de Ronde (Investigador CONICET, Profesor UNAJ y FFyL-UBA). El encuentro se realizará en la Sede de la Universidad Nacional Arturo Jauretche desde las 10:30 hasta las 16:30 horas.
Esta convocatoria que surge de jóvenes investigadores del área busca ser amplia e inclusiva. Están todos invitados a sumarse al encuentro. Se agradece la difusión.
==============================
Programa:
10:30 Café
11:00 Christian de Ronde: On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures)
12:00 Almuerzo
14:00 Simon Perdrix: Diagrammatic Quantum Reasoning: Completeness and Incompleteness
15:00 Café
15:30 Guido Bellomo: Quantum entropies and lossless quantum data compression
==============================
Resúmenes:
Christian de Ronde (Universidad Nacional Arturo Jauretche & CONICET) – On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures).
Quantum superpositions are being used today in laboratories all around the world in order to create the most outstanding technological and experimental developments of the last centuries. However, while many experimentalists are showing that Schrödinger’s cats are growing fat, while it becomes more and more clear that quantum superpositions are telling us something about quantum physical reality even at the macroscopic scale, philosophers of QM in charge of analyzing and interpreting these mathematical expressions (through the many interpretations of QM that can be found in the literature) have not been capable of providing a coherent physical representation of them. In this paper we attempt to discuss the importance of providing a physical representation of quantum superpositions that goes beyond the mere reference to mathematical structures and measurement outcomes.
Simon Perdrix (CNRS / LORIA, Francia) – Diagrammatic Quantum Reasoning: Completeness and Incompleteness.
The ZX-calculus introduced by Coecke and Duncan is a graphical formal language for quantum reasoning based on the complementarity of observables. I’ll introduce this category-based diagrammatic calculus, give some examples, and focus on the question of completeness of the language for quantum mechanics. The language is complete if for any two diagrams representing the same quantum evolution, one can be transformed into the other using the rules of the ZX-calculus. The language was known to be complete for non universal fragments of quantum mechanics, and incomplete in general. I will present the first complete axiomatisation of the ZX-calculus for a universal fragment of quantum mechanics.
Guido Bellomo (Universidad de Buenos Aires) – Quantum entropies and lossless quantum data compression.
One of the main concerns in classical and quantum information theories is the problem of encoding information by using fewest resources as possible. This task is known as data compression and it can be carried out either in a lossy or a lossless way, depending on whether the original data can be recovered with or without errors, respectively. Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum Rényi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.2a Jornada de Lógica, Computación e Información Cuántica
Jueves 13 de julio de 2017
Universidad Nacional Arturo Jauretche
Av. Calchaquí 6200, Florencio Varela
— Salón Auditorio —
El 13 de julio se realizará la 2a jornada de lógica, computación e información cuántica. El objetivo de las jornadas es proveer un espacio de encuentro para quienes trabajamos en fundamentos lógicos de la computación cuántica desde una perspectiva interdisciplinaria. Contaremos con charlas de Guido Bellomo (postdoctorando en el Dpto. Computación de Ciencias Exactas-UBA), Simon Perdrix (investigador CNRS en el laboratorio LORIA de Nancy, Francia) y Christian de Ronde (Investigador CONICET, Profesor UNAJ y FFyL-UBA). El encuentro se realizará en la Sede de la Universidad Nacional Arturo Jauretche desde las 10:30 hasta las 16:30 horas.
Esta convocatoria que surge de jóvenes investigadores del área busca ser amplia e inclusiva. Están todos invitados a sumarse al encuentro. Se agradece la difusión.
==============================
Programa:
10:30 Café
11:00 Christian de Ronde: On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures)
12:00 Almuerzo
14:00 Simon Perdrix: Diagrammatic Quantum Reasoning: Completeness and Incompleteness
15:00 Café
15:30 Guido Bellomo: Quantum entropies and lossless quantum data compression
==============================
Resúmenes:
Christian de Ronde (Universidad Nacional Arturo Jauretche & CONICET) – On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures).
Quantum superpositions are being used today in laboratories all around the world in order to create the most outstanding technological and experimental developments of the last centuries. However, while many experimentalists are showing that Schrödinger’s cats are growing fat, while it becomes more and more clear that quantum superpositions are telling us something about quantum physical reality even at the macroscopic scale, philosophers of QM in charge of analyzing and interpreting these mathematical expressions (through the many interpretations of QM that can be found in the literature) have not been capable of providing a coherent physical representation of them. In this paper we attempt to discuss the importance of providing a physical representation of quantum superpositions that goes beyond the mere reference to mathematical structures and measurement outcomes.
Simon Perdrix (CNRS / LORIA, Francia) – Diagrammatic Quantum Reasoning: Completeness and Incompleteness.
The ZX-calculus introduced by Coecke and Duncan is a graphical formal language for quantum reasoning based on the complementarity of observables. I’ll introduce this category-based diagrammatic calculus, give some examples, and focus on the question of completeness of the language for quantum mechanics. The language is complete if for any two diagrams representing the same quantum evolution, one can be transformed into the other using the rules of the ZX-calculus. The language was known to be complete for non universal fragments of quantum mechanics, and incomplete in general. I will present the first complete axiomatisation of the ZX-calculus for a universal fragment of quantum mechanics.
Guido Bellomo (Universidad de Buenos Aires) – Quantum entropies and lossless quantum data compression.
One of the main concerns in classical and quantum information theories is the problem of encoding information by using fewest resources as possible. This task is known as data compression and it can be carried out either in a lossy or a lossless way, depending on whether the original data can be recovered with or without errors, respectively. Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum Rényi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.2a Jornada de Lógica, Computación e Información Cuántica
Jueves 13 de julio de 2017
Universidad Nacional Arturo Jauretche
Av. Calchaquí 6200, Florencio Varela
— Salón Auditorio —
El 13 de julio se realizará la 2a jornada de lógica, computación e información cuántica. El objetivo de las jornadas es proveer un espacio de encuentro para quienes trabajamos en fundamentos lógicos de la computación cuántica desde una perspectiva interdisciplinaria. Contaremos con charlas de Guido Bellomo (postdoctorando en el Dpto. Computación de Ciencias Exactas-UBA), Simon Perdrix (investigador CNRS en el laboratorio LORIA de Nancy, Francia) y Christian de Ronde (Investigador CONICET, Profesor UNAJ y FFyL-UBA). El encuentro se realizará en la Sede de la Universidad Nacional Arturo Jauretche desde las 10:30 hasta las 16:30 horas.
Esta convocatoria que surge de jóvenes investigadores del área busca ser amplia e inclusiva. Están todos invitados a sumarse al encuentro. Se agradece la difusión.
==============================
Programa:
10:30 Café
11:00 Christian de Ronde: On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures)
12:00 Almuerzo
14:00 Simon Perdrix: Diagrammatic Quantum Reasoning: Completeness and Incompleteness
15:00 Café
15:30 Guido Bellomo: Quantum entropies and lossless quantum data compression
==============================
Resúmenes:
Christian de Ronde (Universidad Nacional Arturo Jauretche & CONICET) – On the physical foundation of quantum superpositions (beyond measurement outcomes and mathematical structures).
Quantum superpositions are being used today in laboratories all around the world in order to create the most outstanding technological and experimental developments of the last centuries. However, while many experimentalists are showing that Schrödinger’s cats are growing fat, while it becomes more and more clear that quantum superpositions are telling us something about quantum physical reality even at the macroscopic scale, philosophers of QM in charge of analyzing and interpreting these mathematical expressions (through the many interpretations of QM that can be found in the literature) have not been capable of providing a coherent physical representation of them. In this paper we attempt to discuss the importance of providing a physical representation of quantum superpositions that goes beyond the mere reference to mathematical structures and measurement outcomes.
Simon Perdrix (CNRS / LORIA, Francia) – Diagrammatic Quantum Reasoning: Completeness and Incompleteness.
The ZX-calculus introduced by Coecke and Duncan is a graphical formal language for quantum reasoning based on the complementarity of observables. I’ll introduce this category-based diagrammatic calculus, give some examples, and focus on the question of completeness of the language for quantum mechanics. The language is complete if for any two diagrams representing the same quantum evolution, one can be transformed into the other using the rules of the ZX-calculus. The language was known to be complete for non universal fragments of quantum mechanics, and incomplete in general. I will present the first complete axiomatisation of the ZX-calculus for a universal fragment of quantum mechanics.
Guido Bellomo (Universidad de Buenos Aires) – Quantum entropies and lossless quantum data compression.
One of the main concerns in classical and quantum information theories is the problem of encoding information by using fewest resources as possible. This task is known as data compression and it can be carried out either in a lossy or a lossless way, depending on whether the original data can be recovered with or without errors, respectively. Based on the problem of quantum data compression in a lossless way, we present here an operational interpretation for the family of quantum Rényi entropies. In order to do this, we appeal to a very general quantum encoding scheme that satisfies a quantum version of the Kraft-McMillan inequality. Then, in the standard situation, where one is intended to minimize the usual average length of the quantum codewords, we recover the known results, namely that the von Neumann entropy of the source bounds the average length of the optimal codes. Otherwise, we show that by invoking an exponential average length, related to an exponential penalization over large codewords, the quantum Rényi entropies arise as the natural quantities relating the optimal encoding schemes with the source description, playing an analogous role to that of von Neumann entropy.
Simon Perdrix visits LoReL – July 2017
Simon Perdrix (CNRS/LORIA) visits the LoReL Lab at Universidad Nacional de Quilmes, whose members are also members of INFINIS, from July 10 to July 21, to work with Alejandro Díaz-Caro.Simon Perdrix (CNRS/LORIA) visite le laboratoire LoReL à l’Universidad Nacional de Quilmes, dont les membres sont aussi au INFINIS, du 10 au 21 juillet, pour travailler avec Alejandro Díaz-Caro.Simon Perdrix (CNRS/LORIA) visita el laboratorio LoReL en la Universidad Nacional de Quilmes, cuyos miembros también son miembros de INFINIS, del 10 al 21 de julio, para trabajar con Alejandro Díaz-Caro.
Gilles Dowek visits LoReL – June 2017
Gilles Dowek (INRIA/LSV) visits the LoReL Lab at Universidad Nacional de Quilmes, whose members are also members of INFINIS, from June 22 to June 30, to work with Alejandro Díaz-CaroGilles Dowek (INRIA/LSV) visite le laboratoire LoReL à l’Universidad Nacional de Quilmes, dont les membres sont aussi au INFINIS, du 22 au 30 juin, pour travailler avec Alejandro Díaz-Caro.Gilles Dowek (INRIA/LSV) visita el laboratorio LoReL en la Universidad Nacional de Quilmes, cuyos miembros también son miembros de INFINIS, del 22 al 30 de junio, para trabajar con Alejandro Díaz-Caro.
Verónca Becher gave a talk at the Number theory seminar in Nancy-Metz – 1/Jun/17
Verónca Becher gave the talk “Normality together with other properties” at the Number theory seminar in Nancy-Metz, Institut Élie-Cartan de Lorraine, on June 1st, 2017.Verónca Becher a fait l’exposé “Normality together with other properties” au séminaire de Théorie des nombres à Nancy-Metz, Institut Élie-Cartan de Lorraine, le 1 juin 2017.Verónca Becher dió la charla “Normality together with other properties” en el seminario de Teoría de números en Nancy-Metz, Institut Élie-Cartan de Lorraine, el 1ro de junio de 2017.