[TYPES/announce] Post-Doc position within the ANR-FWF project "TICAMORE"

2017-06-30 Thread Didier Galmiche

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

-
Post-Doc position
  within the ANR-FWF project "TICAMORE"
-

A post-doc position is available at LORIA (Nancy, France)
in logic, proof theory and semantics, supported by the
international ANR-FWF Ticamore project (ANR-16-CE91-0002)

 "Translating and Discovering Calculi for Modal and Related logics"

See  for more information.

The successful candidate will be working within the TYPES
team at LORIA. He will have access to the resources of
the team through the Ticamore project.

It is a 1 year post-doc position that could be extended
with 1 more year.

RESEARCH AREA

The central goal of the Ticamore project is to study the
proof-theory of sub-structural or modal logics with a focus
on the bridges that can be built between internal calculi
(like sequent, hyper-sequent, nested or bunched calculi)
and external calculi (like labelled or display calculi).
These bridges should be understood as proof (or counter
model) transformation procedures, embeddings, encodings, ...


POST-DOC RESEARCH TASKS

The postdoc will be to carry out research within the project
Ticamore by focusing on the following tasks:

- to study new internal calculi for Bunched Logics (BI,
BBI and some modal extensions) and their connections
with existing external calculi,
- to use such calculi for studying high level properties
like termination, finite model property, cut-elimination,
interpolation or complexity.
- to implement external and internal calculi for Bunched
Logics and to develop tools for automated translations
between calculi.


REQUIREMENTS

Requirements are a PhD degree in Computer Science, Logic or
Mathematics and a strong background in some of the
following topics:
- formal logic (non-classical, sub-structural, modal, ...)
- proof theory (sequents, tableaux, natural deduction ...)
- logical semantics (translations, embeddings, bisimulations ...)
- computability theory (decidability, complexity ...)


 VENUE/SALARY

The position is for 1 year (with possible extension of 1 more
year) with a starting date that could be fixed between September
and December 2017. The position holder will work in the TYPES
team at LORIA and will be paid by the University of Lorraine.
The monthly salary will be around 2000 euros free of charge.

APPLICATION PROCEDURE

The deadline for application is July 25th, 2017, but an email
to inform about the intention of application is welcome as
soon as possible.

Applications should be sent in electronic form, including a CV,
publication list, title and summary of the PhD, reports on the
PhD, recommendation letters and a motivation letter w.r.t.
research topics related to the post-doc position.


They should be sent by email to either/both

- Didier Galmiche (galmi...@loria.fr)
- Dominique Larchey-Wendling (larc...@loria.fr)

Informal inquiries by email are welcome.

IMPORTANT DATES

- Intention of application (short email)as soon as possible
- Deadline for application  July 25th, 2017
- Starting datesSep.-Dec. 2017



[TYPES/announce] Types and Logic in Torino

