The Department of Mathematics and Statistics at the University of Helsinki invites applications for a doctoral student position in
Theory and Applications of Dependence Logic
for a fixed-term of three years (with a possibility of extension if further funding can be obtained later). The starting date of the full-time position is September 1, 2019, or earlier by agreement. The salary of the position is determined according to the salary system of Finnish universities. The starting salary will be 2200–2700 euros/month, depending on the appointee’s qualifications and experience.
***Application deadline***
27 April 2019
***Project description***
The doctoral student will work within the three-year research project on “Logical analysis of no-go theorems in social choice and quantum foundations” funded by the University of Helsinki. The principal investigator of the project is Dr. Fan Yang.
This multidisciplinary project aims to apply the methodology of dependence logic to develop formal connections between no-go theorems in social choice theory (such as Arrow’s Theorem) and in quantum foundations (such as Bell’s Theorem). The project will also address relevant open problems in the theory of dependence logic, especially the axiomatization problem. Read more about the project on the homepage of Dr. Fan Yang: https://sites.google.com/site/fanyanghp/ and about dependence logic on Stanford Encyclopedia of Philosophy: https://plato.stanford.edu/entries/logic-dependence/.
This research is embedded in the Helsinki Logic Group. For more information about the Group, please visit: https://wiki.helsinki.fi/display/Logic/Home.
***Qualifications***
Applicants are expected to hold a Master’s degree in mathematics, computer science, philosophy or some other relevant subject by the time of the start date. An ideal candidate should have a strong background in mathematical logic, and a keen interest in interdisciplinary research.
For more information and details on how to apply, see https://www.helsinki.fi/en/open-positions/doctoral-student-theory-and-appli…
or contact Dr. Fan Yang at fan.yang(a)helsinki.fi.
The Foundations of Algorithmic Verification group at the Max Planck
Institute for Software Systems in Saarbruecken, Germany, headed by Joel
Ouaknine, has several open postdoc positions in the area of algorithmic
verification and analysis of dynamical systems.
The overall goal of the project is to develop techniques to solve
fundamental computational problems arising in the verification of discrete
and continuous linear dynamical systems, including Markov chains, linear
recurrence sequences, linear while loops, linear differential equations,
hybrid systems, and infinite-state systems. You will develop algorithms to
solve reachability, termination, and synthesis problems for these models by
combining a range of computational techniques, including results from
number theory (particularly lower bounds in Diophantine approximation). In
cases where algorithms cannot be obtained, you will seek reductions from
known "hard" problems. The project aims to build on, and significantly
develop, recent progress at MPI-SWS and Oxford in solving long-standing
open problems in this area. You should have a PhD (or be close to
completion) in a relevant area of computer science, mathematics, or a
related discipline, together with a documented track record of the ability
to conduct and complete research projects in automated verification,
automata theory, dynamical systems, or algorithmic algebra and number
theory.
To apply, please send CV and short statement of purpose to
Joel Ouaknine <joel(a)mpi-sws.org>, with Annika Meiser <ameiser(a)mpi-sws.org>
in cc, before the closing date of
***22 April 2019***.
Informal inquiries of course very welcome.
--
*Joël Ouaknine*
Max Planck Institute for Software Systems, Saarland Informatics Campus,
Germany
Department of Computer Science, Oxford University, UK
http://mpi-sws.org/~joel/ <http://people.mpi-sws.org/~joel/>
(Extended Deadline) Call for Nominations: VCLA INTERNATIONAL STUDENT AWARDS
2019
OVERVIEW
The Vienna Center for Logic and Algorithms (VCLA) at TU Wien (Vienna
University of Technology) seeks nominations for the annually awarded VCLA
International Student Awards for Outstanding Master and Undergraduate
Research Theses, which recognize authors of scientific works covering a very
wide range of topics on the spectrum of Logic, and Computer Science.
Extended submission deadline: 25.3.2019
AWARD
*Outstanding Master Thesis Award: 1200 EUR
*Outstanding Undergraduate Research (Bachelor) Award: 800 EUR
*The winners will be invited to present their work at an award ceremony in
Vienna, Austria in the autumn 2019
ELIGIBILITY
*The degree must have been awarded between November 15th, 2017, and December
31st, 2018, (inclusive).
*Students who obtained their degree at TU Wien are excluded from the
nomination.
MAIN AREAS OF INTEREST
*Computational Logic, covering theoretical and mathematical foundations such
as proof theory, model theory, computability theory, Boolean satisfiability
(SAT), QBF, constraint satisfaction, satisfiability modulo theories,
automated deduction (resolution, refutation, theorem proving), non-classical
logics (substructural logics, multi-valued logics, deontic logics, modal and
temporal logics).
*Algorithms and Computational Complexity, including design and analysis of
discrete algorithms, complexity analysis, algorithmic lower bounds,
parameterized and exact algorithms, decomposition methods, approximation
algorithms, randomized algorithms, algorithm engineering, as well as
algorithmic game theory, computational social choice, parallel algorithms,
and distributed algorithms.
*Databases and Artificial Intelligence, concerned with logical methods for
modeling, storing, and drawing inferences from data and knowledge. This
includes subjects like query languages based on logical concepts (Datalog,
variants of SQL, XML, and SPARQL), novel database-theoretical methods
(schema mappings, information extraction and integration), logic
programming, knowledge representation and reasoning (ontologies, answer-set
programming, belief change, inconsistency handling, argumentation,
planning).
*Verification, concerned with logical methods and automated tools for
reasoning about the behavior and correctness of complex state-based systems
such as software and hardware designs as well as hybrid systems. This ranges
from model checking, program analysis and abstraction to new
interdisciplinary areas such as fault localization, program repair, program
synthesis, and the analysis of biological systems.
NOMINATION REQUIREMENTS
*A cover page that contains the name and contact details of the nominated
person, the title of the work for which the person is being nominated, award
category, the date on which the degree was awarded, and the name of the
university
*An English summary of the thesis of maximum 3 pages, excluding references
(A4 or letter page size, 11pt font min). The summary must clearly state the
main contribution of the work, its novelty, and its relevance to some of the
aforementioned areas of interest
*The CV of the nominated person, including publication list (if applicable)
*An endorsement letter from a supervisor or another proposing person. The
letter must clearly state the independent and novel contribution of the
student, and why the proposer believes the student deserves the award. The
endorsement letter may be submitted to the award committee after the
deadline for the submission of nominations has passed.
*The full thesis
IMPORTANT DATES
*Extended submission deadline: March 25, 2019 (AoE)
*Notification of decision: end of June 2019
*Award ceremony: September 2019, Vienna (Austria)
AWARD COMMITTEE 2019
Ezio Bartocci
Wolfgang Dvořák
Ekaterina Fokina
<https://www.ac.tuwien.ac.at/people/rganian/> Robert Ganian (committee
co-chair)
Maximilian Jaroschek
Roman Kuznets
Martin Lackner
Bjoern Lellmann
<http://www.kr.tuwien.ac.at/staff/ortiz/> Magdalena Ortiz (general chair)
Matteo Pascucci
<https://www.logic.at/staffpages/revantha> Revantha Ramanayake (committee
co-chair)
Christoph Redl
Peter Schüller
Sebastian Skritek
Friedrich Slivovsky
Bhore Sujoy
Johannes Wallner
Antonius Weinzierl
IN MEMORIAM
The award is dedicated to the memory of Helmut Veith, the brilliant computer
scientist who tragically passed away in March 2016, and aims to carry on his
commitment to promoting young talent and promising researchers in these
areas.
WEBSITE AND CONTACT
https://logic-cs.at/award-call-2019/
award(a)logic-cs.at
-------------------------------------------------------------------------------
CALL FOR PAPERS
32nd International Workshop on Description Logics, DL 2019
June 18th to June 21st, 2019 - Oslo, Norway
http://dl2019.ifi.uio.no/home.html
-------------------------------------------------------------------------------
The DL workshop is the major annual event of the description logic research
community. It is the forum at which those interested in description logics,
both from academia and industry, meet to discuss ideas, share information and
compare experiences. The 32nd edition will be held in Oslo, Norway from
June 18th to June 21st, 2019.
Important Dates
===============
Paper registration deadline:
March 22, 2019
Paper submission deadline:
March 29, 2019
Notification of acceptance:
May 3, 2019
Camera-ready copies:
May 24, 2019
Workshop:
June 18-21, 2019
Workshop Scope
==============
We invite contributions on all aspects of description logics, including but
not limited to:
* Foundations of description logics: decidability and complexity of reasoning, expressive power, novel inference problems, inconsistency management,
reasoning techniques, and modularity aspects
* Extensions of description logics: closed-world and nonmonotonic reasoning, epistemic reasoning, temporal and spatial reasoning, procedural knowledge,
query answering, reasoning over dynamic information
* Integration of description logics with other formalisms: object-oriented representation languages, database query languages, constraint-based
programming, logic programming, and rule-based systems
* Applications and use areas of description logics: ontology engineering, ontology languages, databases, ontology-based data access, semi-structured
data, graph-structured data, linked data, document management, natural language, learning, planning, Semantic Web, cloud computing, conceptual
modeling, web services, business processes
* Systems and tools around description logics: reasoners, software tools for and using description logic reasoning (e.g. ontology editors, database
schema design, query optimization, and data integration tools), implementation and optimization techniques, benchmarking, evaluation, modeling
Invited Speakers
================
* Pablo Barceló, Universidad de Chile, Chile
* Meghyn Bienvenu, Université de Bordeaux, France
* Gerhard Lakemeyer, RWTH Aachen, Germany
Submissions
===========
Submissions may be of two types:
(1) We invite regular papers of up to 11 pages. If the authors prefer the paper to not appear in the proceedings, an additional 2-page abstract of the paper has to be submitted (the 2-page abstract would appear in the proceedings, in case of acceptance).
(2) Papers accepted or under review at some other conference can be submitted to the DL workshop. They should be submitted together with a 2-page abstract that also specifies where the paper has been accepted or is under review. Only the 2-page abstract would appear in the proceedings, in case of acceptance.
* The regular papers and the 2-page abstracts must be formatted using the Springer LNCS style. The list of references in these submissions does not count towards the page limit.
* DL 2019 allows (but does not require) submissions to be anonymous, i.e. the PC members and the reviewers will not see the identity of authors in the submission system (EasyChair). If you wish to conceal your identity, please don’t forget to omit it from the PDF file you are submitting.
* The option to publish a 2-page abstract is designed for authors who wish to announce results that have been published elsewhere, or which the authors intend to submit or have already submitted to a venue with an incompatible prior/concurrent publication policy.
* All submissions may optionally include a clearly marked appendix (e.g., with additional proofs or evaluation data). The appendix will be read at the discretion of the reviewers and not included in the proceedings. The appendix does not need to be in LNCS format.
* Accepted regular papers and 2-page abstracts will be made available electronically in the CEUR Workshop Proceedings series (http://www.CEUR-ws.org/).
* Accepted submissions, be they regular papers or 2-page abstracts, will be selected for either oral or poster presentation at the workshop. Submissions will be judged solely based on their content, and the type of submission will have no bearing on the decision between oral and poster presentation.
Submission page: https://easychair.org/conferences/?conf=dl2019
Student Support
===============
A limited number of student grants for participating in DL 2019 are available. The grants consist of a fixed amount that can be used to cover travel costs and registration fees.
Organization
============
* Martin Giese, University of Oslo, Norway (general co-chair)
* Mantas Simkus, TU Wien, Austria (program co-chair)
* Arild Waaler, University of Oslo, Norway (general co-chair)
* Grant Weddell, University of Waterloo, Canada (program co-chair)
Resources
=========
* Information about submission, registration, travel information, etc., is
available on the DL 2019 homepage: http://dl2019.ifi.uio.no/home.html
* The official description logic homepage is at http://dl.kr.org/
Learning and Automata (LearnAut) -- LICS 2019 workshop
June 23rd - Vancouver, Canada
Website: https://learnaut19.github.io
SUBMISSION DEADLINE March 30th
Learning models defining recursive computations, like automata and formal grammars, are the core of the field called Grammatical Inference (GI). The expressive power of these models and the complexity of the associated computational problems are major research topics within mathematical logic and computer science, spanning the communities that the Logic in Computer Science (LICS) conference brings together. Historically, there has been little interaction between the GI and LICS communities, though recently some important results started to bridge the gap between both worlds, including applications of learning to formal verification and model checking, and (co-)algebraic formulations of automata and grammar learning algorithms.
The goal of this workshop is to bring together experts on logic who could benefit from grammatical inference tools, and researchers in grammatical inference who could find in logic and verification new fruitful applications for their methods.
We invite submissions of recent work, including preliminary research, related to the theme of the workshop. Similarly to how main machine learning conferences and workshops are organized, all accepted abstracts will be part of a poster session held during the workshop.
Additionally, the Program Committee will select a subset of the abstracts for oral presentation. At least one author of each accepted abstract is expected to represent it at the workshop. Note that participation to the poster session is on a voluntary basis for papers selected for oral presentation.
High-quality submissions will be strongly encouraged to submit an extended version to an upcoming special issue of the Machine Learning Journal.
Topics of interest include (but are not limited to):
- Computational complexity of learning problems involving automata and formal languages.
- Algorithms and frameworks for learning models representing language classes inside and outside the Chomsky hierarchy, including tree and graph grammars.
- Learning problems involving models with additional structure, including numeric weights, inputs/outputs such as transducers, register automata, timed automata, Markov reward and decision processes, and semi-hidden Markov models.
- Logical and relational aspects of learning and grammatical inference.
- Theoretical studies of learnable classes of languages/representations.
- Relations between automata and recurrent neural networks.
- Active learning of finite state machines and formal languages.
- Methods for estimating probability distributions over strings, trees, graphs, or any data used as input for symbolic models.
- Applications of learning to formal verification and (statistical) model checking.
- Metrics and other error measures between automata or formal languages.
** Invited speakers **
Lise Getoor (UC Santa Cruz)
Prakash Panangaden (McGill University)
Nils Jansen (Radboud University)
Dana Fisman (Ben-Gurion University)
** Submission instructions **
Submissions in the form of extended abstracts must be at most 8 single-column pages long at most (plus at most four for bibliography and possible appendixes) and must be submitted in the JMLR/PMLR format. The LaTeX style file is available here: https://ctan.org/tex-archive/macros/latex/contrib/jmlr
We do accept submissions of work recently published or currently under review.
- Submission url: https://easychair.org/conferences/?conf=learnaut2019
- Submission deadline: March 30th
- Notification of acceptance: April 25th
- Registration: TBD
** Program Committee **
Dana Angluin (Yale University)
Borja Balle (Amazon Research Cambridge)
Leonor Becerra-Bonache (Université de Saint-Etienne)
Alexander Clark (King’s College London)
François Denis (Aix-Marseille Université)
Kousha Etessami (University of Edinburgh)
Dana Fisman (Ben-Gurion University)
Matthias Gallé (Naver Labs Europe)
Colin de la Higuera (Nantes University)
Falk Howar (TU Clausthal)
Makoto Kanazawa (Hosei University)
Ariadna Quattoni (Naver Labs Europe)
Alexandra Silva (University College London)
Frits Vaandrager (Radboud University)
** Organizers **
Remi Eyraud (Aix-Marseille Université)
Tobias Kappé (University College London)
Guillaume Rabusseau (Université de Montréal / Mila)
Matteo Sammartino (University College London)
Dynamic Logic: New Trends and Applications
workshop.dali.di.uminho.pt
First Call for Papers
Porto, 9 October, 2019
(part of the 3rd World Congress on Formal Methods 2019)
OVERVIEW
Building on the pioneer intuitions of Floyd-Hoare logic, dynamic logic
was introduced in the 70's as a suitable logic to reason about, and
verify, classic imperative programs. Since then, the original
intuitions grew to an entire family of logics, which became
increasingly popular for assertional reasoning about a wide range of
computational systems. Simultaneously, their object (i.e. the very
notion of a program) evolved in unexpected ways. This lead to dynamic
logics tailored to specific programming paradigms and extended to new
computing domains, including probabilistic, continuous and quantum
computation. Both its theoretical relevance and practical potential
make dynamic logic a topic of interest in a number of scientific
venues, from wide-scope software engineering conferences to modal
logic specific events. However, no specific event is exclusively
dedicated to it. This workshop aims at filling fill such a gap,
joining an heterogeneous community of colleagues, from Academia to
Industry, from Mathematics to Computer Science.
Support: PT-FLAD Chair & DaLi - POCI-01-0145-FEDER-016692
TOPICS
Submissions are invited on the general field of dynamic logic, its
variants and applications, including, but not restricted to
Dynamic logic, foundations and applications
Logics with regular modalities
Modal/temporal/epistemic logics
Kleene and action algebras and their variants
Quantum dynamic logic
Coalgebraic modal/dynamic logics
Graded and fuzzy dynamic logics
Dynamic logics for cyber-physical systems
Dynamic epistemic logic
Complexity and decidability of variants of dynamic logics
and temporal logics
Model checking, model generation and theorem proving for
dynamic logics
SUBMISSION AND PUBLICATION
Original papers (unpublished and not submitted for publication
elsewhere), up to 15 pages in LNCS style. As in the previous edition,
post-proceedings will be published by Springer in a Lecture Notes of
Computer Science volume, and a special issue with extended, revised
contributions is planed.
Submit via the EasyChair link https://easychair.org/conferences/?conf=dali2019
INVITED SPEAKER
Dexter Kozen, Cornell University
IMPORTANT DATES
Paper Submission: June 14, 2019
Notification: July 19, 2019
Camera Ready: September 2, 2019
Workshop: October 9, 2019
PROGRAMME COMMITTEE
Guillaume Aucher (IRISA, FR)
Carlos Areces (U Cordoba, AR)
Alexandru Baltag, (UvA, NL) - PC co-chair
Luis S. Barbosa, (U Minho, PT) - PC co-chair
Mario Benevides (UFRJ, BR)
Johan van Benthem (U Stanford, USA)
Patrick Blackburn, (U Roskilde, DK)
Thomas Bolander (DTU, Denmark)
Zoe Christoff (U Bayreuth, Germany)
Fredrik Dahlqvist (UCL, UK)
Hans van Ditmarsch (LORIA, Nancy, FR)
Nina Gierasimczuk (DTU, Denmark)
Valentin Goranko (U Stockholm, SE)
Davide Grossi (U Groningen, NL)
Reiner Hahle (TU Darmstadt, DE)
Rolf Hennicker (LMU, Munchen, DE)
Andreas Herzig (U Toulouse, FR)
Dexter Kozen (Cornell, USA)
Clemens Kupke (U Strathclyde, UK)
Alexandre Madeira (U Aveiro, PT)
Manuel A. Martins (U Aveiro, PT)
Paulo Mateus (IST, PT)
Stefan Mitsch (CMU, USA)
Renato Neves (U Minho, PT)
Valeria de Paiva (Nuance Comms, USA)
Aybuke Ozgun (ILLC, NL)
Fernando Velazquez-Quesada (ILLC, NL)
Olivier Roy (U Bayreuth, DE)
Lutz Schroeder (FAU, Erlangen-Nurenberg, DE)
Alexandra Silva (UCL, UK)
Sonja Smets (UvA, NL)
Rui Soares Barbosa (U Oxford, UK)
Tinko Tinchev (Sofia U, BG)
Renata Wassermann (USP, BR)
Dynamic Logic: New Trends and Applications
workshop.dali.di.uminho.pt
First Call for Papers
Porto, 9 October, 2019
(part of the 3rd World Congress on Formal Methods 2019)
OVERVIEW
Building on the pioneer intuitions of Floyd-Hoare logic, dynamic logic
was introduced in the 70's as a suitable logic to reason about, and
verify, classic imperative programs. Since then, the original
intuitions grew to an entire family of logics, which became
increasingly popular for assertional reasoning about a wide range of
computational systems. Simultaneously, their object (i.e. the very
notion of a program) evolved in unexpected ways. This lead to dynamic
logics tailored to specific programming paradigms and extended to new
computing domains, including probabilistic, continuous and quantum
computation. Both its theoretical relevance and practical potential
make dynamic logic a topic of interest in a number of scientific
venues, from wide-scope software engineering conferences to modal
logic specific events. However, no specific event is exclusively
dedicated to it. This workshop aims at filling fill such a gap,
joining an heterogeneous community of colleagues, from Academia to
Industry, from Mathematics to Computer Science.
Support: PT-FLAD Chair & DaLi - POCI-01-0145-FEDER-016692
TOPICS
Submissions are invited on the general field of dynamic logic, its
variants and applications, including, but not restricted to
Dynamic logic, foundations and applications
Logics with regular modalities
Modal/temporal/epistemic logics
Kleene and action algebras and their variants
Quantum dynamic logic
Coalgebraic modal/dynamic logics
Graded and fuzzy dynamic logics
Dynamic logics for cyber-physical systems
Dynamic epistemic logic
Complexity and decidability of variants of dynamic logics
and temporal logics
Model checking, model generation and theorem proving for
dynamic logics
SUBMISSION AND PUBLICATION
Original papers (unpublished and not submitted for publication
elsewhere), up to 15 pages in LNCS style. As in the previous edition,
post-proceedings will be published by Springer in a Lecture Notes of
Computer Science volume, and a special issue with extended, revised
contributions is planed.
Submit via the EasyChair link https://easychair.org/conferences/?conf=dali2019
INVITED SPEAKER
Dexter Kozen, Cornell University
IMPORTANT DATES
Paper Submission: June 14, 2019
Notification: July 19, 2019
Camera Ready: September 2, 2019
Workshop: October 9, 2019
PROGRAMME COMMITTEE
Guillaume Aucher (IRISA, FR)
Carlos Areces (U Cordoba, AR)
Alexandru Baltag, (UvA, NL) - PC co-chair
Luis S. Barbosa, (U Minho, PT) - PC co-chair
Mario Benevides (UFRJ, BR)
Johan van Benthem (U Stanford, USA)
Patrick Blackburn, (U Roskilde, DK)
Thomas Bolander (DTU, Denmark)
Zoe Christoff (U Bayreuth, Germany)
Fredrik Dahlqvist (UCL, UK)
Hans van Ditmarsch (LORIA, Nancy, FR)
Nina Gierasimczuk (DTU, Denmark)
Valentin Goranko (U Stockholm, SE)
Davide Grossi (U Groningen, NL)
Reiner Hahle (TU Darmstadt, DE)
Rolf Hennicker (LMU, Munchen, DE)
Andreas Herzig (U Toulouse, FR)
Dexter Kozen (Cornell, USA)
Clemens Kupke (U Strathclyde, UK)
Alexandre Madeira (U Aveiro, PT)
Manuel A. Martins (U Aveiro, PT)
Paulo Mateus (IST, PT)
Stefan Mitsch (CMU, USA)
Renato Neves (U Minho, PT)
Valeria de Paiva (Nuance Comms, USA)
Aybuke Ozgun (ILLC, NL)
Fernando Velazquez-Quesada (ILLC, NL)
Olivier Roy (U Bayreuth, DE)
Lutz Schroeder (FAU, Erlangen-Nurenberg, DE)
Alexandra Silva (UCL, UK)
Sonja Smets (UvA, NL)
Rui Soares Barbosa (U Oxford, UK)
Tinko Tinchev (Sofia U, BG)
Renata Wassermann (USP, BR)
The thirteenth TbiLLC may be of interest to finite model theorists.
This second call for papers has added information on location and
workshops.
---
THE THIRTEENTH INTERNATIONAL TBILISI SYMPOSIUM
ON LOGIC, LANGUAGE AND COMPUTATION
Second Call for Papers
16-20 September, 2019
Batumi, Georgia
http://events.illc.uva.nl/Tbilisi/Tbilisi2019/
***********************************************************************
CALL FOR PAPERS
The Thirteenth International Tbilisi Symposium on Logic, Language, and
Computation will be held 16-20 September 2019 in Batumi, Georgia. The
Programme Committee invites submissions for contributions
on all aspects of logic, language, and computation. Work of an
interdisciplinary nature is particularly welcome. Areas of interest
include, but are not limited to:
* Natural language syntax, semantics, and pragmatics
* Linguistic typology and semantic universals
* Language evolution and learnability
* Historical linguistics, history of logic
* Natural logic, inference and entailment in natural language
* Logic, games, and formal pragmatics
* Logics for artificial intelligence and computer science
* Constructive, modal and algebraic logic
* Categorical logic
* Algorithmic game theory
* Computational social choice
* Formal models of multiagent systems
* Information retrieval, query answer systems
* Distributional and probabilistic models of information, meaning and
computation
* Models of computation
Authors can submit an abstract of three pages (including references) at
the
EasyChair conference system here:
https://easychair.org/conferences/?conf=tbillc2019
PROGRAMME
The programme will include tutorials and a series of invited lectures.
Tutorials:
Logic: Graham Leigh (University of Gothenburg)
Language: Fabian Bross (University of Stuttgart)
Computation: Daniela Petrisan (CNRS, Université Paris Diderot)
Invited speakers:
Logic:
Philippe Balbiani (CNRS, Université Toulouse III),
Adam Bjorndahl (Carnegie Mellon University)
Language:
Berit Gehrke (HU Berlin),
Thomas Ede Zimmermann (University of Frankfurt)
Computation:
Libor Barto (Charles University Prague),
Elham Kashefi (CNRS, University of Edinburgh)
WORKSHOPS
There will be two workshops:
"Syntax, Semantics, and Pragmatics of Aspect Across Modalities (SSPAM)"
Conveners: Berit Gehrke (HU Berlin) and Fabian Bross (University
Stuttgart)
For more details see the workshop webpage
https://sites.google.com/view/sspam2019/call-for-papers
and
"Topology and Modal Logic"
Convener: Adam Bjorndahl (Carnegie Mellon University)
More information will be available on the TbiLLC website:
http://events.illc.uva.nl/Tbilisi/Tbilisi2019/
Programme Committee
Bahareh Afshari (University of Gothenburg)
Rusiko Asatiani (Tbilisi State University)
Guram Bezhanishvili (New Mexico State University)
Nick Bezhanishvili (University of Amsterdam)
Valeria de Paiva (Nuance Communications)
David Gabelaia (TSU Rasmadze Mathematical Institute)
Katharina Hartmann (University of Frankfurt/Main)
Jules Hedges (University of Oxford)
Daniel Hole (co-chair, University of Stuttgart)
Sebastian Löbner (University of Düsseldorf)
Matteo Mio (CNRS/ENS-Lyon)
Sara Negri (University of Helsinki)
Sebastian Padó (University of Stuttgart)
Alessandra Palmigiano (Technical University of Delft)
Roland Pfau (University of Amsterdam)
Martin Schäfer (University of Anglia Ruskin)
Lutz Schröder (University of Erlangen-Nürnberg)
Kerstin Schwabe (Leibniz-ZAS Berlin)
Alexandra Silva (UC London)
Alex Simpson (co-chair, University of Ljubljana)
Luca Spada (University of Salerno)
Ronnie B. Wilbur (Purdue University)
Fan Yang (University of Helsinki)
PUBLICATION INFORMATION
Post-proceedings of the symposium will be published in
the LNCS series of Springer.
IMPORTANT DATES
Submission deadline: 1 April 2019
Notification: 3 June 2019
Final abstracts due: 1 July 2019
Registration deadline: 1 August 2019
Symposium: 16-20 September 2019
Programme and submission details can be found at:
http://events.illc.uva.nl/Tbilisi/Tbilisi2019/
LOCATION
Castello Mare Hotel & Wellness Resort - Tsikhisdziri, Batumi, Georgia
http://castellomare.com
ACKERMANN AWARD 2019 - THE EACSL OUTSTANDING DISSERTATION AWARD FOR
LOGIC IN COMPUTER SCIENCE
FINAL CALL FOR NOMINATIONS
Nominations are now invited for the 2019 Ackermann Award.
PhD dissertations in topics specified by the CSL and LICS
conferences, which were formally accepted as PhD theses at a
university or equivalent institution between 1.1.2017 and 31.12.2018
are eligible for nomination for the award. The deadline for submission
is 1 April 2019. Submission details follow below.
Nominations can be submitted from 1 January 2019 and should be sent
to the chair of the Jury, Thomas Schwentick, by e-mail: thomas.schwentick(a)tu-dortmund.de
The Award
The 2019 Ackermann award will be presented to the recipient(s) at CSL
2020, the annual conference of the EACSL, 13-16 January 2020, in Barcelona.
The award consists of
* a certificate,
* an invitation to present the thesis at the CSL conference,
* the publication of the laudatio in the CSL proceedings,
* an invitation to the winner to publish the thesis in the FoLLI subseries of Springer LNCS, and
* financial support to attend the conference.
The jury is entitled to give the award to more (or less) than one
dissertation in a year.
Jury
The jury consists of:
* Christel Baier (TU Dresden);
* Michael Benedikt (Oxford University);
* Mikolaj Bojanczyk (University of Warsaw);
* Jean Goubault-Larrecq (ENS Paris-Saclay);
* Dexter Kozen (Cornell University);
* Dale Miller (INRIA and Ecole Polytechnique), ACM SigLog representative;
* Simona Ronchi Della Rocca (University of Torino), the vice-president of EACSL;
* Thomas Schwentick (TU Dortmund) , the president of EACSL.
How to submit
The candidate or his/her supervisor should submit
1. the thesis (ps or pdf file);
2. a detailed description (not longer than 20 pages) of the thesis
in ENGLISH (ps or pdf file);
3. a supporting letter by the PhD advisor and two supporting letters
by other senior researchers (in English);
supporting letters can also be sent directly to Thomas Schwentick
(thomas.schwentick(a)tu-dortmund.de);
4. a short CV of the candidate;
5. a copy of the document asserting that the thesis was accepted as
a PhD thesis at a recognized University (or equivalent institution) and
that the candidate has received his/her PhD within the specified period.
The submission should be sent by e-mail as attachments to the chairman
of the jury, Thomas Schwentick:
thomas.schwentick(a)tu-dortmund.de
With the following subject line and text:
* Subject: Ackermann Award 2019 Submission
* Text: Name of candidate, list of attachments
Submission can be sent via several e-mail messages. If this is the case,
please indicate it in the text.
********************************************************************************
VerifyThis Verification Competition 2019
CALL FOR PARTICIPATION -- TRAVEL GRANTS
Competition to be held at ETAPS 2019
http://verifythis.ethz.ch
********************************************************************************
IMPORTANT DATES
Grant application deadline: March 7, 2019
Competition: April 6 and 7, 2019
ABOUT
VerifyThis 2019 is a program verification competition taking place as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2019) on April 6-7, 2019 in Prague, Czech Republic.
It is the 8th event in the VerifyThis competition series.
The competition will offer a number of challenges presented in natural language and pseudo code.
Participants have to formalize the requirements, implement a solution, and formally verify the implementation for adherence to the specification.
There are no restrictions on the programming language and verification technology used.
The correctness properties posed in problems will have the input-output behaviour of programs in focus. Solutions will be judged for correctness, completeness, and elegance.
PARTICIPATION
Participation is open for anybody interested.
Teams of up to two people are allowed.
Registration for ETAPS workshops and physical presence on site is required.
We particularly encourage participation of:
- student teams (this includes PhD students)
- non-developer teams using a tool someone else developed
- several teams using the same tool
TRAVEL GRANTS
The competition has funds for a limited number of travel grants.
A grant covers the incurred travel and accommodation costs up to a certain limit.
The expected limit is EUR 350 for those coming from Europe and EUR 600 for those coming from outside Europe.
To apply for a travel grant, send an email to verifythis(a)cs.nuim.ie by March 7, 2019. The application should include:
- your name
- your affiliation
- the verification system(s) you plan to use at the competition
- the planned composition of your team (and whether you are developers of the tools you'll be using)
- a short letter of motivation explaining your involvement with formal verification so far
- if you are a student, please state the academic degree you are seeking and have your supervisor send a brief letter of support to verifythis(a)cs.nuim.ie
ORGANIZERS
* Marieke Huisman, University of Twente, the Netherlands
* Rosemary Monahan, Maynooth University, Ireland
* Peter M��ller, ETH Z��rich, Switzerland
* Claire Dross, Adacore, France
* Carlo A. Furia, USI Lugano, Switzerland
CONTACT
Email: verifythis(a)cs.nuim.ie
Web: http://verifythis.ethz.ch