FSCD 2020: International Conference on Formal Structures for Computation and Deduction Paris, France, June 29-July 5, 2020 |
Conference website | http://fscd2020.org |
Submission link | https://easychair.org/conferences/?conf=fscd2020 |
Conference program | https://easychair.org/smart-program/FSCD2020/ |
Abstract registration deadline | February 10, 2020 |
Submission deadline | February 13, 2020 |
Notification | April 13, 2020 |
Final version | April 27, 2020 |
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, models of computation, semantics and verification in new challenging areas.
The suggested, but not exclusive, list of topics for submission is:
-
Calculi: Rewriting systems (string, term, higher-order, graph, conditional, modulo, infinitary, etc.); Lambda calculus; Logics (first-order, higher-order, equational, modal, linear, classical, constructive, etc.); Proof theory (natural deduction, sequent calculus, proof nets, etc.); Type theory and logical frameworks; Homotopy type theory; Quantum calculi.
-
Methods in Computation and Deduction: Type systems (polymorphism, dependent, recursive, intersection, session, etc.); Induction, coinduction; Matching, unification, completion, orderings; Strategies (normalization, completeness, etc.); Tree automata; Model building and model checking; Proof search and theorem proving; Constraint solving and decision procedures.
-
Semantics: Operational semantics and abstract machines; Game Semantics and applications; Domain theory and categorical models; Quantitative models (timing, probabilities, etc.); Quantum computation and emerging models in computation.
-
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.
-
Tools and Applications: Programming and proof environments; Verification tools; Proof assistants and interactive theorem provers; Applications in industry; Applications of formal systems in other sciences.
-
Semantics and Verification in new challenging areas: Certification; Security; Blockchain protocols; Data Bases; Deep learning and machine learning algorithms; Planning.
Submission Guidelines
Submissions can be made in two categories:
-
Regular Research Papers are limited to 15 pages, excluding references. They must present original research which is unpublished and not submitted elsewhere. Proofs and other technical details that do not fit within the page limit can be submitted as an appendix (up to 5 pages). The appendix will be consulted at the discretion of the reviewers. Therefore, submissions must be self-contained within the respective page limit; the additional material should not be necessary to assess the merits of a submission.
- System descriptions are limited to 15 pages, excluding references. They must present new software tools, or significantly new versions of such tools, in which FSCD topics play an important role. An archive of the code with instructions on how to install and run the tool must be submitted. In addition, a webpage where the system can be experimented with should be provided.
Program Committee
- Chair: Zena M. Ariola, University of Oregon
- M. Alpuente, Technical Univ. of Valencia
- S. Alves, University of Porto
- A. Bauer, University of Ljubljana
- M. P. Bonacina, Univ. degli studi di Verona
- P-L. Curien, CNRS - Univ. of Paris Diderot
- P. Dybjer, Chalmers Univ. of Technology
- U. De’Liguoro, University of Torino
- M. Fernandez, King’s College London
- M. Gaboardi, Boston University
- D. Ghica, University of Birmingham
- S. Ghilezan, University of Novi Sad
- J. Giesl, RWTH Aachen University
- S. Guerrini, University of Paris 13
- R. Harper, Carnegie Mellon University
- M. Hasegawa, Kyoto University
- N. Hirokawa, JAIST
- P. Johann, Appalachian State University
- O. Kammar, University of Edinburgh
- D. Kesner, University of Paris Diderot
- C. Kop, Radboud University
- O. Laurent, ENS Lyon
- D. Licata, Wesleyan University
- A. Middeldorp, University of Innsbruck
- J. Mitchell, Stanford University
- K. Nakata, SAP Postdam
- M. Pagani, University of Paris Diderot
- E. Pimentel, Fed. Univ. Rio Grande do Norte
- F. van Raamsdonk, Vrije University Amsterdam
- G. Rosu, University of Illinois
- A. Sabry, Indiana University
- A. Stump, University of Iowa
- P. Urzyczyn, University of Warsaw
- T. Uustalu, Reykjavik University
- S. Zdancewic, University of Pennsylvania
CONFERENCE CHAIR
Stefano Guerrini, University of Paris 13
WORKSHOP CHAIR
Giulio Manzonetto, University of Paris 13
PUBLICITY CHAIR
Sandra Alves, University of Porto
BEST PAPER AWARD BY JUNIOR RESEARCHERS
The program committee will select 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 researcher(s).
SPECIAL ISSUE
Authors of selected papers will be invited to submit an extended version to a special issue of Logical Methods in Computer Science.