2017-06-30 Thread Luca Padovani
[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Colloquium in honor of Mariangiola Dezani-Ciancaglini, Simona Ronchi Della 
Rocca and Mario Coppo
 
Torino, September 22nd, 2017
 
To celebrate the 70th birthdays of Mariangiola Dezani-Ciancaglini, Simona 
Ronchi Della Rocca and Mario Coppo we are organizing an informal colloquium. A 
preliminary program as well as all the information on the event and on the 
registration procedure are available here:
 
http://tlt2017.di.unito.it
 
The deadline for early registration is July 24th.
 
Luca Padovani
on behalf of the organizers



[TYPES/announce] CSL 2017 Call for Participation

2017-06-30 Thread Dilian Gurov

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


==

CALL FOR PARTICIPATION

26th EACSL Annual Conference on Computer Science Logic  CSL 2017
August 20 -- 24, 2017, Stockholm, Sweden
http://logic.math.su.se/csl-2017
==

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 and is intended for computer
scientists whose research involves logic, as well as for logicians working
on issues essential for computer science.

CSL 2017 is the 26th EACSL annual conference. It is co-organised by
Stockholm University and KTH Royal Institute of Technology, and hosted by
Stockholm University. CSL 2017 will be co-located with several other
logic-related events, taking place at Stockholm University, including the
3rd Nordic Logic Summer School, NLS 2017, August 7-11, and the Logic
Colloquium 2017 (LC 2017), August 14-20.


INVITED SPEAKERS

Invited highlight speakers for the LC-CSL joint session on August 20:
Veronica Becher (University of Buenos Aires)
Phokion Kolaitis (University of California Santa Cruz and IBM
Research - Almaden)
Pierre Simon (UC Berkeley)
Wolfgang Thomas (RWTH Aachen)

CSL plenary speakers:
Laura Kovács (Vienna University of Technology)
Stephan Kreutzer (Technische Universität Berlin)
Meena Mahajan (Institute of Mathematical Sciences, Chennai)
Margus Veanes (Microsoft Research)


CONTRIBUTED TALKS
-
The call for submissions is already closed. There will be 35 full talks on
contributed papers and 8 short talks in the program of  CSL 2017.


PROGRAM AND SCHEDULE

The detailed program and schedule of CSL 2017 can be found on
http://easychair.org/smart-program/CSL2017/


SPECIAL AND AFFILIATED EVENTS
-
In addition to the plenary and contributed talks CSL 2017, the conference
will also include the following events:
  •  Presentation of the Alonzo Church award for Outstanding Contributions
to Logic and Computation,
  •  Presentation of the EACSL Ackermann award for Outstanding
Dissertation on Logic in Computer Science,
  •  CSL-affiliated workshops, to be held as CSL co-located events:
   —  Workshop on Logic and Algorithms in Computational
  Linguistics LACompLing'17 (August 16-19)
   —  Workshop on Logical Aspects of Multi-Agent Systems
  LAMAS 2017 (August  25)
   —  Workshop on Logic and Automata Theory (in memory
  of Zoltan Ezik) (August  25)

Further information about all events can be found on
http://logic.math.su.se/logic-in-stockholm-2017


SOCIAL PROGRAMME

The social programme of CSL 2017 will include a reception at Stockholm
City Hall on August 21, a boat trip excursion and a conference dinner on
August 23.


REGISTRATION


The early registration fee, for students and participants from developing
countries, is 1800 SEK per participant, including VAT (approx. 190 EUR),
and includes coffee breaks and conference materials. For all others the
early registration fee is 2800 SEK, including VAT. Late registration is
3400 SEK for regular participants, and 2400 SEK for reduced fee
participants. A discount of 500 SEK applies if registering for both LC
2017 and CSL 2017.

The registration fee does not cover accommodation, but there are special
offers at hostels and hotels (in the range 700-1200 SEK per night for
single rooms) available.

Link for the registration page: https://www.axacoair.se/go?OCWMn95D
Late registration deadline: August 8, 2017.


PROGRAMME COMMITTEE
---
• Parosh Aziz Abdulla (University of Uppsala),
• Lars Birkedal (University of Aarhus),
• Nikolaj Bjorner (Microsoft Research),
• Maria Paola Bonacina (Università degli Studi di Verona),
• Patricia Bouyer-Decitre (LSV, ENS Cachan),
• Agata Ciabattoni (University of Viena),
• Thierry Coquand (University of Gothenburg),
• Mads Dam (KTH, Stockholm), PC co-chair
• Ugo Dal Lago (University of Bologna),
• Anuj Dawar (Cambridge University),
• Valentin Goranko (Stockholm University), PC co-chair
• Maribel Fernandez (King's College London),
• Martin Grohe (RWTH Aachen),
• Lauri Hella (University of Tampere),
• Joost-Pieter Katoen (RWTH Aachen),
• Orna Kupferman (University of Jerusalem),
• Leonid Libkin (University of Edinburgh),
• Angelo Montanari (University of Udine),
• Catuscia Palamidessi (Paris, INRIA),
• Frank Pfenning (Carnegie Mellon University, Pittsburgh)
• Ram Ramanujam (Institute of Mathematical Sciences, Chennai),
• Jean-Francois Raskin 

[TYPES/announce] HIGHLIGHTS 2017 -- Call for Participation

2017-06-30 Thread Nikos Tzevelekos

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

[with apologies for multiple postings]

HIGHLIGHTS 2017 -- FIFTH CONFERENCE ON HIGHLIGHTS OF LOGIC, GAMES AND 
AUTOMATA

Call for Participation
12-15 SEPTEMBER 2017, London, UK
http://highlights-conference.org

* HIGHLIGHTS 2017 is the fifth conference on Highlights of Logic, Games 
and Automata which aims at integrating the community working in these 
fields.  Papers from these areas are dispersed across many conferences, 
which makes them difficult to follow. A visit to Highlights conference 
should offer a wide picture of the latest research in the field and a 
chance to meet everybody in the community, not just those who happen to 
publish in one particular proceedings volume.


* The program will offer 59 contributed talks, three keynotes:

+ Mikolaj Bojanczyk, "Recognisability equals MSO definability for
graphs of bounded treewidth"
+ Sanjay Jain, "Quasi Polynomial and FPT algorithms for parity games"
+ Hung Ngo, "Shannon-type inequalities, submodular width, and
disjunctive datalog"

two special sessions organized by:
+ Patricia Bouyer, "Games played on graphs: quantitative games, games
with multi-objectives, non-zero sum games"
+ Alexandra Silva, "Model learning, automata and its applications"

and two tutorials
+ Veronique Cortier, "Verification of security protocols"
+ Damien Pous,  "Coinduction up to and automata algorithms"

Full programme can be found at: http://highlights-conference.org.

*  Registration open until August 20, 2017
   at http://highlights-conference.org/register/