SIGLOG Monthly 191
April  1, 2017

*******************************************************************
* Past issues of the newsletter are available at
 http://lii.rwth-aachen.de/lics/newsletters/
* Instructions for submitting an announcement to the newsletter
 can be found at
 http://lii.rwth-aachen.de/lics/newsletters/inst.html
*******************************************************************

TABLE OF CONTENTS
* NEWS
  LICS 2017 - Early registration deadline approaching
  ACM SIGLOG Announcement
* DEADLINES
  Forthcoming Deadlines
* CALLS
  CALCO 2017 - Last Call for Papers
  CALCO Tools 2017 - Call for Contributions
  LearnAut 2017 - Call for Papers
  CCA 2017 -  Second Call for Papers
  DARe at LPNMR 2017 - Call for Papers
  METAFINITE 2017 - First Call for Presentations
  MARKTOBERDORF SUMMER SCHOOL -  Call for Participation
  ITP 2017 - Call for Papers
  FSCD 2017 - Second Call for Papers
  LACompLing 2017 - Call for papers
  LORI-VI 2017 - Third Call for Papers (extended deadline)
  CCC 2017 - Call for papers
  METAFINITE 2017 - Second Call for Presentations (Extended deadline)
  ESORICS 2017 - Call For Papers
  MFCS 2017 - Call for Papers
  VECoS 2017 - Call for Papers
  TABLEAUX 2017 - Call for Papers
  FroCoS 2017 - Call for Papers
  RV 2017 - 3rd Call for papers and tutorials
  CiE 2017 - Call for Informal Presentations
  CALCO EI 2017 - Call for Contributions
  LC 2017: Call for submissions
  AIRIM'17 - Call for Papers
  TIME 2017 -  Call for Papers
  SyGuS-COMP 2017 - Call for Solvers and Benchmarks Submission
  NLS 2017 - Second announcement and call for papers
  SR 2017 - Preliminary Call for Papers
  HaPoC4 - Second Call for Papers
  PPDP 2017 - Call for Papers
  GandALF 2017 - Preliminary Call for Papers
  RERS Challenge 2017 - Call for Papers
  RSSRail 2017 - Call for Papers
  LSFA 2017 - Second Call for Papers
  EPS 2017 - Call for Posters and Encyclopedia Entries
* JOB ANNOUNCEMENTS


THIRTY-SECOND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE
(LICS 2017)
  18 - 23 June 2017, Reykjavik
  Early registration deadline: April 7, 2017
  http://lics.rwth-aachen.de/lics17/
  http://www.icetcs.ru.is/lics2017-registration.html
* We strongly encourage conference and workshop participants to
  register, and to make their travel and accommodation arrangements,
  as soon as possible. Iceland is a very hot holiday destination these
  days and it becomes fully booked soon, especially during the summer
  months.
* ACCEPTED PAPERS
  http://lics.rwth-aachen.de/lics17/accepted.html
* MENTORING WORKSHOP
  Sponsorship application deadline:
  31 March 2017
* OTHER WORKSHOPS
  INFINITY: 19th International Workshop on Verification of
    Infinite-State Systems.
  LearnAut: Learning and Automata.
  LCC: Logic and Computational Complexity.
  LMW: Logic Mentoring Workshop.
  LOLA: Syntax and Semantics of Low-Level Languages.
  METAFINITE model theory and definability and complexity of numeric
    graph parameters.
  WiL: Women in Logic.
  http://lics.rwth-aachen.de/lics17/workshops.html



ACM SIGLOG ANNOUNCEMENT
  http://siglog.acm.org
* The ACM has recently chartered a Special Interest Group on Logic and
  Computation (ACM SIGLOG).
* We are pleased to announce the 2016 ACM SIGLOG election results for
  the term of 1 July 2016 - 30 June 2019. The SIGLOG Chair is Prakash
  Panangaden and the other officers are Luke Ong (vice-Chair), Amy
  Felty (Treasurer) and Alexandra Silva (Secretary).
* The ACM-IEEE Symposium on Logic in Computer Science is the flagship
  conference of SIGLOG. SIGLOG will also actively seek association
  agreements with other conferences in the field. A SIGLOG newsletter
  (SIGLOG News) is also published quarterly in an electronic format
  with community news, technical columns, members' feedback,
  conference reports, book reviews and other items of interest to the
  community.
* One can join SIGLOG by visiting
  https://campus.acm.org/public/qj/gensigqj/siglist/gensigqj_siglist.cfm
  It is possible to join SIGLOG without joining ACM (the SIGLOG
  membership fee is $25 and $15 for students).



DATES
* CALCO 2017
  Last Call for Papers
  June 13 - 16, 2017
  Ljubljana, Slovenia
  http://coalg.org/calco17/
  Paper submission: April 7, 2017
* CALCO Tools 2017
  Call for Contributions
  A satellite event of CALCO 2017
  June 13, 2017, Ljubljana, Slovenia
  http://coalg.org/calco17/tools.html
  Paper submission: April 7, 2017
* LearnAut 2017
  Call for Papers
  LICS 2017 Workshop
  June 19, Reykjavik (Iceland)
  Website: https://learnaut.wordpress.com/
  Submission deadline: April, 1st, 2017
* CCA 2017
  Second Call for Papers
  http://cca-net.de/cca2017/
  July 24-27, 2017, Daejeon, South Korea
  Submission deadline: April 3, 2017
* DARe at LPNMR 2017
  Call for Papers
  Espoo, Finland, 3 July 2017
  Deadline: 10 April 2017
  https://sites.google.com/view/dare-17
* METAFINITE 2017
  First Call for Presentations
  Affiliated with LICS 2017
  June 19 2017,  Reykjavik, Iceland
  http://cs.technion.ac.il/~janos/metafinte2017
  Submission: Friday 7 April 2017
* MARKTOBERDORF SUMMER SCHOOL
  Call for Participation
  Logical Methods for Safety and Security of Software Systems
  August 2-11 2017
  https://asimod.in.tum.de/2017/
  Apply online: https://asimod.in.tum.de/2017/participation.shtml
  Deadline: April 9
* ITP 2017
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with TABLEAUX 2017 and FroCoS 2017
  http://itp2017.cic.unb.br
  Paper submission deadline: April 10, 2017
* FSCD 2017
  Second Call for Papers
  Second Call for Papers
  4 - 7 September 2017, Oxford, UK
  http://www.cs.ox.ac.uk/conferences/fscd2017/
  Submission Deadline: 14 April 2017
* LACompLing 2017
  Call for papers
  Stockholm, August 18-19, 2017
  http://staff.math.su.se/rloukanova/LACompLing17.html
  Submission deadline for regular papers: April 14, 2017
* LORI-VI 2017
  Third Call for Papers (extended deadline)
  September 11-14, 2017, Hokkaido University, Sapporo, Japan
  http://golori.org/lori2017/
  Submission Deadline extended to Friday April 14
* CCC 2017
  Call for papers
  Loria, 26-30 June 2017, Nancy, France
  https://members.loria.fr/MHoyrup/CCC/home.html
  Deadline: 17 April 2017
* METAFINITE 2017
  Second Call for Presentations (Extended deadline)
  Affiliated with LICS 2017
  June 19 2017,  Reykjavik, Iceland
  http://cs.technion.ac.il/~janos/metafinte2017
  Submission: Friday 18 April 2017
* ESORICS 2017
  Call For Papers
  Oslo, Norway, September  11-15, 2017
  https://www.ntnu.edu/web/esorics2017/
  Paper submission deadline: April 19, 2017
* MFCS 2017
  Call for Papers
  Aalborg, Denmark, August 21-25, 2017
  http://mfcs2017.cs.aau.dk/
  Paper submission deadline: April 24th, 2017 (AoE)
* VECoS 2017
  Call for Papers
  August 24-25, 2017 Montreal, Canada
  https://vecos.ensta-paristech.fr/2017/
  Papers deadline:  April 24, 2017 (AoE)
* TABLEAUX 2017
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with FroCoS 2017 and ITP 2017.
  http://tableaux2017.cic.unb.br
  Submission deadline: April 25, 2017
* FroCoS 2017
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with TABLEAUX 2017 and ITP 2017
  http://frocos2017.cic.unb.br
  Submission Deadlines: 24 April 2017 (abstracts)
  and 28th April 2017 (full papers)
* RV 2017
  Call for Papers and Tutorials
  September 13-16, Seattle, WA, USA
  http://rv2017.cs.manchester.ac.uk
  Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth)
* CiE 2017
  Call for Informal Presentations
  Turku, Finland, June 12-16, 2017
  http://math.utu.fi/cie2017
  Submission deadline: May 1, 2017
* CALCO EI 2017
  Call for Contributions
  A satellite event of CALCO 2017
  June 13-16, 2017
  http://coalg.org/calco17/ei.html
  Submission of short contributions: May 1, 2017
* LOGIC COLLOQUIUM 2017
  First Announcement and Call for Submissions
  August 14-20, 2017, Stockholm, Sweden
  https://www.lc17.conf.kth.se
  Abstract submission for contributed talks:  May 5, 2017
* AIRIM'17
  Call for Papers
  Prague, Czech Republic, 3 - 6 September, 2017
  https://www.fedcsis.org/2017/airim
  Paper submission (strict deadline): May 10 2017 23:59:59 pm HST
