The Summer School on Informatics RIO is an academic event that is organized by the Department of Computer Science of the University of Rio Cuarto, in Rio Cuarto, Cordoba, Argentina.
It has been annually organized without interruption (with the sole exception of 2021 and 2022, years in which, due to the COVID19 pandemic, the school had to be suspended) since 1994, and takes place in late February, during Argentina’s summer.
It offers intensive one-week courses on topics that span through all areas of Computer Science. The target audience of the summer school is composed of advanced undergraduate students, graduate students and researchers from Argentina and the countries in the region, and the goal is to provide a learning opportunity to keep up-to-date with the latest advances in Computer Science.
The summer school invites distinguished researchers to teach courses on their respective areas of expertise. The school allows us to foster interaction between institutions, to connect researchers and research groups, and to provide opportunities to students to directly interact with top international researchers, and complement their formal education with the latest advances in Informatics. Nearly 4000 students have attended the school, throughout the years.
Alessandra Gorla is Associate Research Professor at the IMDEA Software Institute in Madrid, Spain. She completed her Ph.D. in informatics at the Università della Svizzera Italiana in Lugano, Switzerland in 2011. In her Ph.D. thesis she defined and developed the notion of Automatic Workarounds, a self-healing technique to recover Web applications from field failures, a work for which she received the Fritz Kutter Award for the best industry related Ph.D. thesis in computer science in Switzerland.
Before joining IMDEA, she was a postdoctoral researcher in the software engineering group at Saarland University in Germany. During her postdoc, she has also been a visiting researcher at Google in Mountain View.
Alessandra's research interests are in software engineering, and in particular on testing and analysis techniques to improve the reliability, security and privacy of software systems.
Peter Lammich is an expert in interactive theorem proving and software verification. He works with the Isabelle proof assistant. He has developed the Isabelle Refinement Framework, that enables a stepwise refinement based approach to verification of efficient software. He has applied the refinement framework to formally verify practically efficient software, including model checkers, SAT solvers and UNSAT certifiers, graph algorithms, and (parallel) sorting algorithms. A key focus of his research is to improve scalability of verification techniques, to both more complex software and more efficient implementations.
After his PhD at WWU Münster, he has worked at TU Munich, Virginia Tech, the University of Manchester, and is now assistant professor in the Formal Methods and Tools group at the University of Twente.
Bugs in software can cause serious economic and health damage, in particular in software that controls critical systems.
Lightweight techniques such as static typing and program analysis help to avoid many common bugs, but cannot guarantee correctness. To do that, a mathematical proof of program correctness is required. However, pen-and-paper proofs, inparticular about software, are error-prone. Here, interactive theorem provers can help: they are software tools to check proofs for correctness. They also come with powerful tools to help the user find (correct) proofs.
In this lecture, we will give a hands-on introduction to the interactive theorem prover Isabelle/HOL, and apply it to verify (simple) programs. We will conclude with an overview of the state-of-the-art and an outlook to future research in this area.
Santiago Figueira es profesor en el Departamento de Computación de la Facultad de Ciencias Exactas y Naturales de la Universidad de Buenos Aires e investigador de CONICET. Empezó su carrera científica estudiando nociones de aletoriedad algorítmica y su relación con la computabilidad.
Luego se acercó a las lógicas computacionales y a la teoría de las bases de datos. Más recientemente, participó de investigaciones que conectan la computabilidad con la información cuántica por un lado, y la teoría de largo de programa con algunos problemas de cognición humana.
Es director del Grupo de Lógica y Computabilidad del Instituto de Ciencias de la Computación y a lo largo de los años tuvo varios cargos de gestión en su Facultad.
Una de las contribuciones fundamentales de la lógica matemática ha sido la formulación precisa y el estudio riguroso de las funciones computables. Esta área recibió un enorme ímpetu en 1931 con el Teorema de Incompletitud de Gödel, que usaba la noción de función primitiva recursiva y llevó a que Church, Gödel, Kleene, Post y Turing propusieran, durante mediados de los años 30, una variedad de definiciones para función “efectivamente calculable”.
Pronto se descubrió que cada una de estas propuestas de definiciones daba lugar a la misma clase de funciones. Informalmente, son las funciones que pueden ser calculables por una computadora moderna si se ignoran las restricciones de tiempo y espacio de cómputo.
Íntimamente relacionada con esta idea está la noción de conjunto “computablemente enumerable”, que son aquellos conjuntos de números naturales que pueden ser generados por medio de un procedimiento computable. Estos dos objetos –las funciones computables y los conjuntos computablemente enumerables– son los principales objetos de estudio de la Teoría de la Computabilidad.
En este curso se presentarán algunos resultados centrales de la teoría. Todos ellos van en dirección a entender la compleja estructura de universo de los problemas no-computables, la forma de clasificarlos y de comparalos entre sí, su relación con la lógica y algunas técnicas de demostración y de mecanismos de construcción que van más allá de la idea inicial de diagonalización para demostrar la no-computabilidad del problema de Halt.
Mike Papadakis is an Associate Professor at the University of Luxembourg where he leads the SERVAL (SEcurity, Reasoning and VALidation) research team. His research interests include software testing, code analysis and artificial intelligence for software engineering. He is best known for his work on Mutation Testing for which he has been awarded IEEE TCSE Rising Star Award 2020.
He serves as General Chair of the ACM SIGSOFT ISSTA 2025 and IEEE ICSME 2021 and as Program Chair of SSBSE 2022 and IEEE ICST 2023. He also serves at the editorial board of international Software Engineering journals (STVR, TOSEM) and has co-authored more than 140 publications in international peer-reviewed conferences and journals. His work has been supported by Facebook, FNR, CETREL (SIX group company), BGL (BNP Paribas), Microsoft and PayPal.
In this course we will show how to approach some security problems in a rigorous and principled way, using programming language theory. Some of the problems we will tackle are: reasoning about interaction with polynomial adversaries, relating highly optimized implementations with their corresponding specifications, and analyzing secret and public data flow of a program.
Our case study will be Jasmin, a language designed to implement high assurance high speed cryptography. Jasmin provides a detailed control of the assembly generated by the compiler, allowing for maximal optimization of cryptographic routines. The compiler is verified in Coq, guaranteeing that a Jasmin program and its compilation have equivalent behaviors.
From a Jasmin program, one may extract a model for the EasyCrypt proof assistant, which may be used to prove program properties such as cryptographic security. Additionally, Jasmin provides a safety checker to detect common mistakes such as out-of-bounds accesses and arithmetic errors.
Finally, we will show a type system that allows to compute the public and private information flow of a program, and how such information can be used to guarantee that a program does not reveal secret information, even in the presence of side channels and speculative execution.
Monday | Tuesday | Wednesday | Thursday | Friday | |
---|---|---|---|---|---|
09:00-11:30 | Course 1 / Course 2 | Course 1 / Course 2 | Course 1 / Course 2 | Course 1 / Course 2 | Industry talks |
14:00-16:30 | Course 3 / Course 4 | Course 3 / Course 4 | Course 3 / Course 4 | Course 3 / Course 4 | Industry talks |
17:00-19:30 | Course 5 / Course 6 | Course 5 / Course 6 | Course 5 / Course 6 | Course 5 / Course 6 | Panel in memory of Prof. Jorge Aguirre |
19:30-21:00 | Reception | School dinner | Students' social event | Closing |
The fees for the courses depend on the attendant's category and number of courses to take.
The registration categories and their corresponding fees are the following:
Category | One course | Two courses | Three courses |
---|---|---|---|
Students from UNRC | ARS$20,000 | ARS$32,000 | ARS$40,000 |
Students, professors and researchers from Latin American public academic and scientific institutions | ARS$20,000 | ARS$32,000 | ARS$40,000 |
Professionals and others | ARS$100,000 | ARS$160,000 | ARS$200,000 |
Students from UNRC can take any number of courses free of charge, provided they register before February 10, 2025. Fees in the above table apply for late registration, in the case of UNRC students. Please notice that registration implies a commitment to take the corresponding courses. In case a student is registered but cannot take the courses he/she registered in, please notify the organization as soon as possible, to allow for other students to register. UNRC graduates can register in the category for "Students, professors and researchers from Latin American institutions".
To register you must complete the following
Registration FormThe Argentinian Summer School on Informatics RIO will offer registration grants for students. Beneficiaries of these grants may attend all courses free of charge.
The requirements to apply for a student registration grant are the following:
To apply for a student registration grant, please fill in the following
Student Registration Grant Application FormIn addition to filling in the application form, applicants must send a certificate of enrollment in the corresponding academic program, by email, to riobecas@dc.exa.unrc.edu.ar
Deadline to apply for student registration grants: February 10, 2025
The Argentinian Summer School on Informatics RIO is happy to announce the availability of grants to partially cover travel and accommodation expenses. These grants are made possible thanks to ACM and AWS, and our sponsors and supporters in general. Grant availability will be limited, and will cover from USD200 up to USD400, to support the participation in our School. We welcome applications from undergraduate students, graduate students, researchers and academics in general. Applications will be judged based on the qualifications of the applicants, and the geographical distance from the applicants' place of origin to the location of our School. We will prioritize advanced students and young academics from public institutions, from more distant locations.
To apply for a travel grant, please fill in the following
Travel Grant Application Form
Deadline to apply for travel grants: February 10, 2025
The school will be held at the campus of the National University of Rio Cuarto (UNRC), Rio Cuarto, Cordoba, Argentina. The closest international airport is Cordoba Airport (COR), in the Province's capital (200km away from Rio Cuarto). Bus transportation between Cordoba and Rio Cuarto is frequent. Rio Cuarto can be reached by plane from Buenos Aires, arriving at the Rio Cuarto Airport (RCU). Long distance buses offer quality transportation from all over Argentina to Rio Cuarto too.
The campus is located 7km away from Rio Cuarto's city center. Various public buses connect the University's campus with different locations in the city, including the city center. Taxies and Uber are relatively affordable too. You may get more information regading local buses in the bus company's web site:
"SAT Rio Cuarto"