***********
Please register and attend HIGHLIGHTS 2018!
The programme is here:
https://easychair.org/smart-program/Highlights2018/index.html
***************
HIGHLIGHTS 2018: 6th annual conference on Highlights of LOGIC, GAMES, and
AUTOMATA
18-21 September 2018, TU Berlin
http://highlights-conference.org
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. The speakers are encouraged to present their 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
(Speakers: Stefan Kiefer, David Parker)
+ Chair: Martin Grohe, Logic and Learning (Speakers: Kristian Kersting,
Daniel Neider, Dan Olteanu)
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
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
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
[Apologies for multiple copies.]
We hereby solicit applications for PhD studentships and postdoctoral
research positions in the area of verifying probabilistic programs. The
positions are all available within the Chair on Software Modelling and
Verification at the RWTH Aachen University, Germany, which is led by
Joost-Pieter Katoen, see:
https://moves.rwth-aachen.de
The positions are funded by the recently acquired ERC Advanced Grant
"Formal Reasoning about Probabilistic Programs (FRAPPANT)".
*** What is this project all about? ***
Probabilistic programs describe recipes on how to infer statistical
conclusions about data from a complex mixture of uncertain data and
real-world observations. They can represent probabilistic graphical
models beyond the capabilities of Bayesian networks and are expected
to have a major impact on machine intelligence.
The FRAPPANT project aims to develop formal program analysis techniques,
leveraging model checking, deductive verification, and static analysis
for probabilistic programs. Challenging problems such as checking
program equivalence, loop-invariant and parameter synthesis, program
repair, program robustness and exact Bayesian inference using weakest
precondition reasoning will be tackled. The developed techniques will be
evaluated in the context of probabilistic graphical models, randomised
algorithms, and autonomous robots.
*** Your required profile ***
Applicants for a PhD position have (or soon obtain) a master degree in
Computer Science, Mathematics or related area and have completed their
studies with excellent grades. Applicants for a postdoctoral researcher
position have in addition completed a PhD in one of the aforementioned
areas and have a good publication track record. Candidates should have
an interest in performing original, highly competitive scientific
research within a research group, publishing your results in top
conferences and scientific journals. Fluency in English is required;
proficiency in German is helpful but not compulsory.
*** What do we offer? ***
We offer a stimulating international research environment, the
possibility to participate in highly competitive and interdisciplinary
research and the opportunity to involve students in your research
through project work. Doctoral and postdoctoral researchers have a
status as employee with a salary according to the German federal
employee scale TV-L E13 or E14 depending on your experience; the exact
salary is subject to your family situation.
The positions are funded for two years with a possible extension of
another two years. The positions are available from November 1, 2018,
but there is flexibility w.r.t. the starting date. RWTH Aachen
University offers excellent facilities for professional and personal
development.
*** How to apply? ***
Your application should contain: a curriculum vitae, a transcript of
records (list of courses and grades), and two references. Please send
your application as a single pdf-file ultimately by ** June 22, 2018
(AoE) ** to: katoen(a)cs.rwth-aachen.de.
Enquiries can be send to Joost-Pieter Katoen (e-mail:
katoen(a)cs.rwth-aachen.de).
RWTH Aachen University is certified as a “Family-Friendly University”.
We particularly welcome and encourage applications from women, disabled
persons and ethnic minority groups, recognizing they are
underrepresented across RWTH Aachen University. The principles of fair
and open competition apply and appointments will be made on merit.
The Theoretical Computer Science Group (Prof. Barbara Koenig) at the
University of Duisburg-Essen, Campus Duisburg (Germany) has two open
PhD positions paid according to TV-L 13 (full-time).
The first position is in the DFG project BEMEGA ("Behavioural
Equivalences: Environmental Aspects, Metrics and Generic Algorithms"),
which has been recently extended. For this position, candidates at
post-doc level can also be considered.
The second position is in the research training group UCSM
("User-Centred Social Media"), which provides an interdisciplinary
research environment with computer science and psychology as the main
contributing disciplines.
Requirements
------------
You should have or should be in the process of obtaining a MSc or
equivalent degree (in Computer Science or Mathematics). Prior
knowledge about the topics of the projects is considered an
advantage. Good English speaking and writing skills are demanded, as
well as the willingness to learn German.
DFG Project BEMEGA - Behavioural Equivalences: Environmental Aspects,
Metrics and Generic Algorithms
----------------------------------------------------------------------
Behavioural equivalences are an important concept for the analysis and
verification of concurrent systems. Two processes or system states are
behaviourally equivalent if they are indistinguishable from the point
of view of an external observer. Depending on the power that is given
to the observer, one obtains different notions such as strong and weak
bisimilarity or trace equivalence.
The purpose of this project is to gain a general view on the notion of
behavioural equivalences and, independently of the specific type of a
system, to provide advanced concepts, methods and algorithms for
behavioural equivalences.
In particular, we work on the following topics:
* Environmental Aspects and Side Effects (environmental and
context-dependent aspects of behavioural equivalences, explicit vs.
implicit branching)
* Metrics and Distances (measuring the behavioural distance of
system states)
* Logics and Games
* Generic Algorithms (for minimization, determinization, up-to techniques,
computation of behavioural distances)
* Tools and Applications
The application deadline is 21 May 2018.
http://www.ti.inf.uni-due.de/en/research/bemega/
======================================================================
Research Training Group UCSM - User-Centred Social Media
----------------------------------------------------------------------
The research training group (RTG) UCSM provides an interdisciplinary
research environment with computer science and psychology as the main
contributing disciplines. From this interdisciplinary perspective, it
addresses research challenges related to Social Media which are
understood as complex socio-technical systems characterized by
features such as user-generated content, social interaction and
awareness, and emergent functionality. Significant research gaps have
been identified with respect to analyzing and understanding the
characteristics and determinants of user behaviour, both at the
individual and the collective level, as well as regarding the
user-centred design of social media systems.
The planned PhD topic which will be supervised by me is called
"Handling Uncertainty when Analysing and Observing Social Media".
The application deadline is 15 May 2018.
https://ucsm.info/open-positions
======================================================================
Your Application
----------------
You can obtain further information by adressing your enquiries to:
Barbara Koenig
barbara_koenig(a)uni-due.de
tel.: ++49-203-3793397
If you are interested in the position, please send your
application. Your application should include:
* A description of your interest in the project, including your
motivation and specific qualifications.
* A curriculum vitae, including an abstract of your graduate thesis
and the name of your supervisor.
* If you are interested in a post-doc position, please include
a list of your publications and the names of possible referees.
For the first position, please send your application directly to me
(barbara_koenig(a)uni-due.de), for the second position, please apply via
the web page of the research training group
(https://ucsm.info/open-positions).
[apologies for multiple copies of this CfP]
Final Call: CONCUR 2018
The 29th International Conference on Concurrency Theory
Beijing, China, September 4-7, 2018
http://lcs.ios.ac.cn/concur2018/
The purpose of the CONCUR conferences is to bring together
researchers, developers, and students in order to advance the theory
of concurrency, and promote its applications.
Invited speakers
* Moshe Vardi, Rice University (USA)
* Yuxin Deng, East China Normal University (China)
* Rob van Glabbeek, Stanford University (USA), CSIRO,
and University of New South Wales (Australia)
* Bow-Yaw Wang, Academia Sinica (Taiwan)
Co-located events at CONFESTA
* 16th International Conference on Formal Modelling and Analysis of
Timed Systems (FORMATS 2018)
* 15th International Conference on Quantitative Evaluation of SysTems
(QEST 2018)
* 4th International Symposium on Dependable Software Engineering
(SETTA 2018)
* CONFESTA will also host a number of workshops and tutorials (TBA).
IMPORTANT DATES
All dates are AoE.
* Abstract submission: April 17, 2018 (firm)
* Paper submission: April 23, 2018 (firm
* Notification: June 7, 2018
* Camera ready copy: July 2, 2018
* Conference: September 4-7, 2018
TOPICS
Submissions are solicited in semantics, logics, verification and
analysis of concurrent systems. The principal topics include (but are
not limited to):
* Basic models of concurrency such as abstract machines,
domain-theoretic models, game-theoretic models, process algebras,
graph transformation systems, Petri nets, hybrid systems, mobile and
collaborative systems, probabilistic systems, real-time systems,
biology-inspired systems, and synchronous systems;
* Logics for concurrency such as modal logics, probabilistic and
stochastic logics, temporal logics, and resource logics;
* Verification and analysis techniques for concurrent systems such as
abstract interpretation, atomicity checking, model checking, race
detection, pre-order and equivalence checking, run-time
verification, state-space exploration, static analysis, synthesis,
testing, theorem proving, type systems, and security analysis;
* Distributed algorithms and data structures: design, analysis,
complexity, correctness, fault tolerance, reliability, availability,
consistency, self-organization, self-stabilization, protocols.
* Theoretical foundations of architectures, execution environments,
and software development for concurrent systems such as
geo-replicated systems, communication networks, multiprocessor and
multi-core architectures, shared and transactional memory, resource
management and awareness, compilers and tools for concurrent
programming, programming models such as component-based, object- and
service-oriented.
PAPER SUBMISSION
CONCUR 2018 solicits high quality papers reporting research results
and/or experience related to the topics mentioned below. All papers
must be original, unpublished, and not submitted for publication
elsewhere.
Each paper will undergo a thorough review process. If necessary, the
paper may be supplemented with a clearly marked appendix, which will
be reviewed at the discretion of the program committee.
The CONCUR 2018 proceedings will be published by LIPIcs.
Papers must be submitted electronically as PDF files via EasyChair.
Papers must not exceed 14 pages (excluding references and clearly marked
appendices) using the LIPIcs style.
Extended versions of selected papers will appear in a special issue of
the Journal of Computer and System Sciences (JCSS).
ORGANIZATION COMMITTEE
General Chair
* Huimin Lin (Institute of Software, Chinese Academy of Sciences, China)
Program Co-chairs
* Sven Schewe (University of Liverpool, UK)
* Lijun Zhang (Institute of Software, CAS, China)
PROGRAM COMMITTEE
* Parosh Abdulla
Uppsala University (Sweden)
* Christel Baier
TU Dresden (Germany)
* Roderick Bloem
Graz University of Technology (Austria)
* Ahmed Bouajjani
IRIF, University Paris Diderot (France)
* Franck van Breugel
York University (Canada)
* Taolue Chen
Birkbeck, University of London (UK)
* Yu-Fang Chen
Academia Sinica (Taiwan)
* Alessandro Cimatti
Fondazione Bruno Kessler (Italy)
* Pedro R. D'Argenio
Universidad Nacional de Córdoba - CONICET (Argentina)
* Josée Desharnais
Université Laval (Canada)
* Wan Fokkink
Vrije Universiteit Amsterdam (The Netherlands)
* Erich Grädel
RWTH Aachen University (Germany)
* Ichiro Hasuo
National Institute of Informatics (Japan)
* Fei He
Tsinghua University (China)
* Anna Ingólfsdóttir
Reykjavík University (Iceland)
* Stefan Kiefer
University of Oxford (UK)
* Shankara Narayanan Krishna
IIT Bombay (India)
* Antonín Kučera
Masaryk University (Czech Republic)
* Salvatore La Torre
Università degli studi di Salerno (Italy)
* Jérôme Leroux
CNRS (France)
* Parthasarathy Madhusudan
University of Illinois at Urbana-Champaign (USA)
* Rupak Majumdar
MPI-SWS (Germany)
* Radu Mardare
Aalborg University (Denmark)
* Roland Meyer
TU Braunschweig (Germany)
* Angelo Montanari
University of Udine (Italy)
* Sriram Sankaranarayanan
University of Colorado, Boulder (USA)
* Sven Schewe (co-chair)
University of Liverpool (UK)
* Alexandra Silva
University College London (UK)
* Ana Sokolova
University of Salzburg (Austria)
* Mariëlle Stoelinga
University of Twente (The Netherlands)
* Verena Wolf
Saarland University (Germany)
* Lijun Zhang (co-chair)
Institute of Software, Chinese Academy of Sciences (China)
Last updated: Wednesday, 14 March 2018
Dear Colleagues,
please find enclosed the protocol of the business meeting.
Many thanks to Javier for hosting D-CON 2019 in Munich!
Best regards
Roland
--
Prof. Dr. Roland Meyer
TU Braunschweig
Institut für Theoretische Informatik
Mühlenpfordtstr. 23, 346
38106 Braunschweig
Phone: +49 (0)531 391 9524
Fax: +49 (0)531 391 9529
Web: http://www.tcs.cs.tu-bs.de