posted by user: smmalves || 728 views || tracked by 5 users: [display]

FSCD 2019 : 4th International Conference on Formal Structures for Computation and Deduction


When Jun 24, 2019 - Jun 30, 2019
Where Dortmund, Germany
Abstract Registration Due Feb 8, 2019
Submission Deadline Feb 11, 2019
Notification Due Apr 8, 2019
Final Version Due Apr 22, 2019

Call For Papers

Fourth International Conference on
Formal Structures for Computation and Deduction (FSCD 2019)
24 -- 30 June 2019, Dortmund, Germany

All deadlines are midnight anywhere-on-earth (AoE); late
submissions will not be considered.
Titles and Short Abstracts: 8 February 2019
Full Papers: 11 February 2019
Rebuttal period: 28 March -- 1 April 2019
Authors Notification: 8 April 2019
Final version for proceedings: 22 April 2019

FSCD 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,
models of computation (e.g. quantum computing, probabilistic
computing, homotopy type theory), semantics and verification in new
challenging areas (e.g. blockchain protocols or deep learning

Suggested, but not exclusive, list of topics for submission are:
1. Calculi:
Rewriting systems, Lambda calculus, Concurrent calculi, Logics,
Type theory, Homotopy type theory, Logical frameworks, Quantum
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; 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; Proof
assistants and interactive theorem provers; Applications in
industry (e.g. design and verification of critical systems);
Applications in other sciences (e.g. biology)
6. Semantics and verification in new challenging areas:
Certification; Security; Blockchain protocols; Data bases; Deep
learning and machine learning algorithms; Planning

The proceedings will be published as an electronic volume in the
Leibniz International Proceedings in Informatics (LIPIcs) of Schloss
Dagstuhl. All LIPIcs proceedings are open access.

Submissions can be made in two categories. Regular research papers
are limited to 15 pages (including references, with the possibility to
add an annex for technical details, e.g.\ proofs) and must present
original research which is unpublished and not submitted
elsewhere. System descriptions are limited to 15 pages (including
references) and must present new software tools in which FSCD topics
play an important role, or significantly new versions of such
tools. Submissions must be formatted using the LIPIcs style files and
submitted via EasyChair. Complete instructions on submitting a paper
can be found on the conference web site:

The program committee will consider declaring this award to a paper in
which at least one author is a junior researcher, i.e. either a
student or whose PhD award date is less than three years from the
first day of the meeting. Other authors should declare to the PC Chair
that at least 50% of contribution is made by the junior

Authors of selected papers will be invited to submit an extended
version for a special issue of Logical Methods in Computer Science.

H. Geuvers, Radboud U. Nijmegen (Chair)
Z. Ariola, U. of Oregon
M. Ayala Rincón, U. of Brasilia
A. Bauer, U. of Ljubljana
F. Bonchi, U. of Pisa
S. Broda, U. of Porto
U. Dal Lago, U. of Bologna & Inria
U. De'Liguoro, U. of Torino
D. Kapur, U. of New Mexico
P. Dybjer, Chalmers U. of Technology
M. Fernandez, King's College London
J. Giesl, RWTH Aachen
N. Hirokawa, JAIST
S. Lucas, U. Politecnica de Valencia
A. Middeldorp, U. of Innsbruck
F. Pfenning, Carnegie Mellon U.
B. Pientka, McGill U.
J. van de Pol, Aarhus U. & U. of Twente
F. van Raamsdonk, VU Amsterdam
C. Schürmann, ITU Copenhagen
P. Severi, U. of Leicester
A. Silva, U. College London
S. Staton, Oxford U.
T. Streicher, TU Darmstadt
A. Stump, U. of Iowa
N. Tabareau, Inria
S. Tison, U. of Lille
A. Tiu, Australian National U.
T. Tsukada, U. of Tokyo
J. Urban, CTU Prague
P. Urzyczyn, U. of Warsaw
J. Waldmann, Leipzig U. of Applied Sciences

Jakob Rehof, TU Dortmund

Boris Düdder, U. of Copenhagen

J. Vicary, Oxford U.

Sandra Alves , Porto U.

S. Alves (Porto U.),
M. Ayala-Rincón (Brasilia U.)
C. Fuhs (Birkbeck, London U.)
D. Kesner (Chair, Paris U.)
H. Kirchner (Inria)
N. Kobayashi (U. Tokyo)
C. Kop (Radboud U. Nijmegen)
D. Miller (Inria)
L. Ong (Chair, Oxford U.)
B. Pientka (McGill U.)
S. Staton (Oxford U.)

Related Resources

FCT 2019   22nd Symposium on Fundamentals of Computation Theory
GCM 2019   10th International Workshop on Graph Computation Models
FM 2019   23rd International Symposium on Formal Methods – 3rd World Congress on Formal Methods
ICCS 2019   24th International Conference on Conceptual Structures - Graphs in Human and Machine Cognition
SEFM 2019   Software Engineering and Formal Methods
IJCCI 2019   International Joint Conference on Computational Intelligence
KALSIMIS 2019   Knowledge Acquisition and Learning in Semantic Interpretation of Medical Image Structures
WADS 2019   Workshop on Algorithms and Data Structures
FACS 2019   Formal Aspects of Component Software
ATVA 2019   International Symposium on Automated Technology for Verification and Analysis