The IRIF lab in Paris and the LABRI lab in Bordeaux, France have funding
for a co-supervised PhD studentship in database theory starting in 2019.
IRIF and LABRI are both very strong internationally renown research
environments, hosting leading groups in several areas of theoretical
computer science. For more information about the two labs please visit IRIF
and LABRI.
The PhD topic is in the area of foundations of data management, focusing on
querying inconsistent data.
Data management systems nowadays need to handle large data sets often
containing inconsistent or incomplete information, and yet guarantee the
relevance of query answers. New techniques are needed for making data
access more reliable, and new tools are required for making data querying
more efficient in this context.
The main focus of the PhD will be the study of consistent query answering.
In this scenario the data set may have inconsistencies relative to
integrity constraints (e.g., key and foreign key constraints, functional
dependencies, inclusion constraints, etc.). Queries issued on the database
need to be answered despite the inconsistencies. The goal is to provide
only consistent answers, i.e. answers that can be be found after virtually
repairing the database to remove inconsistencies. As many repairs may exist
for a given database, the widely accepted notion is the one of certain
answers, i.e. answers that can be found in all possible database repairs.
The challenge is then to provide efficient algorithms for computing certain
answers directly from the inconsistent database, as going through all
possible repairs is clearly unfeasible. Particularly attractive is the
possibility of obtaining certain answers by query rewriting, i.e. by
issuing on the inconsistent database a new query with good computational
properties. Despite a rich literature on the topic (see [1,2,3] for
instance) many questions remain open even for simple classes of queries and
constraints, such as conjunctive queries and primary key constraints.
This PhD topic is part of a larger projet QUID (Efficient Querying for
Incomplete and Inconsistent Data), funded by the French research agency
ANR, starting in 2019. The project involves researchers from two other
research labs in France: École Normale Supérieure (Paris) and the Institut
Gaspard Monge (Marne-la-Vallée), and it studies certain answers in relation
to three scenarios: ensuring data privacy, querying inconsistent data, and
querying incomplete data. All these settings share the notion of certains
answers used to answer queries over all possible plausible interpretations
of an inconsistent, incomplete or partially specified data.
The PhD student will also be welcome to contribute to the other topics of
the project.
Requirements
Candidates should have a strong background in theoretical computer science,
preferably in automata, logic, verification, or finite model theory. Some
prior knowledge of database theory and systems is also a plus.
Position
The funding is for a 3-year full time position. The PhD must start during
2019; the precise starting date is to some extent negotiable. The PhD
student will be co-supervised by Paris and Bordeaux, and is expected to
spend time in both sites. Teaching is not mandatory but can be arranged
upon request.
Contacts
Informal enquiries about this position are welcome and should be sent to
both Diego Figueira (diego.figueira(a)labri.fr) and Cristina Sirangelo (
cristina(a)irif.fr).
[1] L.Bertossi. Database Repairing and Consistent Query Answering Synthesis
Lectures on Data Management. Morgan & Claypool Publishers
[2] P. Koutris, J.Wijsen. (2017) Consistent Query Answering for
Self-Join-Free Conjunctive Queries Under Primary Key Constraints. ACM
Transactions on Database Systems 42:2, 1-45.
[3] C.Lutz, F.Wolter. On the Relationship between Consistent Query
Answering and Constraint Satisfaction Problems. ICDT 2015: 363-379
STACS 2019 - Call for papers
36th International Symposium on Theoretical Aspects of Computer Science
March 13—16, 2019, TU Berlin, Berlin, Germany
Authors are invited to submit papers presenting original and unpublished
research on theoretical aspects of computer science. Typical areas
include (but are not limited to):
* algorithms and data structures,
including: design of parallel, distributed, approximation,
parameterized and randomized algorithms; analysis of algorithms and
combinatorics of data structures; computational geometry,
cryptography, algorithmic learning theory, algorithmic game theory;
* automata and formal languages,
including: algebraic and categorical methods, coding theory;
* complexity and computability,
including: computational and structural complexity theory,
parameterized complexity, randomness in computation;
* logic in computer science,
including: finite model theory, database theory, semantics,
specification verification, rewriting and deduction;
* current challenges,
for example: natural computing, quantum computing, mobile and net
computing, computational social choice.
INVITED SPEAKERS
Leslie Ann Goldberg (Oxford),
"Computational Complexity and the Independence Polynomial"
Anca Muscholl (Bordeaux),
"The Many Facets of String Transducers"
Petra Mutzel (Dortmund),
"Algorithmic Data Analysis"
PROGRAM COMMITTEE
Christoph Berkholz (Berlin)
Benedikt Bollig (Cachan)
Karl Bringmann (Saarbrücken)
Gerth Stølting Brodal (Aarhus)
Maike Buchin (Bochum)
David Eppstein (Irvine)
Serge Gaspers (Sydney)
Edward Hirsch (St. Petersburg)
Telikepalli Kavitha (Mumbai)
Hartmut Klauck (Singapore)
Antonín Kučera (Brno)
K Narayan Kumar (Chennai)
Dietrich Kuske (Ilmenau)
Jérôme Lang (Paris)
Sophie Laplante (Paris)
Kazuhisa Makino (Kyoto)
Barnaby Martin (Durham)
Cyril Nicaud (Marne-la-Vallée)
Rolf Niedermeier (Berlin, co-chair)
Jakob Nordström (Stockholm)
Christophe Paul (Montpellier, co-chair)
Pascal Schweitzer (Kaiserslautern)
Shinnosuke Seki (Tokyo)
Michał Skrzypczak (Warsaw)
Srikanth Srinivasan (Mumbai)
Jan Arne Telle (Bergen)
Denis Trystram (Grenoble)
Takeaki Uno (Tokyo)
Mikhail Volkov (Ekaterinburg)
Stefan Woltran (Wien)
TUTORIALS
There will be the following two tutorials taking place on March 13, 2019:
Tobias Friedrich (HPI Potsdam):
"Network Science"
Karl Bringmann (MPI Saarbrücken):
"Fine-Grained Complexity Theory"
SUBMISSIONS
Submissions can be uploaded to EasyChair:
https://easychair.org/conferences/?conf=stacs2019.
Authors are invited to submit a draft of a full paper with at most 12
pages (excluding the title page and the references section).
The title page consists exclusively of the title of the paper, author
information, and abstract.
The usage of pdflatex and the LIPIcs style file (see
http://www.dagstuhl.de/en/publications/lipics) are mandatory; no changes
to font size, page geometry, etc. are permitted.
Submissions not in the correct format or submitted after the deadline
will not be considered.
The paper should contain a succinct statement of the issues and of their
motivation, a summary of the main results, and a brief explanation of
their significance, accessible to non-specialist readers.
Proofs omitted due to space constraints must be put into an appendix, to
be read by the program committee members at their discretion.
Simultaneous submission to other conferences with published proceedings
or to journals is not allowed. PC members are excluded from submitting.
There will be a rebuttal period for authors between November 26—29, 2018.
Authors will receive the reviews of their submissions (via EasyChair)
and have three days to submit rebuttals (via EasyChair).
These rebuttals become part of the PC meeting, but entail no specific
responses.
PROCEEDINGS
Accepted papers will be published in the proceedings of the symposium.
As usual, these proceedings will appear in the Leibniz International
Proceedings in Informatics (LIPIcs) series, based at Schloss Dagstuhl.
This guarantees perennial, free and easy electronic access, while the
authors retain the rights over their work. With their submission,
authors consent to sign a license authorizing the program committee
chairs to organize the electronic publication of their paper, provided
the paper is accepted.
IMPORTANT DATES
* Deadline for submissions: October 1, 2018 (AoE)
* Rebuttal: November 26–29, 2018
* Author notification: December 20, 2018
* Final version: January 16, 2019
* STACS 2019: March 13–16, 2019
CONTACT INFORMATION
Web: https://stacs2019.akt.tu-berlin.de/
Email: stacs2019(a)akt.tu-berlin.de
LATA 2019: 1st call for papers*To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line*
*************************************************************************
13th INTERNATIONAL CONFERENCE ON LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS
LATA 2019
Saint Petersburg, Russia
March 25-29, 2019
Organized by:
Saint Petersburg State University
and
Institute for Research Development, Training and Advice, Brussels/London
http://lata2019.irdta.eu/
*************************************************************************
AIMS:
LATA is a conference series on theoretical computer science and its applications. LATA 2019 will reserve significant room for young scholars at the beginning of their career. It will aim at attracting contributions from classical theory fields as well as application areas.
VENUE:
LATA 2019 will take place in Saint Petersburg, whose historic centre is a UNESCO World Heritage Site. The venue will be Saint Petersburg State University.
SCOPE:
Topics of either theoretical or applied interest include, but are not limited to:
algebraic language theory
algorithms for semi-structured data mining
algorithms on automata and words
automata and logic
automata for system analysis and programme verification
automata networks
automatic structures
codes
combinatorics on words
computational complexity
concurrency and Petri nets
data and image compression
descriptional complexity
foundations of finite state technology
foundations of XML
grammars (Chomsky hierarchy, contextual, unification, categorial, etc.)
grammatical inference and algorithmic learning
graphs and graph transformation
language varieties and semigroups
language-based cryptography
mathematical and logical foundations of programming methodologies
parallel and regulated rewriting
parsing
patterns
power series
string processing algorithms
symbolic dynamics
term rewriting
transducers
trees, tree languages and tree automata
weighted automata
STRUCTURE:
LATA 2019 will consist of:
invited talks
peer-reviewed contributions
INVITED SPEAKERS:
tba
PROGRAMME COMMITTEE:
Krishnendu Chatterjee (Institute of Science and Technology Austria, AT)
Bruno Courcelle (University of Bordeaux, FR)
Manfred Droste (University of Leipzig, DE)
Travis Gagie (Diego Portales University, CL)
Peter Habermehl (Paris Diderot University, FR)
Tero Harju (University of Turku, FI)
Radu Iosif (Verimag, FR)
Kazuo Iwama (Kyoto University, JP)
Juhani Karhumäki (University of Turku, FI)
Lila Kari (University of Waterloo, CA)
Juha Kärkkäinen (University of Helsinki, FI)
Bakhadyr Khoussainov (University of Auckland, NZ)
Sergey Kitaev (University of Strathclyde, UK)
Shmuel Tomi Klein (Bar-Ilan University, IL)
Olga Kouchnarenko (University of Franche-Comté, FR)
Thierry Lecroq (University of Rouen, FR)
Markus Lohrey (University of Siegen, DE)
Sebastian Maneth (University of Bremen, DE)
Carlos Martín-Vide (Rovira i Virgili University, ES, chair)
Giancarlo Mauri (University of Milano-Bicocca, IT)
Filippo Mignosi (University of L'Aquila, IT)
Victor Mitrana (Polytechnic University of Madrid, ES)
Joachim Niehren (INRIA Lille, FR)
Alexander Okhotin (Saint Petersburg State University, RU)
Dominique Perrin (University of Paris-Est, FR)
Matteo Pradella (Polytechnic University of Milan, IT)
Jean-François Raskin (Université Libre de Bruxelles, BE)
Marco Roveri (Bruno Kessler Foundation, IT)
Wojciech Rytter (University of Warsaw, PL)
Kai Salomaa (Queen's University, CA)
Sven Schewe (University of Liverpool, UK)
Helmut Seidl (Technical University of Munich, DE)
Ayumi Shinohara (Tohoku University, JP)
Hans Ulrich Simon (Ruhr-University of Bochum, DE)
William F. Smyth (McMaster University, CA)
Frank Stephan (National University of Singapore, SG)
Martin Sulzmann (Karlsruhe University of Applied Sciences, DE)
Jorma Tarhio (Aalto University, FI)
Stefano Tonetta (Bruno Kessler Foundation, IT)
Rob van Glabbeek (University of New South Wales, AU)
Margus Veanes (Microsoft Research, US)
Mahesh Viswanathan (University of Illinois, Urbana-Champaign, US)
Mikhail Volkov (Ural Federal University, RU)
Fang Yu (National Chengchi University, TW)
Hans Zantema (Eindhoven University of Technology, NL)
ORGANIZING COMMITTEE:
Alexander Okhotin (Saint Petersburg, co-chair)
Manuel Parra-Royón (Granada)
Dana Shapira (Ariel)
David Silva (London, co-chair)
SUBMISSIONS:
Authors are invited to submit non-anonymized papers in English presenting original and unpublished research. Papers should not exceed 12 single-spaced pages (all included) and should be prepared according to the standard format for Springer Verlag's LNCS series (see http://www.springer.com/computer/lncs?SGWID=0-164-6-793341-0). If necessary, exceptionally authors are allowed to provide missing proofs in a clearly marked appendix.
Submissions have to be uploaded to:
https://easychair.org/conferences/?conf=lata2019
PUBLICATIONS:
A volume of proceedings published by Springer in the LNCS series will be available by the time of the conference.
A special issue of a major journal will be later published containing peer-reviewed substantially extended versions of some of the papers contributed to the conference. Submissions to it will be by invitation.
REGISTRATION:
The registration form can be found at:
http://lata2019.irdta.eu/Registration.php
DEADLINES (all at 23:59 CET):
Paper submission: November 11, 2018
Notification of paper acceptance or rejection: December 16, 2018
Final version of the paper for the LNCS proceedings: December 23, 2018
Early registration: December 23, 2018
Late registration: March 11, 2019
Submission to the journal special issue: June 29, 2019
QUESTIONS AND FURTHER INFORMATION:
david (at) irdta.eu
ACKNOWLEDGMENTS:
Санкт-Петербургский государственный университет
IRDTA – Institute for Research Development, Training and Advice, Brussels/London
[Apologies if you receive multiple copies of this email. Please distribute
to interested parties.]
Female students in the field of computer science (CS) who plan to pursue (or
are currently pursuing) one of the masters programs in Computer Science at
the Vienna University of Technology TU Wien taught in English are invited
to apply for the annually awarded Helmut Veith Stipend. The computer science
department at Vienna University of Technology TU Wien, has been ranked
among the 70 world´s best (THE Times Higher Education Ranking).
The annually awarded Helmut Veith Stipend for female master students is
dedicated to the memory of an outstanding computer scientist who worked in
the fields of logic in computer science, computer-aided verification,
software engineering, and computer security. Professor Helmut Veith
(1971-2016).
The Helmut Veith Stipend was established with generous support of TU Wien,
Wolfgang Pauli Institute and with contributions by family and friends of the
late Helmut Veith.
BENEFITS
-EUR 6000 per year
-Waiver of tuition fees at TU Wien
LOCATION OF MASTER STUDY
For study in Austria, at Vienna University of Technology TU Wien
FOR FIELD OF STUDY
Applicants must be eligible for admission to one of the masters programs in
computer science at Vienna University of technology - TU Wien that are
taught in English.
In 2018/2019 and 2019/2020 those are:
Master in Logic and Computation
Master in Business Informatics;
Master in Computational Logic
Master in Computer Engineering (
<http://www.informatik.tuwien.ac.at/studium/angebot/master/technische-inform
atik> Technische Informatik)
APPLICATION
Applications for funding can be filed before or in parallel with the
admissions process. Your application must be submitted electronically to
master(a)logic-cs.at as a single PDF document, by November 30, 2018.
DEADLINE
November 30, 2018.
INQUIRES
Electronically to master(a)logic-cs.at
WEBSITE
http://www.vcla.at/2018/05/call-for-applications-helmut-veith-stipend-for-fe
male-masters-students-in-computer-science
DOWNLOAD THE FLYER
http://forsyte.at/helmut-veith-stipend/
(Apologies for duplicates)
Open Call for Papers
**************************************************************************
Postproceedings for ThEdu'18 by EPTCS
Theorem proving components for Educational software
http://www.uc.pt/en/congressos/thedu/thedu18
**************************************************************************
Workshop ThEdu at FLoC
Federated Logic Conference 2018
http://www.floc2018.org/
**************************************************************************
THedu'18 Postproceedings:
ThEdu's programme comprised seven contributions, presented also in the
webpages. Now postproceedings are planned to collect the contributions
upgraded to full papers. The contributions' topics are diverse according
to ThEdu's scope, and this is a call open for everyone, also those who
did not participate in the workshop. All papers will undergo review
according to EPTCS standards.
THedu'18 Scope:
Computer Theorem Proving is becoming a paradigm as well as a
technological base for a new generation of educational software in
science, technology, engineering and mathematics. The workshop brings
together experts in automated deduction with experts in education in
order to further clarify the shape of the new software generation and
to discuss existing systems.
Topics of interest include:
* methods of automated deduction applied to checking students' input;
* methods of automated deduction applied to prove post-conditions
for particular problem solutions;
* combinations of deduction and computation enabling systems to
propose next steps;
* automated provers specific for dynamic geometry systems;
* proof and proving in mathematics education.
Important Dates
* 2nd call for papers: 10 Sep 2018
* Submission (full papers): 18 Nov 2018
* Notification of acceptance: 17 Dec 2018
* Revised papers due: 21 Jan 2019
Submission
We welcome submission of papers presenting original unpublished work
which is not been submitted for publication elsewhere.
The authors should comply with the "instructions for authors", LaTeX
style files and accept the "Non-exclusive license to distribute" of
EPTCS:
Instructions for authors (http://info.eptcs.org/)
LaTeX style file and formatting instructions (http://style.eptcs.org/)
Copyright (http://copyright.eptcs.org/)
Papers should be submitted via easychair,
https://easychair.org/conferences/?conf=thedu18.
In case the contributions finally do not reach the standards of EPTCS
in number, there will be an alternative to publish as a techreport
at CISUC https://www.cisuc.uc.pt/publications.
Program Committee
Francisco Botana, University of Vigo at Pontevedra, Spain
Roman Hašek, University of South Bohemia, Czech Republic
Filip Maric, University of Belgrade, Serbia
Walther Neuper, Graz University of Technology, Austria (co-chair)
Pavel Pech, University of South Bohemia, Czech Republic
Pedro Quaresma, University of Coimbra, Portugal (co-chair)
Vanda Santos, CISUC, Portugal
Wolfgang Schreiner, Johannes Kepler University, Austria
--
Dr. Achim D. Brucker | Software Assurance & Security | University of Sheffield
https://www.brucker.ch | https://logicalhacking.com/blog
@adbrucker | @logicalhacking
CALL FOR PARTICIPATION
17th International Conference on
Relational and Algebraic Methods in Computer Science
RAMiCS 2018
29 October to 1 November 2018, Groningen, The Netherlands
http://www.ramics-conference.org/
GENERAL INFORMATION:
Recurrent topics of RAMiCS conferences, held since 1994, include semiring- and
lattice-based structures such as relation algebras and Kleene algebras, their
connections with program logics and other logics, their use in theories of
computing, their formalisation with theorem provers, and their application
to modelling and reasoning about computing systems and processes.
INVITED TALKS:
Philippa Gardner (Imperial College London, UK)
Scalable reasoning about concurrent programs
Manuel Bodirsky (Technische Universität Dresden, Germany)
Finite relation algebras with normal representations
Roland Backhouse (University of Nottingham, UK)
The importance of factorisation in algorithm design
ACCEPTED PAPERS:
Sarah Alexander, Peter Jipsen and Nadiya Upegui
On the structure of generalized effect algebras and separation algebras
Callum Bannister and Peter Höfner
False failure: creating failure models for separation logic
Stefano Bonzio, Michele Pra Baldi and Diego Valota
Counting finite linearly ordered involutive bisemilattices
Maximiliano Cristiá and Gianfranco Rossi
A set solver for finite set relation algebra
Jessica Ertel, Roland Glück and Bernhard Möller
Algebraic derivation of Until rules and application to timer verification
Simon Foster, Kangfeng Ye, Ana Cavalcanti and Jim Woodcock
Calculational verification of reactive programs with reactive relations and Kleene algebra
Malvin Gattinger and Jana Wagemaker
Towards an analysis of dynamic gossip in NetKAT
Roland Glück
Distances, norms and error propagation in idempotent semirings
Maria João Gouveia and Luigi Santocanale
MIX star-autonomous quantales and the continuous weak Bruhat order
Robin Hirsch
Decidability of equational theories for sub-signatures of relation algebra
Mark Hopkins and Hans Leiß
Coequalizers and tensor products for continuous idempotent semirings
Jonathan Huerta y Munive and Georg Struth
Verifying hybrid systems with modal Kleene algebra
Wolfram Kahl
Calculational relation-algebraic proofs in the teaching tool CalcCheck
Lefteris Kirousis, Phokion Kolaitis and John Livieratos
On the computational complexity of non-dictatorial aggregation
Dexter Kozen and Matvey Soloviev
Coalgebraic tools for randomness-conserving protocols
Nikolai Krivulin
Algebraic solution of weighted minimax single-facility constrained location problems
Pranab Kumar Ghosh and Michael Winter
A modal and relevance logic for qualitative spatial reasoning
Hans Leiß and Mark Hopkins
C-dioids and µ-continuous Chomsky-algebras
Koki Nishizawa and Norihiro Tsumagari
Composition of different-type relations via the Kleisli category for the continuation monad
Giulia Sindoni, Katsuhiko Sano and John G. Stell
Axiomatizing discrete spatial relations
Michael Winter
T-norm based operations in arrow categories
PROGRAMME:
http://www.ramics-conference.org/?page_id=270
REGISTRATION (early fee before 15 September 2018):
http://www.ramics-conference.org/?page_id=202
COMMITTEES:
Organising Committee
--------------------
Conference Chair: Stef Joosten, Open Universiteit, The Netherlands
PC Co-Chair: Jules Desharnais, Université Laval, Canada
PC Co-Chair: Walter Guttmann, University of Canterbury, New Zealand
Publicity Chair: Sebastiaan Joosten, Universiteit Twente, The Netherlands
Programme Committee
-------------------
Luca Aceto, Reykjavík University, Iceland/Gran Sasso Science Institute, Italy
Rudolf Berghammer, Christian-Albrechts-Universität zu Kiel, Germany
Jules Desharnais, Université Laval, Canada
Uli Fahrenberg, École Polytechnique, France
Hitoshi Furusawa, Kagoshima University, Japan
Walter Guttmann, University of Canterbury, New Zealand
Robin Hirsch, University College London, UK
Peter Höfner, Data61, CSIRO, Australia
Marcel Jackson, La Trobe University, Australia
Jean-Baptiste Jeannin, University of Michigan, USA
Peter Jipsen, Chapman University, USA
Stef Joosten, Open Universiteit, The Netherlands
Wolfram Kahl, McMaster University, Canada
Barbara König, Universität Duisburg-Essen, Germany
Dexter Kozen, Cornell University, USA
Agi Kurucz, King's College London, UK
Tadeusz Litak, Friedrich-Alexander Universität Erlangen-Nürnberg, Germany
Roger Maddux, Iowa State University, USA
Annabelle McIver, Macquarie University, Australia
Szabolcs Mikulás, Birkbeck, University of London, UK
Ali Mili, New Jersey Institute of Technology, USA
Bernhard Möller, Universität Augsburg, Germany
José N. Oliveira, Universidade do Minho, Portugal
Alessandra Palmigiano, Technische Universiteit Delft, The Netherlands
Damien Pous, CNRS, France
Mehrnoosh Sadrzadeh, Queen Mary University of London, UK
John Stell, University of Leeds, UK
Georg Struth, University of Sheffield, UK
Michael Winter, Brock University, Canada
LSFA 2018 - Call for Participation
13th Workshop on Logical and Semantic Frameworks, with Applications
26-28 September 2018
Fortaleza, Brazil
www.lia.ufc.br/~lsfa2018
=============================================================================
*** Early Registration Deadline: 31 August 2018 ***
*** List of accepted papers and registration information is available at
www.lia.ufc.br/~lsfa2018 ***
=============================================================================
The LSFA Community invites you to participate in the 13th Workshop on Logic
and Semantic Frameworks, with Application, LSFA 2018.
Logical and semantic frameworks are formal languages used to represent
logics,
languages and systems. These frameworks provide foundations for the formal
specification of systems and programming languages, supporting tool
development and reasoning.
Invited Speakers
+ Amy Felty, University of Ottawa
+ Andreas Herzig, CNRS, IRIT, Université de Toulouse
+ Yiannis Moschovakis, University of California, Los Angeles & University of
Athens
+ Alessandra Palmigiano, Delft University of Technology
Venue
Fortaleza is the state capital of Ceará, and 5th most preferred touristic
destination in Brazil. The conference will be hosted by the Department of
Computer Science of the Federal University of Ceará. Find more info on the
event's webpage: www.lia.ufc.br/~lsfa2018
Contact
lsfa2018 at lia [d] ufc [d] br
Ausschreibung (siehe auch https://www.tu-ilmenau.de/al/)
An der Fakultät für Informatik und Automatisierung ist im Fachgebiet
Automaten und Logik (Fachgebietsleiter Prof. Dr. Dietrich Kuske) zum
1. Oktober 2018 eine Stelle als
wissenschaftliche/r Mitarbeiter/in
für 3 Jahre zu besetzen. Die Vergütung erfolgt nach den Bestimmungen
der Tarifverträge für den öffentlichen Dienst der Länder (TV-L). Die
Stelle ist mit Entgeltgruppe E 13 bewertet.
Aufgabengebiete
• Es sollen Forschungsarbeiten an der Schnittstelle von Automatentheorie
und Logik bearbeitet werden.
• Es soll die Lehre im gesamten vom Fachgebiet angebotenen Spektrum,
insbesondere zur Automatentheorie und zur Logik in der Informatik,
unterstützt werden (Vorbereitung und Durchführung von Übungen;
Betreuung von Bachelor- und Masterarbeiten; Unterstützung bei der
Durchführung von Prüfungen).
• Die Übernahme von organisatorischen und Selbstverwaltungsaufgaben im
üblichen Rahmen wird erwartet.
Einstellungsvoraussetzungen
Wir erwarten von Ihnen:
• einen sehr guten wissenschaftlichen Hochschulabschluss in Informatik
oder Mathematik
• sehr gute Kenntnisse in Theoretischer Informatik, vorzugsweise in der
Automatentheorie oder der Logik
• Fähigkeit zur Veröffentlichung und Präsentation von Forschungsergebnissen
im internationalen Rahmen
• Bereitschaft zur selbständigen wissenschaftlichen Tätigkeit mit dem
Ziel der Weiterqualifikation
• sehr gute Deutschkenntnisse
Die befristete Beschäftigung erfolgt zur Förderung der eigenen
wissenschaftlichen Qualifizierung (Promotion).
Die TU Ilmenau ist Träger des TOTAL E-Quality-Prädikats. Sie fordert
Frauen nachdrücklich zur Bewerbung auf. Schwerbehinderte haben bei
gleicher Eignung, Befähigung und fachlicher Qualifikation Vorrang bei
der Einstellung.
Bewerbungen mit den üblichen Unterlagen (Bewerbungsschreiben,
Lebenslauf, Zeugniskopien, ggf. Referenzen) richten Sie bitte unter
der Kennziffer 73/2018 an die
Technische Universität Ilmenau
Dezernat für Personal und Recht
Postfach 10 05 65
98684 Ilmenau
Deutschland
bzw. an: bewerbung(a)tu-ilmenau.de. (Anlagen bitte im pdf-Format
zusammengefasst in einer Datei anfügen)
Eingehende Bewerbungen werden bis zum 1. September 2018
berücksichtigt.
Für weitere Informationen können Sie sich gerne an Professor Kuske
(dietrich.kuske(a)tu-ilmenau.de), wenden (auch telefonisch unter 03677
691444).
Aus Kostengründen wird darum gebeten, die Bewerbungsunterlagen in
Kopie einzureichen. Diese verbleiben bei der TU Ilmenau und werden
nicht zurückgesandt. Nach Abschluss des Stellenbesetzungsverfahrens
werden die Unterlagen nicht berücksichtigter Bewerber/-innen
vernichtet. Bei gewünschter Rücksendung der Unterlagen bitten wir, der
Bewerbung einen adressierten und ausreichend frankierten Rückumschlag
beizufü- gen. Die Ihnen durch die Bewerbung entstandenen Kosten werden
durch die TU Ilmenau nicht übernommen.
--
Prof. Dr. Dietrich Kuske |
FG Automaten und Logik | Tel +49 (0)3677 69 1444
TU Ilmenau | dietrich.kuske(a)tu-ilmenau.de
PF 10 05 65 | http://eiche.theoinf.tu-ilmenau.de/kuske
D-98684 Ilmenau | www.kleines-paradies-buelow.de
Final Call for Participation
========================================
Computer Science Logic 2018
Birmingham, United Kingdom
4–7 September
<http://events.cs.bham.ac.uk/csl18/>
========================================
** The early bird registration period has been extended till 7 August **
The European Association for Computer Science Logic and the School of
Computer Science of the University of Birmingham kindly invite you to
take part in the 2018 edition of CSL.
The day after the conference, there will be a free workshop honouring
Achim Jung on occasion of his 60th birthday.
# The Conference
Computer Science Logic (CSL) is the annual conference of the European
Association for Computer Science Logic (EACSL). It is an
interdisciplinary conference, spanning across both basic and application
oriented research in mathematical logic and computer science. CSL 2018
will be the 27th edition in the series.
## Invited Speakers
* Bob Coecke — University of Oxford
* Emmanuel Filiot — Université Libre de Bruxelles
* Catuscia Palamidessi — École Polytechnique
* Christine Tasson — Université Paris Diderot
* Szymon Toruńczyk — Uniwersytet Warszawksi
## Programme
Thirty-six contributions were selected for presentation at CSL 2018. A
full listing is available at
<http://events.cs.bham.ac.uk/csl18/acceptedpapers/>
A preliminary programme has also been published.
# Achim Jung Fest — “An Intersection of Neighborhoods” (8 Sep)
For thirty years, Achim Jung has been at the forefront of research in
the fields of Programming Language Semantics, Topological Logic, and,
more broadly, the intersection of Computer Science, Logic, and Mathematics.
The day following CSL there will be a workshop in commemoration of his
career on occasion of his 60th birthday.
For more information, please see
<http://events.cs.bham.ac.uk/csl18/AJFest/>
## Invited Speakers
* Samson Abramsky — University of Oxford
* Thorsten Altenkirch — University of Nottingham
* Mai Gehrke — Université Côte d'Azur
* Michael Huth — Imperial College
* Ho Weng Kin — Nanyang Technological University
* Jimmie Lawson — Louisiana State University
* Michael Mislove — Tulane University
* Frank Pfenning — Carnegie Mellon University
* Alex Simpson — University of Ljubljana
# Registration
The fees for the conference and associated events are
------------------------------------------- -------
Early Bird Conference (Standard) £300
Early Bird Conference (Student) £240
Regular Conference (after 7 August) £350
Conference Dinner £48
Excursion
Black Country Living Museum £32
Achim Jung Fest *free*
------------------------------------------- -------
To register, please follow the link and information provided on the CSL
website
<http://events.cs.bham.ac.uk/csl18>
For any questions please contact Dan R. Ghica <D.R.Ghica(a)cs.bham.ac.uk>
[Apologies if you receive multiple copies of this email. Please distribute
to interested parties.]
Applications are invited for a 4-year fully funded PhD studentship in LogiCS
Doctoral College - Logical Methods in Computer Science.
========================================
The faculty of the LogiCS doctoral college is looking for 16 doctoral
students, where 30% of the positions are reserved for highly qualified
female candidates.
========================================
LogiCS - Logical Methods in Computer Science is a joint doctoral program of
TU Wien, TU Graz, and JKU Linz, Austria, funded by the Austrian Science Fund
(FWF).
========================================
Deadline: Friday 31 August 2018.
========================================
Website: http://logic-cs.at/phd/
========================================
TOPICS OF RESEARCH
LogiCS focuses on logic and its applications in computer science. Successful
applicants will work on interdisciplinary research topics covering
(i) computational logic,
(ii) databases and artificial intelligence,
(iii) computer-aided verification, and
(iv) emerging application domains, such as cyber-physical systems,
distributed systems, and security & privacy.
========================================
FACULTY MEMBERS
- Austria has a vibrant and highly active and successful logic in computer
science community. Students are supervised by leading researchers in their
fields: E. Bartocci / A. Biere / R. Bloem / A. Ciabattoni / G. Gottlob / T.
Eiter / R. Grosu / L. Kovacs / M. Maffei / M. Ortiz / U. Schmid / M. Seidl /
S. Szeider / G. Weissenbacher / S. Woltran
- See: <https://dblp.uni-trier.de/> https://dblp.uni-trier.de/
- Details are provided on: http://logic-cs.at/phd/faculty/
========================================
POSITIONS AND FUNDING
- 4-years fully funded 16 positions, where 30% of the positions are reserved
for highly qualified female candidates.
- The doctoral positions are funded for a period of 4 years according to the
funding scheme of the Austrian Science Fund (details:
http://www.fwf.ac.at/de/forschungsfoerderung/personalkostensaetze/ ).
- Additional positions will be available through other funding.
========================================
HOW TO APPLY
- The applicants are expected to have completed an excellent master's degree
in computer science, mathematics, or a related field.
- Candidates with comparable achievements (e.g., bachelor of honors) may be
considered on a case-by-case basis.
- Applications by the candidates need to be submitted electronically.
- Applications will be screened: September 1, 2018
- The positions will be filled on continuous basis till October 2018.
- Applications by the candidates need to be submitted electronically.
========================================
ADMISSION
Detailed information: http://logic-cs.at/phd/admission/
========================================
RESEARCH; STUDY; LIFE IN AUSTRIA
- Austria has a vibrant and highly active and successful logic in computer
science community. See: www.vcla.at
- Vienna, Graz, and Linz, located close to the Alps, are surrounded by
beautiful nature. Vienna is constantly ranked the city with the highest
quality of life in the world. Austria has an exciting cultural scene,
world-famous historical sites, a large international community, varied
cuisine, and famous coffee houses.
========================================
FURTHER INFORMATION
For further information please contact: info(a)logic-cs.at