D-CON June 2018

d-con@lists.rwth-aachen.de

2 participants
2 discussions

Doctoral/postdoctoral positions at the Technical University of Munich

by Javier Esparza

The Chair for Foundations of Software Reliability of the Technical University of Munich (TUM), led by Javier Esparza, is inviting applications for a doctoral and a postdoctoral research scholar. The positions are funded by the ERC Advanced Grant "Parameterized Verification and Synthesis". We are looking for excellent junior researchers in any of the following areas: algorithmic analysis of systems (model checking, static analysis); logical and automata-theoretical approaches to formal verification and automatic synthesis; and concurrency theory, in particular the theory of Petri nets and Vector Addition Systems. For one of the positions we are especially interested in candidates with experience in tool building. The positions are funded for 2 years with the option of an extension for another two. Applicants must have completed a degree in computer science, mathematics, of electrical engineering, and must have demonstrated strong interest in research. In addition to pursuing a strong research program, the scholars are expected to contribute to mentoring students. TUM provides excellent working conditions in a lively scientific community. The Chair for Foundations of Software Reliability maintains an open, international, and diverse work environment. Current members come from six different countries in three continents. There is generous travel support available for all chair members. Our working language is English. For your application send your CV and 3 references to esparza(a)in.tum.de and link(a)in.tum.de. For the postdoctoral position add a summary of your current reseach ideas. Please contact Javier Esparza at esparza(a)in.tum.de with any questions. The positions are available from September 1, 2018, but a later start is possible. Reviewing of applications will commence on 15 June, 2018 and applicants are encouraged to apply by this deadline. However, applications will be accepted until the positions are filled. -- Prof. Javier Esparza Faculty of Computer Science Technical University of Munich Boltzmannstr. 3, 85748 Garching

5 years, 6 months

HIGHLIGHTS 2018: 1st Call for Presentations

by Barbara Koenig

HIGHLIGHTS 2018: 1st Call for Presentations HIGHLIGHTS 2018: 6th annual conference on Highlights of LOGIC, GAMES, and AUTOMATA 18-21 September 2018, TU Berlin http://highlights-conference.org IMPORTANT DATES: + Submission deadline: 13 JUNE, 5pm GMT + Notification: 22 JUNE SATELLITE EVENTS: + ErichFest: Symposium to Celebrate Erich Grädel’s 60th Birthday, 17 September + Workshop on the Theory of Regular Cost Functions and Beyond, 21 September (afternoon) ================================================ HIGHLIGHTS 2018 is the 6th conference on Highlights of Logic, Games, and Automata that aims to integrate the diverse research community working in the areas of Logic and Finite Model Theory, Automata Theory, and Games for Logic and Verification. Individual papers are dispersed across many conferences, which makes them challenging to follow. A visit to the annual Highlights conference offers a wide picture of the latest research in the field and a chance to meet and interact with most of the members of the research community. We encourage you to present your best recent work at Highlights, whether already published elsewhere or not. The conference is short (from 19 September to the mid-day on 21 September) and it is preceded by the Highlights Tutorial Day (18 September). The participation costs are modest and Berlin is easy to reach. The Contributed Presentations will be around ten minutes long. All speakers will be also invited to contribute to a Poster Session, which will open new ways of interaction at the conference for the whole Highlights community. KEYNOTE PRESENTATIONS + Andrei Bulatov, The Complexity of Constraints: Dichotomies and Beyond + Nicole Schweikardt, Constant Delay Enumeration of Query Results + James Worrell, Algebraic Invariants for Affine Programs TUTORIALS + Amir Abboud, Fine-Grained Complexity and Hardness in P + Christoph Berkholz, Interactions Between Proof Complexity and Finite Model Theory + Joost-Pieter Katoen, Principles of Probabilistic Programming INVITED SESSIONS + Chair: Christel Baier, Multi-Objective Reasoning in Probabilistic Models + Chair: Martin Grohe, Logic and Learning SPOTLIGHT TALKS + Stéphane Gaubert, Nonarchimedean Convex Programming and Its Relation to Mean-Payoff Games + Laura Kovács, Symbol Elimination for Program Analysis + Jan Křetínský, A Journey from LTL to Your Favourite Automaton + Amaury Pouly, Continuous Models of Computation: Computability, Complexity, Universality + Jeffrey Shallit, Finite Automata and Additive Number Theory

5 years, 6 months

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

D-CON June 2018