Saturday, September 15, 2018

PhD position in "Concurrency, logic and type systems" at the University of Groningen, The Netherlands

Jorge PĂ©rez has asked me to share the following advertisement for a PhD position in his group at the University of Groningen. I trust that this might be of interest to some of the readers or this blog or their students working in concurrency theory, semantics of programming languages and types. The position is supported by a prestigious NWO VIDI career grant recently awarded to Jorge the project "Unifying Correctness for Communicating Software". Feel free to spread this call for PhD applications as you see fit. The deadline is in roughly two weeks.

PHD POSITION ON “CONCURRENCY, LOGIC, AND TYPE SYSTEMS“
(Posted: August 31, 2018)
University of Groningen, The Netherlands

We are searching for one four-year PhD position on the topics of concurrency, logic, type systems, and programming languages.

You will contribute to rigorously comparing different type systems for message-passing programs, such as session types.
These comparisons will use as reference a correspondence known as "propositions as sessions", which connects concurrency and logic in the style of the well-known Curry-Howard correspondence.
We will use the resulting comparisons to streamline existing type systems, and to guide the development of verification tools for message-passing programs.

Your PhD research will be embedded in the project "Unifying Correctness for Communicating Software", a VIDI career grant recently awarded to Dr. Jorge A. Perez by the NWO (Netherlands Organization for Scientific Research).
As such, you will join a dynamic, quickly growing research group; within the project, you will collaborate with research partners both in the Netherlands (e.g., at CWI Amsterdam) and abroad.

- Qualifications

You have an MSc degree (or equivalent) in Computer Science, Logic, Mathematics, or Artificial Intelligence, and experience in at least one, preferably two or more, of the following:

• Semantics of programming languages
• Program verification, type systems, and/or typed programming languages
• Concurrency theory and/or process calculi
• The Curry-Howard isomorphism ("propositions as types")
• Modal/substructural logics and (their) proof theory

Female candidates are encouraged to apply.

- Application and Additional Information

For further details on the position and the application procedure, please visit
https://www.rug.nl/about-us/work-with-us/job-opportunities/overview?details=00347-02S0006KOP

For further information and expressions of interest, contact Jorge A. Perez (j.a.perez@rug.nl).
See also http://www.jperez.nl/vidi

You may apply until 1 October 23:59h / before 2 October 2018 (Dutch local time).

Friday, September 14, 2018

Shortest-path algorithms applied to software engineering: A tale of cross fertilization within CS

These days, it looks as if many of us are supposed to undertake, or are expected to promise to carry out, interdisciplinary research. However, I have sometimes witnessed first-hand a lack of curiosity even to cross  the (often artificial) boundaries between areas of research within (theoretical) computer science and/or mathematics. This conservative attitude is reasonable at times, and at various stages of one's academic career, and is partly justified by the pressure to produce research output that most of us feel. I freely admit, though, that  I felt a bit uneasy when a colleague from "volume A TCS" told me at an ICALP conference that he was not going to attend  an invited talk delivered by a "volume B researcher" because that would be like going to a talk in the life sciences. (By the way, that invited talk was excellent and was delivered by a charismatic scientist. The colleague in question missed an intellectual treat.)

Perhaps naively, I feel that one of the reasons why we are in academia is that we are intellectually curious and that we should try to explain what we do to one another at least across the various disciplines within CS. Hence, I was very pleased to see this paper, which will appear in the prestigious IEEE Transactions on Software Engineering (behind the usually hefty paywall of the IEEE, alas). The paper stems from discussions between Mattia D'Emidio (a researcher in algorithmics) and Ludovico Iovino (a researcher in software engineering) who were sharing a basement office at the Gran Sasso Science Institute at the time. Those exchanges of ideas led eventually to the development of a framework that uses classic shortest-path algorithms in the selection of optimal chains of model transformations in model-driven SE. More specifically, those colleagues of mine show how to reduce the problem of computing chains of model transformations
that maximize the coverage to a shortest-path problem on weighted graphs. Moreover, they evaluate the practical effectiveness of the proposed approach by applying their automated methodology to a large set of experiments.

IMHO, this is a pleasing example of the kind of serendipitous collaboration that can arise when we are willing to have an open mind and look for possible applications to our techniques in other fields. Kudos to Ludovico, Mattia and their co-authors for going all the way and for publishing their article in a coveted outlet. I look forward to seeing more examples of cross fertilization within CS@GSSI.

Thursday, September 06, 2018