* TIME 2017
  Call for Papers
  Mons (Belgium), 16-18 October 2017
  http://informatique.umons.ac.be/time2017/
  Full papers due: May 12
* SyGuS-COMP 2017
  Call for Solvers and Benchmarks Submission
  July 22, 2017 Heidelberg, Germany (with CAV and SYNT)
  http://www.sygus.org/SyGuS-COMP2017.html
  Benchmark submission deadline: 15 May 2017
* NLS 2017
  Second announcement and call for papers
  Stockholm, August 7 - 11, 2017
  Department of Mathematics, Kräftriket Campus, Stockholm University.
  https://www.sls17.conf.kth.se
  Early registration ends: May 15, 2017
* SR 2017
  Preliminary Call for Papers
  Liverpool, UK, July 26-27, 2017
  http://sr2017.csc.liv.ac.uk/
  Submission deadline: May 15, 2017
* HaPoC4
  Second Call for Papers
  4-7 October 2017, Masaryk University Brno
  https://hapoc2017.sciencesconf.org/
  Deadline: 15 May 2017
* PPDP 2017
  Call for Papers
  Namur, Belgium, October 9-11, 2017
  (co-located with LOPSTR'17)
  http://complogic.cs.mcgill.ca/ppdp2017
  Deadline: 12 May (abstracts) / 19 May (papers)
* GandALF 2017
  Preliminary Call for Papers
  Rome, Italy,  20-22 September 2017
  http://gandalf2017.istc.cnr.it
  Paper submission deadline: May 26, 2017
* RERS Challenge 2017
  Call for Papers
  Santa Barbara, USA, July 2017.
  Deadline for all submission: 01.07.2017
* RSSRail 2017
  Call for Papers
  November 14-16, 2017, Pistoia, Italy
  https://conferences.ncl.ac.uk/rssrail/
  paper submission deadline: June 8, 2017
* LSFA 2017
  Second Call for Papers
  23-24 September 2017, Brasilia, Brazil
  Satellite event of TABLEAUX, FroCoS, and ITP 2017
  http://lsfa2017.cic.unb.br/
  Submission deadline: 21 June 2017
* EPS 2017
  Call for Posters and Encyclopedia Entries
  24, 25th of September 2017, Brasilia, Brazil
  http://proofsystem.github.io/Encyclopedia/
  Submission: August 1



7TH INTERNATIONAL CONFERENCE ON ALGEBRA AND COALGEBRA IN COMPUTER
SCIENCE (CALCO 2017)
  Last Call for Papers
  June 13 - 16, 2017
  Ljubljana, Slovenia
  http://coalg.org/calco17/
* IMPORTANT DATES
  Abstract submission: April 3, 2017
  Paper submission: April 7, 2017
  Author notification: May 15, 2017
  Final version due: May 31, 2017
* SCOPE
  CALCO aims to bring together researchers and practitioners with
  interests in foundational aspects, and both traditional and emerging
  uses of algebra and coalgebra in computer science.
  It is a high-level, bi-annual conference formed by joining the
  forces and reputations of CMCS (the International Workshop on
  Coalgebraic Methods in Computer Science), and WADT (the Workshop on
  Algebraic Development Techniques). Previous CALCO editions took
  place in Swansea (Wales, 2005), Bergen (Norway, 2007), Udine (Italy,
  2009), Winchester (UK, 2011), Warsaw (Poland, 2013) and Nijmegen
  (the Netherlands, 2015).
* INVITED SPEAKERS
  - Nicoletta Sabadini - University of Insubria, IT
  - Alex Simpson -  University of Ljubljana, SL
  Joint Session with MFPS on Metrics, Privacy and Learning:
  - James Worrell - University of Oxford, UK (joint with MFPS)
  Further Invited Speakers
  - Catuscia Palamidessi - Ecole polytechnique, FR (joint with MFPS)
  - Vincent Danos - Ecole normale superieure, FR (joint with MFPS)
  - Marco Gaboardi - University at Buffalo, USA (joint with MFPS)
* SPECIAL SESSION ON METRICS, PRIVACY AND LEARNING
  (joint event with MFPS)
* TOPICS OF INTEREST
  - Abstract models and logics
  - Specialised models and calculi
  - Algebraic and coalgebraic semantics
  - System specification and verification
  - Corecursion in Programming Languages
  - Algebra and Coalgebra in quantum computing
  - String Diagrams and Network Theory
* BEST PAPER AND BEST PRESENTATION AWARDS
  This edition of CALCO will feature two awards: a Best Paper Award
  whose recipients will be selected by the PC before the conference and
  a Best Presentation Award, elected by the participants.
* PC CHAIRS
  Filippo Bonchi (ENS Lyon, France, co-chair)
  Barbara Koenig (University of Duisburg-Essen, Germany, co-chair)
* PUBLICITY CHAIR
  Fabio Zanasi (UCL, UK)
* SATELLITE WORKSHOPS: CALCO EARLY IDEAS AND CALCO TOOLS
  The CALCO Early Ideas Workshop is intended to enable presentation of
  work in progress and original research proposals. PhD students and
  young researchers are particularly encouraged to contribute.
  The CALCO Tools Workshop is dedicated to tools based on algebraic
  and/or coalgebraic principles.
  CALCO 2017 will run together with the CALCO Early Ideas Workshop,
  with dedicated sessions at the end of each conference day. CALCO
  Tools will take place on June 13.



CALCO Tools 2017
  Call for Contributions
  A satellite event of CALCO 2017
  June 13, 2017, Ljubljana, Slovenia
  http://coalg.org/calco17/tools.html
* IMPORTANT DATES
  Abstract submission: April 3, 2017
  Paper submission: April 7, 2017
  Author notification: May 15, 2017
  Final version: May 31, 2017
* SCOPE A special workshop at CALCO 2017 is dedicated to tools based
  on algebraic and/or coalgebraic principles or that are emerging from
  the intersection of the two approaches, such as graph grammars or
  coinductive proof techniques.  These include
  systems/prototypes/tools developed specifically for design,
  checking, execution, and verification of (co)algebraic
  specifications, but also tools targeting different application
  domains while making core or interesting use of (co)algebraic
  techniques. CALCO-Tools will take place on the same dates as the
  main CALCO conference, with no overlap between the technical
  programmes of the two events.
* INVITED SPEAKER
  Nate Foster - Cornell University, USA
* PC CHAIR
  Till Mossakowski - Universitat Magdeburg, Germany
* SUBMISSION DETAILS
  http://coalg.org/calco17/tools.html



LEARNING AND AUTOMATA - LICS 2017 WORKSHOP (LEARNAUT 2017)
  Call for Papers
  June 19, Reykjavik (Iceland)
  Website: https://learnaut.wordpress.com/
* Grammatical Inference (GI) studies machine learning algorithms for
  classical recursive models of computations like automata and
  grammars.  The expressive power of these models and the complexity
  of associated computational problems are a major research topic
  within theoretical computer science (TCS). This workshop aims at
  offering a favorable place for dialogue and at generating
  discussions between researchers from these two communities.  We
  invite submissions of recent works, possibly preliminary ones,
  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. A
  list of topics of interest can be found on the website.
* INVITED SPEAKERS, [TBC]:
  Kim G. Larsen (Aalborg),
  Mehryar Mohri (NYU & Google),
  Alexandra Silva (UCL)
* IMPORTANT DATES:
  Submission deadline: April, 1st, 2017
  Notification of acceptance: mid-April, 2017



FOURTEENTH INTERNATIONAL CONFERENCE ON COMPUTABILITY AND COMPLEXITY
IN ANALYSIS (CCA 2017)
  Final Call for Papers
  July 24-27, 2017, Daejeon, South Korea
  http://cca-net.de/cca2017/
  Submission deadline: April 3, 2017
* TOPICS
  - Computable analysis
  - Complexity on real numbers
  - Constructive analysis
  - Domain theory and analysis
  - Theory of representations
  - Computable numbers, subsets and functions
  - Randomness and computable measure theory
  - Models of computability on real numbers
  - Realizability theory and analysis
  - Reverse analysis
  - Real number algorithms
  - Implementation of exact real number arithmetic
* INVITED SPEAKERS
  Hee-Kap Ahn (Pohang, Republic of Korea)
  Veronica Becher (Buenos Aires, Argentina)
  Anders Hansen (Cambridge, UK)
  Takayuki Kihara (Berkeley, USA)
  Amaury Pouly (Max Planck Institute, Germany)
  Linda Brown Westrick (Connecticut, USA)
* FUNDING
  Funding opportunities for student members of the Association for
  Symbolic Logic (ASL) are available.
* IMPORTANT DATES
  Submission deadline: April 3, 2017
  Notification of authors: May 1, 2017
  Final version: May 29, 2017
* Conference Web Page
  http://cca-net.de/cca2017/
* SATELLITE WORKSHOP ON REAL VERIFICATION
  A co-located "Workshop on Real Verification" will take place on
  Friday, July 28
  https://complexity.kaist.edu/CCA2017/workshop.html



THE FOURTH INTERNATIONAL WORKSHOP ON DEFEASIBLE AND AMPLIATIVE
REASONING (DARe)
  Call for Papers
  Espoo, Finland, 3 July 2017
  https://sites.google.com/view/dare-17
  held at the International Conference on Logic Programming and
  Nonmonotonic Reasoning (LPNMR 2017)
* Latest News
  There will be a special issue of the International Journal of
  Approximate Reasoning (IJAR) containing selected extended versions
  of papers that have been accepted at DARe. The call for this special
  issue is planned for late 2017. More information to follow.
* Workshop Description, Aims and Scope
  Classical reasoning is not flexible enough when directly applied to
  the formalization of certain nuances of human quotidian decision
  making. These involve different kinds of reasoning such as reasoning
  with uncertainty, exceptions, similarity, vagueness, incomplete or
  contradictory information and many others.
  DARe welcomes contributions on all aspects of defeasible and
  ampliative reasoning such as (but not limited to):
  - Abductive and inductive reasoning
  - Explanation finding, diagnosis and causal reasoning
  - Inconsistency handling and exception-tolerant reasoning
  - Decision-making under uncertainty and incomplete information
  - Default reasoning, non-monotonic reasoning, non-monotonic logics,
    conditional logics
  - Specific instances and variations of ampliative and defeasible
    reasoning
  - Probabilistic and statistical approaches to reasoning
  - Vagueness, rough sets, granularity and fuzzy-logics
  - Philosophical foundations of defeasibility
  - Empirical studies of reasoning
  - Relationship with cognition and language
  - Contextual reasoning
  - Preference-based reasoning
  - Analogical reasoning
  - Similarity-based reasoning
  - Belief dynamics and merging
  - Argumentation theory, negotiation and conflict resolution
  - Heuristic and approximate reasoning
  - Defeasible normative systems
  - Reasoning about actions and change
  - Reasoning about knowledge and belief, epistemic and doxastic logics
  - Ampliative and defeasible temporal and spatial reasoning
  - Computational aspects of reasoning with uncertainty
  - Implementations and systems
  - Applications of uncertainty in reasoning
* IMPORTANT DATES
  - Submission deadline: 10 April 2017
  - Notification: 1 May 2017
  - Camera ready: 22 May 2017
  - Workshop date: 3 July 2017
* WORKSHOP CO-CHAIRS
  - Richard Booth, Cardiff University, UK
  - Giovanni Casini, University of Luxembourg
  - Ivan Varzinczak, CRIL, Univ. Artois & CNRS, France



WORKSHOP ON METAFINITE MODEL THEORY AND DEFINABILITY AND COMPLEXITY OF
NUMERIC GRAPH PARAMETERS  (METAFINITE 2017)
  First Call for Presentations
  Affiliated with LICS 2017
  June 19 2017,  Reykjavik, Iceland
  http://cs.technion.ac.il/~janos/metafinte2017
* AIM:
  The workshop will bring together three strands of investigation
  dealing with the model theory and complexity of numeric graph
  parameters and their generalization to other first order structures.
  (A) Gurevich and Graedel in 1998 initiated the study of metafinite
  model theory to study descriptive complexity of numeric parameters.
  Metafinite model theory found most of its applications in databases
  and abstract state machines (ASM), but was not widely studied in
  connection to numeric combinatorial parameters.
  (B) Courcelle, Makowsky and Rotics initiated a definability theory
  for graph polynomials in 2000 and proved metatheorems for graph
  polynomials and numeric structural parameters.
  (C) Kotek, Makowsky and Ravve questioned wether the Turing model of
  computation was the right choice to discuss the complexity of
  numeric graph parameters and proposed alternatives using the
  Blum-Shub-Smale model of computation.
  The aim of the workshop is to bring together researchers of these
  three strands in order to further explore and elaborate on the
  appropriate framework for the study of numeric structural parameters
  and polynomials and to investigate further metatheorems.
  For more background see http://cs.technion.ac.il/~janos/metafinte2017
* ORGANIZERS and PC:
  A. Goodall (Charles University, Prague)
  J.A. Makowsky (Technion, Haifa)
  E.V. Ravve (ORT-Braude, Karmiel)
* CONFIRMED SPEAKERS:
  E. Graedel (RWTH, Aachen)
  K. Meer (BTU, Cottbus)
  M. Ziegler (KAIST, Southkorea)
  T. Kotek (TU, Vienna)
* IMPORTANT DATES (AoE):
  Submission: Friday 7 April 2017
  Notification: Monday 24 April 2017
  Final version: Monday 15 May 2017
  Workshop: Monday June 19 2017
* CONTACT:
  For further questions write to Dr. Elena Ravve at
  cselena@braude.ac.il



MARKTOBERDORF SUMMER SCHOOL
  Call for Participation
  Logical Methods for Safety and Security of Software Systems
  August 2-11 2017
  https://asimod.in.tum.de/2017/
* Apply online: https://asimod.in.tum.de/2017/participation.shtml
  Deadline: April 9
* The "Marktoberdorf Summer School" is an 11-day event for young
  computer scientists and mathematicians, typically doctoral and
  post-doctoral researchers. It provides mini-courses on
  state-of-the-art topics in "Logical Methods for Safety and Security
  of Software Systems" and leaves ample room for interaction between
  participants and speakers.
* SPEAKERS AND COURSES:
  CHRISTEL BAIER:
     Probabilistic Model Checking
  GILLES BARTHE:
     Relational Verification for Differential Privacy and Cryptography
  NICOLAJ BJORNER:
     Satisfiability Modulo Theories
  CEDRIC FOURNET:
     Security Verification in F*
  ORNA GRUMBERG:
     Program Repair
  JOOST-PIETER KATOEN:
     Foundations of Probabilistic Programming
  DANIEL KROENING:
     Static Analysers for Black Hats and White Hats
  ORNA KUPFERMANN:
     Automated Synthesis of Temporal-Logic Specifications
  MAGNUS MYREEN:
     Verification of an ML Compiler
  TOBIAS NIPKOW:
     Verified Analysis of Functional Data Structures
  LARRY PAULSON:
     Proof Support for Hybrid System Analysis
  ANDRE PLATZER:
     Dynamic Logic for Dynamical Systems



8th INTERNATIONAL CONFERENCE ON INTERACTIVE THEOREM PROVING (ITP 2017)
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with TABLEAUX 2017 and FroCoS 2017
  http://itp2017.cic.unb.br
* The ITP conference series is concerned with all topics related to
  interactive theorem proving, ranging from theoretical foundations to
  implementation aspects and applications in program verification,
  security, and formalization of mathematics. ITP is the evolution of
  the TPHOLs conference series to the broad field of interactive
  theorem proving. TPHOLs meetings took place every year from 1988
  until 2009.
* PROGRAM CHAIRS
  Mauricio Ayala-Rincon, University of Brasilia
  Cesar Munoz, NASA
* ORGANISATION
  University of Brasilia
  Federal University of Rio Grande do Norte
* IMPORTANT DATES
  Abstract submission deadline: April 3, 2017
  Full paper submission deadline: April 10, 2017
  Author notification:  June 2, 2017
  Camera-ready papers:  June 30, 2017



SECOND INTERNATIONAL CONFERENCE ON FORMAL STRUCTURES FOR COMPUTATION
AND DEDUCTION (FSCD'17)
  Second Call for Papers
  4 - 7 September 2017, Oxford, UK
  in-cooperation with the ACM SIGLOG and SIGPLAN and co-located with
  ICFP 2017
  http://www.cs.ox.ac.uk/conferences/fscd2017/
* FSCD (http://fscdconference.org/) covers all aspects of formal
  structures for computation and deduction from theoretical
  foundations to applications.  Building on two communities, RTA
  (Rewriting Techniques and Applications) and TLCA (Typed Lambda
  Calculi and Applications), FSCD embraces their core topics and
  broadens their scope to closely related areas in logics, proof
  theory and new emerging models of computation such as quantum
  computing or homotopy type theory.
* IMPORTANT DATES.
  All deadlines are midnight anywhere-on-earth (AoE)
  and are firm; late submissions will not be considered.
  Abstract Deadline:  7 April 2017
  Submission Deadline: 14 April 2017
  Rebuttal:  29--31 May   2017
  Notification: 14 June  2017
  Camera-Ready: 7 July  2017
* TOPICS. Suggested, but not exclusive, list of topics for submission are:
   1. Calculi: Lambda calculus * Concurrent calculi * Logics * Rewriting
   systems * Proof theory * Type theory and logical frameworks
   2. Methods in Computation and Deduction: Type systems * Induction and
   coinduction * Matching, unification, completion, and orderings *
   Strategies * Tree automata * Model checking * Proof search and
   theorem proving * Constraint solving and decision procedures
   3. Semantics: Operational semantics * Abstract machines * Game
   Semantics * Domain theory and categorical models * Quantitative
   models
   4. Algorithmic Analysis and Transformations of Formal Systems: Type
   Inference and type checking * Abstract Interpretation * Complexity
   analysis and implicit computational complexity * Checking
   termination, confluence, derivational complexity and related
   properties * Symbolic computation
   5. Tools and Applications: Programming and proof environments *
   Verification tools * Libraries for proof assistants and interactive
   theorem provers * Case studies in proof assistants and interactive
   theorem provers * Certification
* BEST PAPER AWARD BY JUNIOR RESEARCHERS The program committee will
  consider declaring this award to a paper in which all authors are
  junior researchers: a junior researcher is a person who is either a
  student or whose PhD award date is less than three years from the
  first day of the meeting.
* PROGRAM COMMITTEE CHAIR
  Dale Miller, Inria Saclay & LIX 



WORKSHOP ON LOGIC AND ALGORITHMS IN COMPUTATIONAL LINGUISTICS
(LACOMPLING 2017)
  Call for papers
  Stockholm, August 18-19, 2017
  http://staff.math.su.se/rloukanova/LACompLing17.html
* Affiliated with the 26th Annual EACSL Conference on Computer Science
  Logic CSL'2017 (Stockholm, 20--26 August 2017)
  https://www.csl17.conf.kth.se/
* Co-located with Logic in Stockholm 2017:
  https://www.lis17.conf.kth.se/
* DESCRIPTION
  Computational linguistics studies natural language in its various
  manifestations from a computational point of view, both on the
  theoretical level (modeling grammar modules dealing with natural
  language form and meaning, and the relation between these two) and
  on the practical level (developing applications for language and
  speech technology). Right from the start in the 1950ties, there have
  been strong links with computer science and logic - one can think of
  Chomsky's contributions to the theory of formal languages and
  automata, or Lambek's logical modeling of natural language
  syntax. The workshop assesses the place of computer science logic in
  present day computational linguistics. It intends to be a forum for
  presenting new results as well as work in progress.
* SCOPE The workshop focuses on logical approaches to the
  computational processing of natural language, and on the
  applicability of methods and techniques from the study of artificial
  languages (programming/logic) in computational linguistics.
* TOPICS. The topics of LACompLing2017 include, but are not limited
  to:
  - Computational theories of human language
  - Computational syntax
  - Computational semantics
  - Computational syntax-semantics interface
  - Interfaces between morphology, lexicon, syntax, semantics, speech,
   text, pragmatics
  - Computational grammar
  - Logic and reasoning systems for linguistics
  - Type theories for linguistics
  - Models of computation and algorithms for linguistics
  - Language processing
  - Parsing algorithms
  - Generation of language from semantic representations
  - Large-scale grammars of natural languages
  - Multilingual processing
  - Data science in language processing
  - Machine learning of language
  - Interdisciplinary methods
  - Integration of formal, computational, model theoretic, graphical,
   diagrammatic, statistical, and other related methods
  - Logic for information extraction or expression in written and spoken language
  - Language theories based on biological fundamentals of information
   and languages
  - Computational neuroscience of language
* IMPORTANT DATES
  Submission deadline for regular papers: April 14, 2017
  Notification of paper acceptance:  May 31, 2017
  Deadline for abstracts of short presentations: June 4, 2017
  Notifications for short presentations: June 12, 2017
  Deadline for final submissions: June 25, 2017
  Workshop: August 18-19, 2017
* CONTACT
  Roussanka Loukanova (rloukanova@gmail.com)
  Valeria de Paiva (valeria.depaiva@gmail.com)



THE SIXTH INTERNATIONAL CONFERENCE ON LOGIC, RATIONALITY
AND INTERACTION (LORI-VI 2017)
  Third Call for Papers (extended deadline)
  September 11-14, 2017, Hokkaido University, Sapporo, Japan
  http://golori.org/lori2017/
* OVERVIEW. The International Conference on Logic, Rationality and
  Interaction (LORI) conference series aims at bringing together
  researchers working on a wide variety of logic-related topics that
  concern the understanding of rationality and interaction. The series
  aims at fostering a view of Logic as an interdisciplinary endeavour,
  and supports the creation of an East-Asian community of
  interdisciplinary researchers.
* NEWS. Submission Deadline extended to Friday April 14
* WEBSITE. For detailed conference information and registration,
  please visit http://golori.org/lori2017/ .
* INVITED SPEAKERS
  Mike Dunn: Indiana University, U.S.A.
  Alan Hajek:  Australian National University, Australia
  Nina Gierasimczuk: Technical University of Denmark, Denmark
  Willemien Kets: Northwestern University, U.S.A
  Sara Negri: University of Helsinki, Finland
  Hiroakira Ono: JAIST, Japan
* PC CHAIRS
  Alexandru Baltag: University of Amsterdam, The Netherlands
  Jeremy Seligman: University of Auckland, New Zealand



CONTINUITY, COMPUTABILITY, CONSTRUCTIVITY FROM LOGIC TO ALGORITHMS
2017 (CCC 2017)
  Call for papers
  Loria, 26-30 June 2017, Nancy, France
  https://members.loria.fr/MHoyrup/CCC/home.html
* OVERVIEW.  CCC is a workshop series bringing together researchers
  from exact real number computation, computable analysis, effective
  descriptive set theory, constructive analysis, and related
  areas. The overall aim is to apply logical methods in these
  disciplines to provide a sound foundation for obtaining exact and
  provably correct algorithms for computations with real numbers and
  related analytical data, which are of increasing importance in
  safety critical applications and scientific computation.  *
* SCOPE. The workshop specifically invites contributions in the areas
  - Exact real number computation,
  - Correctness of algorithms on infinite data,
  - Computable analysis,
  - Complexity of real numbers, real-valued functions, etc.
  - Effective descriptive set theory
  - Scott's domain theory,
  - Constructive analysis,
  - Category-theoretic approaches to computation on infinite data,
  - Weihrauch degrees,
  - And related areas.
* INVITED SPEAKERS.
  Matthew de Brecht (Kyoto, Japan)
  Bernhard Reus (Brighton, UK)
  Matthias Schroder (Darmstadt, Germany)
  Alex Simpson (Ljubljana, Slovenia)
* IMPORTANT DATES
  Deadline: 17 April 2017
* PROGRAMME COMMITTEE CHAIRS
  Mathieu Hoyrup (Nancy) (co-chair)
  Dieter Spreen (Siegen) (co-chair)



WORKSHOP ON METAFINITE MODEL THEORY AND DEFINABILITY AND COMPLEXITY OF
NUMERIC GRAPH PARAMETERS (METAFINITE 2017)
  Affiliated with LICS 2017
  June 19 2017,  Reykjavik, Iceland
  http://cs.technion.ac.il/~janos/metafinte2017
* AIM: The workshop will bring together three strands of investigation
  dealing with the model theory and complexity of numeric graph
  parameters and their generalization to other first order structures.
  (A) Gurevich and Graedel in 1998 initiated the study of metafinite
  model theory to study descriptive complexity of numeric parameters.
  Metafinite model theory found most of its applications in databases
  and abstract state machines (ASM), but was not widely studied in
  connection to numeric combinatorial parameters.
  (B) Courcelle, Makowsky and Rotics initiated a definability theory
  for graph polynomials in 2000 and proved metatheorems for graph
  polynomials and numeric structural parameters.
  (C) Kotek, Makowsky and Ravve questioned wether the Turing model of
  computation was the right choice to discuss the complexity of
  numeric graph parameters and proposed alternatives using the
  Blum-Shub-Smale model of computation.
  (D) Nesetril and Ossona de Mendez introduced key notions in the
  theory of sparse graphs, such as graph families of bounded expansion
  or polynomial expansion and the (surprisingly robust) nowhere dense
  versus somewhere dense dichotomy. Their 2012 book 'Sparsity -
  Graphs, Structures, and Algorithms' combines model theory, analysis
  and combinatorics and gives a comprehensive overview. Recently
  Nesetril, along with Ossona de Mendez and Goodall, used finite model
  theory, and particularly interpretation schemes, to provide a
  general construction of polynomial graph invariants.  This is an
  alternative approach to graph invariants related to the framework
  introduced by Makowsky and Zilber in 2005 and is best expressed in
  the framework of Metafinite model theory.
* The aim of the workshop is to bring together researchers of these
  four strands in order to further explore and elaborate on the
  appropriate framework for the study of numeric structural parameters
  and polynomials and to investigate further metatheorems.
* ORGANIZERS and PC:
  A. Goodall (Charles University, Prague)
  J.A. Makowsky (Technion, Haifa)
  E.V. Ravve (ORT-Braude, Karmiel)
* KEYNOTE SPEAKERS: (* still to be confirmed)
  Y. Gurevich (Microsoft, Redmond)
  E. Graedel (RWTH, Aachen)
  J. Nesetril (Charles University, Prague)
* CONFIRMED SPEAKERS:
  K. Meer (BTU, Cottbus)
  M. Ziegler (KAIST, Southkorea)
  T. Kotek (TU, Vienna)
  N. Labai (TU, Vienna)
  A. Manuel (CMI, Chennai)
  T. Colcombet (Paris VII, Paris)
  J. Hubicka* (Charles University, Prague)
  Introductory lecture will be given by the organizers.
* IMPORTANT DATES (AoE):
  Submission: Friday 18 April 2017
  Notification: Monday 1 May 2017
  Final version: Monday 15 May 2017
  Workshop: Monday June 19 2017



TWENTY-SECOND EUROPEAN SYMPOSIUM ON RESEARCH IN COMPUTER SECURITY
(ESORICS 2017)
  Call for Papers
  Oslo, Norway, September  11-15, 2017
  https://www.ntnu.edu/web/esorics2017/
* OVERVIEW
  ESORICS is the annual European research event in Computer Security.
  The Symposium started in 1990 and has been held in several European
  countries, attracting a wide international audience from both the
  academic and industrial communities. Papers offering novel research
  contributions in computer security are solicited for submission to
  the Symposium. The primary focus is on original, high quality,
  unpublished research and implementation experiences. We encourage
  submissions of papers discussing industrial research and
  development.
* IMPORTANT DATES
  Paper submission deadline: April 19, 2017
  Notification to authors: June 16, 2016
  Camera ready due: July 26, 2016
* WORKSHOP CHAIR
  Sokratis Katsikas, Norwegian University of Science and Technology
  (NTNU), Norway.
* PROGRAM COMMITTEE CHAIRS:
  Dieter Gollman, Technische Universitat Hamburg-Harburg, Germany
  Simon Foley, IMT Atlantique, France



42ND INTERNATIONAL SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER
SCIENCE (MFCS 2017)
  Call for Papers
  Aalborg, Denmark, August 21-25, 2017
  http://mfcs2017.cs.aau.dk/
* BACKGROUND:
  MFCS conference series is organized since 1972.  MFCS is a
  high-quality venue for original research in all branches of
  theoretical computer science. The broad scope of the conference
  encourages interactions between researchers who might not meet at
  more specialized venues.  MFCS 2017 consists of invited lectures and
  contributed talks, selected by an international program committee of
  researchers focusing on diverse areas of theoretical computer
  science. The conference will be accompanied by workshops.
* We encourage submission of original research papers in all areas of
  theoretical computer science, including (but not limited to) the
  following (alphabetically ordered):
  - algebraic and co-algebraic methods in computer science
  - algorithms and data structures
  - automata and formal languages
  - bioinformatics
  - combinatorics on words, trees, and other structures
  - computational complexity (structural and model-related)
  - computational geometry
  - computer-assisted reasoning
  - concurrency theory
  - cryptography and security
  - databases and knowledge-based systems
  - formal specifications and program development
  - foundations of computing
  - logics in computer science
  - mobile computing
  - models of computation
  - networks (incl. wireless, sensor, ad-hoc networks)
  - parallel and distributed computing
  - quantum computing
  - semantics and verification of programs
  - theoretical issues in artificial intelligence
  - types in computer science
* IMPORTANT DATES:
  Abstract submission deadline: April 20th, 2017   (AoE)
  Paper submission deadline:    April 24th, 2017   (AoE)
  Notification of authors: June 12th, 2017    (AoE)
  Camera-ready copies due: June 22nd, 2017    (AoE)
  Early registration deadline: June 23rd, 2017    (AoE)
  Late registration deadline: August 7th, 2017   (AoE; afterward, only
    on-site registration)
  Conference dates: August 21 - 25, 2017
* PROGRAM CHAIRS:
  Kim G. Larsen  - PC chair (Aalborg University, Denmark)
  Hans L. Bodlaender - co-chair (Eindhoven University of Technology,
    Netherlands)
  Jean-Francois Raskin - co-chair (Universite Libre de Bruxelles,
    Belgium)



11TH INTERNATIONAL CONFERENCE ON VERIFICATION AND EVALUATION
OF COMPUTER AND COMMUNICATION SYSTEMS (VECoS 2017)
  Call for Papers
  August 24-25, 2017 Montreal, Canada
  https://vecos.ensta-paristech.fr/2017/
* The VECoS conference series is interested in the analysis of
  computer and communication systems in which functional and
  extra-functional properties are inter-related. VECoS encourages the
  cross-fertilization between the various formal verification and
  evaluation approaches, methods and techniques, and especially those
  developed for concurrent and distributed hardware/software systems.
* Topics of interest to the conference include, but are not limited to:
  - Abstraction techniques
  - Certification standards for real-time systems
  - Compositional verification
  - Correct-by-construction design
  - Dependability assessment techniques
  - Equivalence checking
  - Model-checking
  - Parameterized verification
  - Performance and robustness evaluation
  - Probabilistic verification
  - QoS evaluation, planning and deployment
  - RAMS (Reliability Availability Maintainability Safety) assessment
  - Rigorous system design
  - Security protocols verification
  - Simulation techniques of discrete-event and hybrid systems
  - Supervisory control
  - Verification & validation of IoT
  - Verification & validation of safety-critical systems
  - Worst-case execution time analysis
* IMPORTANT DATES
  Abstract deadline: April 10, 2017
  Papers deadline: April 24, 2017 (Anywhere on Earth)
  Paper notification: May 29, 2017
  Camera-ready deadline: June 12, 2017
  Conference: August 24-25, 2017
* INVITED SPEAKERS
  Mourad Debbabi, Concordia University, Montreal, Canada
  Michel Dagenais, Polytechnique Montreal, Canada
  Mengchu Zhou, NJIT, Newark, NJ, USA
* PROGRAM CHAIRS
  Kamel Barkaoui, CNAM, Paris, France
  Hanifa Boucheneb, Polytechnique Montreal, Canada



26th INTERNATIONAL CONFERENCE ON AUTOMATED REASONING WITH
ANALYTIC TABLEAUX AND RELATED METHODS (TABLEAUX 2017)
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with FroCoS 2017 and ITP 2017.
  http://tableaux2017.cic.unb.br
* TABLEAUX is the main international conference at which research
  on all aspects, theoretical foundations, implementation techniques,
  systems development and applications, of the mechanization of
  tableau-based reasoning and related methods is presented.
* Tableau methods offer a convenient and flexible set of tools for
  automated reasoning in classical logic, extensions of classical
  logic, and a large number of non-classical logics. For large groups
  of logics, tableau methods can be generated automatically.  Areas
  of application include verification of software and computer
  systems, deductive databases, knowledge representation and its
  required inference engines, teaching, and system diagnosis.
* PROGRAM CHAIRS
  Claudia Nalon, University of Brasilia, Brazil
  Renate Schmidt, The University of Manchester, UK
* IMPORTANT DATES
  Abstract deadline: April 18, 2017
  Submission deadline: April 25, 2017
  Notifications: June 8, 2017
  Camera-Ready deadline: July 3, 2017.
* AWARDS
  The TABLEAUX 2017 Best Paper Award will be presented to the best
  submission nominated and chosen by the Program Committee among
  the accepted papers.



11th INTERNATIONAL SYMPOSIUM ON FRONTIERS OF COMBINING
SYSTEMS (FroCoS 2017)
  Call for Papers
  Brasilia, Brazil - 25-29 September 2017
  Co-located with TABLEAUX 2017 and ITP 2017
  http://frocos2017.cic.unb.br
* The main goal of the symposium is to disseminate and promote
  progress in research areas related to the development of techniques
  for the integration, combination, and modularization of formal
  systems together with their analysis.
* SCOPE OF CONFERENCE. In various areas of computer science, such as
  logic, computation, program development and verification, artificial
  intelligence, knowledge representation, and automated reasoning,
  there is an obvious need for using specialized formalisms and
  inference systems for selected tasks. To be usable in practice,
  these specialized systems must be combined with each other and
  integrated into general purpose systems. This has led---in many
  research areas---to the development of techniques and methods for
  the combination and integration of dedicated formal systems, as well
  as for their modularization and analysis.
* INVITED SPEAKERS
  Katalin Bimbe (University of Alberta, Canada) (joint with TABLEAUX
  	  and ITP)
  Jasmin Blanchette (Inria and LORIA, Nancy, France) (joint with
  	 TABLEAUX and ITP)
  Cezary Kaliszyk (University of Innsbruck, Austria) (joint with
  	 TABLEAUX and ITP)
  Cesare Tinelli (University of Iowa, USA)
  Renata Wassermann (University of Sao Paulo, Brazil)
* PROGRAM COMMITTEE CHAIRS
  Clare Dixon, University of Liverpool, UK
  Marcelo Finger, Universidade de Sao Paulo, Brazil
* ORGANISATION
  University of Brasilia
  Federal University of Rio Grande do Norte
* WORKSHOPS AND TUTORIALS
  Proposals for Workshops and Tutorial sessions have been solicited
  in a separate call, which can be found at
  http://frocos2017.cic.unb.br/#cfw.
  There are co-located events, described  at
  http://frocos2017.cic.unb.br/#colocated .
* IMPORTANT DATES
  Abstract deadline: April 24, 2017
  Submission deadline: April 28, 2017
  Notifications: June 9, 2017
  Camera-Ready deadline: June 23, 2017.



THE 17TH INTERNATIONAL CONFERENCE ON RUNTIME VERIFICATION (RV 2017)
  Call for Papers and Tutorials
  September 13-16, Seattle, WA, USA
  http://rv2017.cs.manchester.ac.uk
  rv2017@easychair.org
* Runtime verification is concerned with the monitoring and analysis
  of the runtime behaviour of software and hardware systems. Runtime
  verification techniques are crucial for system correctness,
  reliability, and robustness; they provide an additional level of
  rigor and effectiveness compared to conventional testing, and are
  generally more practical than exhaustive formal
  verification. Runtime verification can be used prior to deployment,
  for testing, verification, and debugging purposes, and after
  deployment for ensuring reliability, safety, and security and for
  providing fault containment and recovery as well as online system
  repair.
* Topics of interest to the conference include, but are not limited to:
  - specification languages
  - monitor construction techniques
  - program instrumentation
  - logging, recording, and replay
  - combination of static and dynamic analysis
  - specification mining and machine learning over runtime traces
  - monitoring techniques for concurrent and distributed systems
  - runtime checking of privacy and security policies
  - statistical model checking
  - metrics and statistical information gathering
  - program/system execution visualization
  - fault localization, containment, recovery and repair
  - integrated vehicle health management (IVHM)
  - Application areas of runtime verification include cyber-physical
  - systems, safety/mission-critical systems, enterprise and systems
  - software, autonomous and reactive control systems, health management
  - and diagnosis systems, and system security and privacy.
* We welcome contributions exploring the combination of runtime
  verification techniques with machine learning and static analysis.
  Whilst these are highlight topics, papers falling into these
  categories will not be treated differently from other contributions.
* IMPORTANT DATES.
  Abstract deadline: April 24, 2017 (Anywhere on Earth)
  Paper and tutorial deadline: May 1, 2017 (Anywhere on Earth)
  Tutorial notification: May 21, 2017
  Paper notification: June 26, 2017
  Camera-ready deadline: July 24, 2017
  Conference: September 13-16, 2017
* INVITED SPEAKERS
  Rodrigo Fonseca, Brown University, USA
  Vlad Levin and Jakob Lichtenberg, Microsoft Research, USA
  Andreas Zeller, Saarland University, Germany
* PROGRAM CHAIRS
  Shuvendu Lahiri, Microsoft Research, USA
  Giles Reger, University of Manchester, UK



UNVEILING DYNAMICS AND COMPLEXITY - 13TH COMPUTABILITY IN
EUROPE CONFERENCE (CIE 2017)
  Call for Informal Presentations
  Turku, Finland, June 12-16, 2017
  http://math.utu.fi/cie2017
  Submission deadline: May 1, 2017
* OVERVIEW: Continuing the tradition of past CiE conferences, in
  addition to the formal presentations based on the LNCS proceedings
  volume, we invite researchers to present informal presentations,
  that are prepared shortly before the conference and inform the
  participants about current research and work in progress (in the
  style of mathematics conferences).
* IMPORTANT DATES
  Submission deadline: May 1, 2017
  Notification of acceptance: Within two weeks of submission
* Please send us a brief description of your talk (one page) by the
  submission deadline May 1st.



CALCO Early Ideas 2017 WORKSHOP (CALCO EI 2017)
  Call for Contributions
  A satellite event of CALCO 2017
  June 13-16, 2017
  http://coalg.org/mfps-calco2017/cfp-early-ideas-workshop.html
  Submission of short contributions: May 1, 2017
* SCOPE. The programme of CALCO 2017 will include special sessions
  reserved for the CALCO Early Ideas Workshop, featuring presentations
  of work in progress and original research proposals. PhD students
  and young researchers are particularly encouraged to
  contribute. Attendance at the workshop is open to all conference
  participants.  The CALCO Early Ideas Workshop invites submissions on
  the same topics as the CALCO conference: reporting results of
  theoretical work, the way these results can support methods and
  techniques for software development, as well as experience with the
  transfer of the resulting technologies into industrial practice.
* IMPORTANT DATES
  Submission of short contributions: May 1, 2017
  Author notification: May 19, 2017
  Final version: May 31, 2017
* PC CHAIR
  Daniela Petrisan - Universite Paris 7, France



LOGIC COLLOQUIUM 2017 (LC 2017)
  First Announcement and Call for Submissions
  August 14-20, 2017, Stockholm, Sweden
  https://www.lc17.conf.kth.se
* The Logic Colloquium 2017 (LC2017) is the 2017 Annual European
  summer meeting of the Association for Symbolic Logic (ASL) and will
  be held during August 14-20, 2017 at the main campus of Stockholm
  University.  The Logic Colloquium 2017 is organised and hosted
  jointly by the Departments of Mathematics and Philosophy at
  Stockholm University, and is also supported by the KTH Royal
  Institute of Technology.
* LC2017 will be co-located with two other logic-related events, all
  taking place at Stockholm University:
  - the 3rd Nordic Logic Summer School, NLS2017, August 7-12
  - the 26th EACSL Annual Conference on Computer Science Logic,
    CSL2017, August 20-24.
* There will be a joint session of CSL2017 and LC2017 in the morning
  of August 20.  Further information about all events can be found at:
  https://www.lis17.conf.kth.se
* The programme of LC2017 will also include special sessions, which
  will be announced later.
* INVITED SPEAKERS
* Plenary speakers:
  - David Aspero (University of East Anglia)
  - Alessandro Berarducci (Pisa)
  - Elisabeth Bouscaren (Paris 11)
  - Christina Brech (Sao Paolo)
  - Sakae Fuchino (Kobe University)
  - Denis Hirschfeldt (University of Chicago)
  - Wilfrid Hodges (British Academy)
  - Emil Jerabek (Prague)
  - Per Martin-Löf (Stockholm University)
  - Dag Prawitz (Stockholm University)
  - Sonja Smets (University of Amsterdam)
* Tutorial speakers:
  - Patricia Bouyer-Decitre (LSV ENS Cachan)
  - Mai Gehrke (Paris 7)
* LC2017 invited highlight speakers for the joint LC-CSL session:
  - Veronica Becher (Buenos Aires)
  - Pierre Simon (UC Berkeley)
* IMPORTANT DATES
  Abstract submission for contributed talks: May 5, 2017
  Notification: TBA
* PC CHAIR
  Mirna Dzamonja (PC chair, University of East Anglia)
* CONTACTS AND ENQUIRIES
  For enquiries on scientific and programme issues, send email to:
  Mirna Dzamonja (M.Dzamonja@uea.ac.uk) For enquiries on organising
  matters, send email to: lc2017 at philosophy.su.se



2ND INTERNATIONAL WORKSHOP ON AI ASPECTS OF REASONING, INFORMATION,
AND MEMORY 2017 (AIRIM'17)
  Call for Papers
  Prague, Czech Republic, 3 - 6 September, 2017
  https://www.fedcsis.org/2017/airim
* SCOPE:
  There is general realization that computational models of languages
  and reasoning can be improved by integration of heterogeneous
  resources of information, e.g., multidimensional diagrams, images,
  language, syntax, semantics, quantitative data, memory. While the
  event targets promotion of integrated computational approaches, we
  invite contributions from any individual areas related to
  information, language, memory, reasoning.
* IMPORTANT DATES
  Paper submission (strict deadline): May 10 2017 23:59:59 pm HST
  Position paper submission: May 31, 2017
  Authors notification: June 14, 2017
  Final paper submission and registration:  June 28, 2017
  Final deadline for discounted fee: August 01, 2017
  Conference dates: September 3-6, 2017
* ORGANIZERS
  Roussanka Loukanova, Stockholm University, Sweden
  M. Dolores Jimenez-Lopez, Universitat Rovira i Virgili, Spain
  Henning Christiansen, Roskilde University, Denmark
* CONTACT INFORMATION
  M. Dolores Jimenez-Lopez (mariadolores.jimenez@urv.cat)
  Roussanka Loukanova (rloukanova@gmail.com)



24th INTERNATIONAL SYMPOSIUM ON TEMPORAL REPRESENTATION AND REASONING
(TIME 2017)
  Call for Papers
  Mons (Belgium), 16-18 October 2017
  http://informatique.umons.ac.be/time2017/
* TIME 2017 aims to bring together researchers interested in reasoning
  about temporal aspects of information in any area of Computer
  Science. The symposium, currently in its 24th edition, has a wide
  remit and intends to cater to both theoretical aspects and
  well-founded applications. One of the key aspects of the symposium is
  its interdisciplinarity, with attendees from distinct areas such as
  artificial intelligence, database management, logic and verification,
  and beyond. The symposium will encompass three tracks on temporal
  representation and reasoning in (1) Artificial Intelligence, (2)
  Databases and (3) Logic and Verification. Submissions of high-quality
  papers describing research results are solicited. See the webpage
  for a detailed list of topics of interest.
* PROGRAM COMMITTEE CHAIRS: Sven Schewe (University of Liverpool);
  Thomas Schneider (University of Bremen); Jef Wijsen (University of
  Mons)
* INVITED SPEAKERS:
  Alessandro Artale (Free University of Bozen-Bolzano);
  Javier Esparza (Technical University of Munich);
  Sheila McIlraith (University of Toronto)
* Authors of selected papers will be invited to submit an extended
  version of their contribution to a special issue of the journal
  Theoretical Computer Science.
* IMPORTANT DATES:
  Abstracts due: May 8, 2017;
  Full papers due: May 12, 2017;
  Notification:	June 27, 2017;
  Final version due: July 14, 2017;
  Symposium: October 16-18, 2017



SYGUS-COMP 2017 4TH ANNUAL SYNTAX GUIDED SYNTHESIS COMPETITION
(SyGuS-COMP 2017)
  Call for Solvers and Benchmarks Submission
  July 22, 2017 Heidelberg, Germany (with CAV and SYNT)
  http://www.sygus.org/SyGuS-COMP2017.html
* The SyGuS Competition is an annual competition for solvers of the
  syntax-guided synthesis problem. This problem asks to find a program
  meeting a given logical formulae augmented with a grammar
  restricting the set of allowed implementations. These are formulated
  in SyGuS-IF, a logical formalism built on top of SMT-LIB.
* Benchmarks and Solvers submission is now open.
* IMPORTANT DATES:
  Benchmark submission deadline:		15 May 2017
  Deadline for first version of solvers:	7 June 2017
* Detailed information can be found on the webpage.



THIRD NORDIC LOGIC SUMMER SCHOOL (NLS 2017)
  Second announcement and call for papers
  Stockholm, August 7 - 11, 2017
  Department of Mathematics, Kräftriket Campus, Stockholm University.
  https://www.sls17.conf.kth.se
* The third Nordic Logic Summer School is arranged under the auspices
  of the Scandinavian Logic Society
  (http://scandinavianlogic.org/). The two previous schools were
  organized in Nordfjordeid, Norway (2013) and Helsinki (2015). The
  intended audience is advanced master students, PhD-students,
  postdocs and experienced researchers wishing to learn the state of
  the art in a particular subject. The school is co-located with Logic
  Colloquium 2017 (August 14-20) and Computer Science Logic 2017
  (August 21-24).
* The school will consist of 10 five-hour courses, running in two
  qparallel streams. In addition, there will be short student
  presentations and poster sessions.
* The lectures start on:
  Monday August 7, 9:00, and end Friday August 11, 16:15
* LECTURERS AND COURSES
  The following lecturers and course topics are confirmed.
  - Mirna Dzamonja (University of East Anglia)
  Set Theory
  - Martin Escardo (Birmingham)
  Topological and Constructive Aspects of Higher-Order Computation
  - Henrik Forssell (Oslo)
  Categorical Logic
  - Volker Halbach (Oxford)
  Truth & Paradox
  - Larry Moss (Indiana University, Bloomington)
  Natural Logic
  - Anca Muscholl (LaBRI, Université Bordeaux)
  Logic in Computer Science - Control and Synthesis, from a
  Distributed Perspective
  - Eric Pacuit (University of Maryland)
  Logic and Rationality
  - Peter Pagin and Dag Westerståhl (Stockholm University)
  Compositionality
  - Sara L. Uckelman (Durham)
  Medieval Logic
  - Andreas Weiermann (Ghent)
  Proof Theory
* IMPORTANT DATES
  Registration:
  Registration opens: March 6, 2017
  Early registration ends: May 15, 2017
  Late registration ends: August 4, 2017
  Submission of abstracts for presentations and posters:
  Opening: March 6, 2017
  Closing: May 2, 2017
  Notification of acceptance: May 9, 2017
* FURTHER INFORMATION
  Further information about submissions, registration and accommodation
  possibilities will (in due time) be available on the NLS webpage:
  General enquiries: nls2017 [at] philosophy.su.se
  Accommodation enquiries: logic2017-accommodation [at] math.su.se
* PROGRAM CHAIR
  Erik Palmgren (chair, Stockholm U)



5TH INTERNATIONAL WORKSHOP ON STRATEGIC REASONING (SR 2017)
  Preliminary Call for Papers
  Liverpool, UK, July 26-27, 2017
  http://sr2017.csc.liv.ac.uk/
* OVERVIEW: Strategic reasoning is one of the most active research
  areas in the multi-agent system domain. The literature in this field
  is extensive and provides a plethora of logics for modelling
  strategic ability.  Theoretical results are now being used in many
  exciting domains, including software tools for information system
  security, robot teams with sophisticated adaptive strategies, and
  automatic players capable of beating expert human adversaries, just
  to cite a few. All these examples share the challenge of developing
  novel theories and tools for agent-based reasoning that take into
  account the likely behaviour of adversaries. The international
  workshop on strategic reasoning aims to bring together researchers
  working on different aspects of strategic reasoning in computer
  science, both from a theoretical and a practical point of view.  SR
  2017 will be co-located with TARK 2017, which will be held in
  Liverpool on July 24-26, 2017.
* LIST OF TOPICS
  The topics covered by the workshop include, but are not limited to,
  the following:
  Logics for reasoning about strategic abilities;
  Logics for multi-agent mechanism design, verification, and synthesis;
  Logical foundations of decision theory for multi-agent systems;
  Strategic reasoning in formal verification;
  Automata theory for strategy synthesis;
  Strategic reasoning under perfect and imperfect information;
  Applications and tools for cooperative and adversarial reasoning;
  Robust planning and optimisation in multi-agent systems;
  Risk and uncertainty in multi-agent systems;
  Quantitative aspects in strategic reasonings.
* IMPORTANT DATES
  Abstract deadline: May 8, 2017
  Submission deadline:	May 15, 2017
  Acceptance notification: June 16, 2017
  Camera-ready deadline: June 30, 2017
  Workshop: July 26-27, 2017
* WORKSHOP CO-CHAIRS
  Wiebe van der Hoek, University of Liverpool
  Bastien Maubert, University of Naples "Federico II"
  Aniello Murano,  University of Naples "Federico II"
  Sasha Rubin, University of Naples "Federico II"



4TH INTERNATIONAL CONFERENCE ON HISTORY AND PHILOSOPHY OF COMPUTING
(HaPoC4 2017)
  Second Call for Papers
  4-7 October 2017, Masaryk University Brno
  https://hapoc2017.sciencesconf.org/
* HaPoC4 2017 will be held under the auspices of the DHST/DLMPS
  Commission for the History and Philosophy of Computing (HaPoC)
  www.hapoc.org
* OVERVIEW. HaPoC conferences aim to bring together researchers
  exploring the various aspects of the computer from historical or
  philosophical standpoint. The series aims at an interdisciplinary
  focus on computing, rooted in historical and philosophical
  viewpoints. The conference brings together researchers interested in
  the historical developments of computing, as well as those
  reflecting on the sociological and philosophical issues springing
  from the rise and ubiquity of computing machines in the contemporary
  landscape.  For HaPoC 2017 we welcome contributions from logicians,
  philosophers and historians of computing as well as from
  philosophically aware computer scientists and mathematicians. We
  also invite contributions on the use of computers in art. As HaPoC
  conferences aim to provide a platform for interdisciplinary
  discussions among researchers, contributions stimulating such
  discussions are preferable.
* IMPORTANT DATES
  Deadline for abstracts and extended abstracts: 15 May 2017
  Notifications of acceptance: July 2016



19TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE
PROGRAMMING (PPDP 2017)
  Call for Papers
  Namur, Belgium, October 9-11, 2017
  (co-located with LOPSTR'17)
  http://complogic.cs.mcgill.ca/ppdp2017
* PPDP 2017 is a forum that brings together researchers from the
  declarative programming communities, including those working in the
  functional, logic, answer-set, and constraint programming
  paradigms. The goal is to stimulate research in the use of logical
  formalisms and methods for analyzing, performing, specifying, and
  reasoning about computations, including mechanisms for concurrency,
  security, static analysis, and verification.
* This year the conference will be co-located with the 27th Int'l
  Symp.  on Logic-Based Program Synthesis and Transformation (LOPSTR
  2017).
* Submissions are invited on all topics from principles to practice,
  from foundations to applications. Topics of interest include, but
  are not limited to
  - Language Design: domain-specific languages; interoperability;
    concurrency, parallelism, and distribution; modules; probabilistic
    languages; reactive languages; database languages; knowledge
    representation languages; languages with objects; language
    extensions for tabulation; metaprogramming.  -- Implementations:
    abstract machines; interpreters; compilation; compile-time and
    run-time optimization; garbage collection; memory management.
  - Foundations: type systems; type classes; dependent types; logical
    frameworks; monads; resource analysis; cost models; continuations;
    control; state; effects; semantics.
  - Analysis and Transformation: partial evaluation; abstract
    interpretation; control flow; data flow; information flow;
    termination analysis; resource analysis; type inference and type
    checking; verification; validation; debugging; testing.
  - Tools and Applications: programming and proof environments;
    verification tools; case studies in proof assistants or
    interactive theorem provers; certification; novel applications of
    declarative programming inside and outside of CS; declarative
    programming pearls; practical experience reports and industrial
    application; education.
* IMPORTANT DATES:
  Abstract Submission: 12 May   2017
  Paper Submission: 19 May   2017
  Paper Rebuttal: 10 July  2017
  Notification: 20 July  2017
  Final Version: 15 Aug   2017
* SUBMISSION CATEGORIES:
  Submissions can be made in three categories: regular Research Papers,
  System Descriptions, and Experience Reports.
* PROGRAM COMMITTEE CHAIR
  Brigitte Pientka (McGill University)



THE EIGHTH INTERNATIONAL SYMPOSIUM ON GAMES, AUTOMATA, LOGICS, AND
FORMAL VERIFICATION (GandALF 2017)
  Rome, Italy,  20-22 September 2017
  http://gandalf2017.istc.cnr.it
* AIM.
  The aim of GandALF 2017 symposium is to bring together
  researchers from academia and industry which are actively working in
  the fields of Games, Automata, Logics, and Formal Verification. The
  idea is to cover an ample spectrum of themes, ranging from theory to
  applications, and stimulate cross-fertilization.
* TOPICS
  Papers focused on formal methods are especially welcome. Authors are
  invited to submit original research or tool papers on all relevant
  topics in these areas. Papers discussing new ideas that are at an
  early stage of development are also welcome. The topics covered by
  the conference include, but are not limited to, the following:
  -  Automata Theory
  -  Automated Deduction
  -  Computational aspects of Game Theory
  -  Concurrency and Distributed computation
  -  Decision Procedures
  -  Deductive, Compositional, and Abstraction Techniques for
     Verification
  -  Finite Model Theory
  -  First-order and Higher-order Logics
  -  Formal Languages
  -  Formal Methods for Systems Biology, Hybrid, Embedded, and Mobile
     Systems
  -  Games and Automata for Verification
  -  Game Semantics
  -  Logical aspects of Computational Complexity
  -  Logics of Programs
  -  Modal and Temporal Logics
  -  Model Checking
  -  Models of Reactive and Real-Time Systems
  -  Program Analysis and Software Verification
  -  Run-time Verification and Testing
  -  Specification and Verification of Finite and Infinite-state
     Systems
  -  Synthesis
* IMPORTANT DATES
  Abstract submission: May 19, 2017
  Paper submission: May 26, 2017
  Notification: July 7, 2017
  Camera-ready: July 31, 2017
  Conference: Sept. 20-22, 2017
* PROGRAM CHAIRS
  Patricia Bouyer-Decitre LSV, CNRS & ENS de Cachan, France
  Pierluigi San Pietro, Politecnico di Milano, Italy



7TH INTERNATIONAL CHALLENGE ON THE RIGOROUS EXAMINATION OF REACTIVE
SYSTEMS (RERS 2017)
  Call for Papers
  Santa Barbara, USA, July 2017.
  co-located with ISSTA/SPIN 2017.
* RERS is designed to encourage software developers and researchers to
  apply and combine their tools and approaches in a free style manner
  to answer evaluation questions for reachability and LTL formulas on
  specifically designed benchmarks. The goal of this challenge is to
  provide a basis for the comparison of verification techniques and
  available tools. The benchmarks are automatically synthesized to
  exhibit chosen properties and then enhanced to include dedicated
  dimensions of difficulty, ranging from conceptual complexity of the
  properties (e.g. reachability, full safety, liveness), over size of
  the reactive systems (a few hundred lines to tens of thousands of
  them), to exploited language features (arrays and index
  arithmetics). They are therefore especially suited for
  community-overlapping tool comparisons.  What distinguishes RERS
  from other challenges is that the challenge problems can be
  approached in a free-style manner: it is highly encouraged to
  combine and exploit all known (even unusual) approaches to software
  verification. In particular, participants are not constrained to
  their own tools. To clearly separate RERS from other challenges,
  this year the LTL analysis is separated from the reachability of
  labels. RERS is then the only challenge with a special track for LTL
  analysis on synthesized benchmarks.
* The main aims of RERS 2017 are to : - encourage the combination of
  usually different research fields for better software verification
  results; - provide a comparison foundation based on differently
  tailored benchmarks that reveals the strengths and weaknesses of
  specific approaches; - initiate a discussion for better benchmark
  generation reaching out across the usual community barriers to
  provide benchmarks useful for testing and comparing a wide variety
  of tools.
* There will be a 1 day workshop where the results will be presented,
  the generation methodology will be explained, and the modalities for
  the RERS 2018 challenge, which will be part of ISoLA 2018 will be
  discussed. There is still a lot of time to get engaged, and
  collecting RERS achievements is a lot of fun!
* SCHEDULE:
* SEQUENTIAL PROBLEMS
  The sequential challenge just started. Its entire setup in online
  since a few days. Thus you can start right away. At least if you are
  a RERS newcomer, we would strongly recommend you to start with the
  training problems:
  (http://www.rers-challenge.org/2017/index.php?page=trainingphase)
  They are an ideal starting point for the challenge: They are smaller
  in size than the challenge problems but otherwise structurally
  equivalent. Moreover, an automatic checker (available on the same
  page) allows you to evaluate your own solutions. After having
  tackled the training problems it should be easy to move on to attack
  the challenge problems.
* PARALLEL PROBLEMS: 01.03.2017:
  The training problems for the parallel challenge wil be online
  01.05.2017: The setup for the parallel challlenge will be online.
* DEADLINE for all submission: 01.07.2017
  Please note that we want to specifically encourage also solutions
  from participants that work with tools developed by others.
* FURTHER INFORMATION
  More detailed information on the challenge can be found in the
  participants section of www.rers-challenge.org/2017. Looking forward
  to seeing you in Santa Barbara! Best regards Bernhard, Falk, Jaco,
  and Markus



INTERNATIONAL CONFERENCE ON RELIABILITY, SAFETY AND SECURITY OF
RAILWAY SYSTEMS: MODELLING, ANALYSIS, VERIFICATION AND CERTIFICATION -
(RSSRAIL 2017)
  Call for Papers
  November 14-16, 2017, Pistoia, Italy
  https://conferences.ncl.ac.uk/rssrail/
* AIMS.
  The railway industry is facing an increasing pressure to improve
  system safety, to decrease the production cost and time to market,
  to reduce the carbon emission and running cost, and to improve the
  system capacity.  Railway systems are now being integrated into
  larger multi-transport networks. Such systems require an even higher
  degree of automation at all levels of operation. These trends
  dramatically increase the complexity of railway applications and
  pose new challenges in developing novel methods of modelling,
  analysis, verification and validation to ensure their reliability,
  safety and security, as well as in supporting novel mechanisms and
  procedures to help argue that the development processes are meeting
  the standards. Following the success of RSSRail 2016 held in Paris
  on June 28-30, 2016, this conference will contribute to a range of
  key objectives. There is a pressing demand to bring together
  researchers and developers working on railway system reliability,
  security and safety to discuss how these requirements can be met in
  an integrated way.
* The conference aims to bring together researchers and engineers
  interested in building critical railway applications and
  systems. This will be a working conference in which research
  advances will be discussed and evaluated by both researchers and
  engineers focusing on their potential to be deployed in industrial
  settings.
* We are interested in the submissions of three types:
  - Research papers
  - Industrial experience reports
  - PhD student papers.
* IMPORTANT DATES:
  Abstract submission: June 1, 2017
  Paper submission deadline: June 8, 2017
  Notification:	July 8, 2017
  camera-read papers submitted:	August 18, 2017
* CONFERENCE CHAIRS:
  Alessandro Fantechi, University of Firenze, Italy
  Thierry Lecomte, ClearSy, France
  Alexander Romanovsky, Newcastle University, UK



12TH WORKSHOP ON LOGICAL AND SEMANTIC FRAMEWORKS, WITH APPLICATIONS
(LSFA 2017)
  Second Call for Papers
  23-24 September 2017, Brasilia, Brazil
  Satellite event of TABLEAUX, FroCoS, and ITP 2017
  http://lsfa2017.cic.unb.br/
* OVERVIEW
  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.
  LSFA 2017 aims to be a forum for presenting and discussing work in
  progress, and therefore to provide feedback to authors on their
  preliminary research. The proceedings are produced after the
  meeting, so that authors can incorporate this feedback in the
  published papers.
* TOPICS OF INTEREST
  Topics of interest to this forum include, but are not limited to:
  - Automated deduction
  - Applications of logical and/or semantic frameworks
  - Computational and logical properties of semantic frameworks
  - Formal semantics of languages and systems
  - Implementation of logical and/or semantic frameworks
  - Lambda and combinatory calculi
  - Logical aspects of computational complexity
  - Logical frameworks
  - Process calculi
  - Proof theory
  - Semantic frameworks
  - Specification languages and meta -languages
  - Type theory
* IMPORTANT DATES
  Submission: 21 June 2017
  Notification:	21 July 2017
  Final pre-proceedings version due: 11 August 2017
  LSFA 2017 23-24 September 2017
* PROGRAMME COMMITTEE CHAIRS
  Sandra Alves, University of Porto - co-chair
  Renata Wassermann, University of Sao Paulo - co-chair



ENCYCLOPEDIA OF PROOF SYSTEMS - POSTER SESSION & TASK-FORCE (EPS 2017)
  Call for Posters and Encyclopedia Entries
  24, 25th of September 2017, Brasilia, Brazil
  http://proofsystem.github.io/Encyclopedia/
* DESCRIPTION. The Encyclopedia of Proof Systems was created in 2014
  with the goal of being a quick reference for the various proof
  systems used by logicians. Since then, it has collected 64 entries
  on the most various logics and calculi. This was only possible due
  to the collaboration of many members of the logic community.  This
  event aims to promote the encyclopedia and attract more
  contributions and collaborators. It consists of:
  - a poster session in the afternoon of September 24th, 2017, during
    which submitted entries will be displayed as posters;
  - an interactive hands-on meeting in the morning of September 25th,
    2017, for those who would like to contribute to the continuous
    improvement of the encyclopedia.
* Submissions and instructions are available in the website:
  http://proofsystem.github.io/Encyclopedia/
* IMPORTANT DATES
  Submission: 1 August 2017
  Notification:	15 August 2017



Back to the LICS web page.