Some recent achievements by the PhD students in CS at the GSSI

Like many others, I believe that students are amongst the best ambassadors for an academic institution, and that their achievements are a good indication of the quality of a graduate programme and of the mentoring skills of its associated faculty members. Therefore, it has given me great pleasure to witness the accolades received by some of the (former) students in the doctoral programme in computer science at the Gran Sasso Science Institute over the last few months.

Readers of this blog might recall that I wrote posts on the following two items.
However, there were several other events worth reporting on which I was too lazy to write a few lines on this blog. Here are three more examples.
  • GSSI alumni Alkida Balliu and Dennis Olivetti, now postdocs at Aalto University in  Jukka Suomela's group, co-authored a paper presented at STOC 2018. The work on the paper was done while they were at the GSSI.
  • Third-year GSSI student Ahmed Abdelsalam was part of the netgroup team at CNIT/uniroma2 that won the Interworking stream at the SoftFIRE Challenge, which addresses issues related to interoperability of the current platform with other infrastructures. In particular, Ahmed's work on IPv6 Segment Routing (SRv6) and his recently developed SRv6 aware version of the network intrusion and detection system Snort featured in the award-winning proposal. If you use Linux, you are probably already running Ahmed's software!
  • In May 2018, Roberto Verdecchia received three awards for his research: 
I'm sure that this is just a small sample and that CS@GSSI students have more achievements of which I am not aware. It is a humbling experience to  see how smart many young researchers are. All one can hope for is to provide a good example for them and to play a small, positive role in their development as scientists.

Wednesday, September 05, 2018

Best PhD thesis award of the Italian Chapter of the EATCS

One of the prizes of the Italian Chapter of the EATCS is the Best Italian PhD Thesis in Theoretical Computer Science Award. This year, the committee (consisting of Vincenzo Auletta,  Ferdinando Cicalese and Carla Piazza) has unanimously decided to bestow the award on the following two young scientists:
  • Michele Ciampi for his thesis "Round and Computational Efficiency of Two-Party Protocols" and 
  • Luisa Siniscalchi for her dissertation "Delayed-Input and Non-Malleable Cryptographic Protocols".
Both the award recipients were PhD students at the University of Salerno working with Giuseppe Persiano and Ivan Visconti, which is remarkable.

Moreover, the award committee found that the following two theses deserved a honourable mention:
Congratulations to these young scientists. I wish them all a great career, whatever they decide to do in the future.

Friday, August 24, 2018

ICE-TCS Theory Day(s) 2018

The Icelandic Centre of Excellence in Theoretical Computer Science held its 14th annual Theory Day today. The programme is here.

Takeshi Tokuyama (Tohoku University, Japan) kicked off the day with a talk entitled Deformation of Determinants and Related Combinatorics. The talk was based on work that Takeshi did in 1986 (as a mathematics postdoc) and published in 1988. He referred to it as his "sleeping beauty" as there has been a peak of interest in that paper only  in the last ten years. Takeshi's "Weyl character formula" was even the subject of a PROMYS research project in the summer of 2013, which led to a paper that generalizes that formula to the Hall-Littlewood polynomials. The talk surveyed many interesting topics and connections with alternating sign matrices, computation of Boltzmann weights, and crystal bases.

The second half of the Theory Day 2018 was devoted to three short presentations by ICE-TCS researchers devoted to research highlights from the centre. Antonis Achilleos set himself the goal of presenting two and a half years worth of research on monitorability, carried out within the framework of the TheoFoMon project, in 15 minutes. Tigran Tonoyan presented joint work with former ICE-TCS postdoc Christian Konrad addressing the question of whether randomness helps in guessing the middle point of an on-line sequence. (Answer: It does.) Last, but not least, Christian Bean gave an overview of an ongoing project whose goal is to automate proofs of results in enumerative combinatorics. Christian presented many examples of published theorems, some of which from 2018, that can be established using their CombSpecSearcher algorithm and that were previously obtained using human ingenuity.
 
The Theory Day was preceded by a seminar by Tami Tamir (Efi Arazi School of Computer Science, The Interdisciplinary Center) on Thursday, 23 August 2018. In her talk, Tami gave an excellent introduction to the main research questions in  algorithmic game theory, introduced network formation games and discussed her work with Guy Avni and Orna Kupferman on automata formation games, where the goal of each player is given by a regular language rather than by simple reachability objectives. Tami focused on results presented in this paper, which were mostly of a negative nature. She concluded her informative and entertaining presentation by introducing her university, the Efi Arazi School of Computer Science and how they try to tackle the gender issues in computer science.

Overall, this was another good edition of the Theory Day at ICE-TCS. When we founded the centre on the 29th of April 2005, I had no idea that it would see so many installments of this event. I feel fortunate to have taken part in organizing them, to have worked with so many great colleagues in Iceland and to have met many very interesting and inspiring people along the way. Stay tuned for the Theory Day 2019, which will most likely be held in the spring of next year.
 

Tuesday, August 07, 2018

2018 Women@McKinsey Dissertation Award to GSSI alumna Yllka Velaj

GSSI alumna Yllka Velaj has been selected as co-recipient of the 2018 Women@McKinsey Dissertation Award (https://www.mckinsey.it/womenmckinsey-dissertation-award), which is given to a female researcher for a master or doctoral thesis on themes related to Advanced Data Analytics or Machine Learning. Yllka receives the award for her PhD thesis "Information spreading with network augmentation" that she completed at the GSSI under the supervision of Pierluigi Crescenzi (University of Florence) and Gianlorenzo D'Angelo (GSSI). The award comes with a job offer by McKinsey & Company, and with financial support to attend the Open Data Science Conference 2018, which will be held in London in the period 19-22 September 2018.

Citing the explanation of her work given by Yllka in the CWI press release:
"Understanding the dynamics that regulate the diffusion of information in complex networks has been one of the main goals in the field of complex network analysis. The problem, which is also known as influence spreading or information diffusion problem, is motivated by many applications in different fields: from marketing to epidemiology, going through the study of adoption of innovations and the analysis of social networks. In my PhD thesis, I designed new efficient algorithms which use a given budget to suggest new links to be added to the network in order to maximize the diffusion of information”.

Yllka is an Italian scientist of Albanian origin. She obtained her BSc in Computer Science and her MSc in Distributed Systems and Computer Networks from the University of L'Aquila. She was a PhD student in Computer Science in the joint PhD GSSI-IMT programme at the Gran Sasso Science Institute. After one year as a postdoctoral researcher at the University of Chieti-Pescara, in May 2018 she joined the Networks & Optimization group at CWI in Amsterdam as a winner of the fellowship programme promoted by ERCIM - the European Research Consortium for Informatics and Mathematics.

Yllka's research interests include combinatorial algorithms, network analysis, algorithm engineering and recently also algorithmic game theory.

Congratulations to Yllka, her supervisors and the CS group at the GSSI as a whole.

Monday, July 23, 2018

Call for expressions of interest for a Full Professor Position in Algorithms at the Gran Sasso Science Institute

This call for expressions of interest for a Full Professor Position in Algorithms at the Gran Sasso Science Institute might be relevant for you or for some of your colleagues. Please distribute it as you see fit. The announcement is also here.

Gran Sasso Science Institute  Computer Science Group
Expression of Interest for a Full Professor Position in Algorithms
The Gran Sasso Science Institute (GSSI  http://www.gssi.it) is a new, ambitious Centre for Advanced Studies and PhD School established in L'Aquila (Italy).
The Computer Science Group at the GSSI (http://cs.gssi.it/) invites expressions of interest for a permanent position in Algorithms at the level of Full Professor.
Candidates must have an excellent publication record, a clear potential to promote and lead research activities, and a specific interest in teaching skilled, internationally-recruited students at the postgraduate level.
Applications Applicants should submit their expression of interest by sending
  • a motivation letter,
  • a curriculum vitae,
  • a list of publications and
  • a brief research statement.
Applications (and questions regarding the application process) must be submitted in electronic form, preferably by Friday, 7 September 2018, to eoi-cs@gssi.it.
Disclaimer Please note that this is not a job advertisement. Based on the received expressions of interest, the Gran Sasso Science Institute will decide whether to open an official call for a full professor position in algorithms and which selection procedure to follow.
Additional information
  1. Duties: Teaching postgraduate courses, leading internal seminars and tutoring PhD students. All activities are in English.
  2. Salary: The salary will be determined on a personal basis, also taking into account past positions covered abroad. An indicative figure of the gross amount for the starting (minimum) salary is 72,431 € per year. Net income may vary depending on income taxes, local taxes, retirement plan, health care deduction and tax exemptions. Professors who have held a tenured position outside Italy for more than three years (at the corresponding level) might be eligible for a partial recognition of past services, depending on specific legal constraints.