- finite-model-theory - lists.rwth-aachen.de

Paraconsistent Newsletter - Fall 2018
by jean-yves beziau 13 Dec '18

13 Dec '18

With an exclusive interview with Michael Dunn The latest inconsistent papers, books, events, videos and a terrrific enigma that may lead you to the island of inconsistency ... http://www.paraconsistency.org/2018fall

1 0

Caleidoscope Complexity School: Call for Participation
by Damiano Mazza 13 Dec '18

13 Dec '18

*** Call for participation*** Caleidoscope: Research School in Computational Complexity Institut Henri Poincaré, Paris, 17-21 June 2019 http://caleidoscope.sciencesconf.org/ Dear all, We are delighted to announce the Caleidoscope Research School in Computational Complexity, to take place at the Institut Henri Poincaré, Paris 17-21 June 2019. The school is aimed at graduate students and researchers who already work in some aspects of computational complexity and/or who would like to learn about the various approaches. DESCRIPTION Computational complexity theory was born more than 50 years ago when researchers started asking themselves what could be computed efficiently. Classifying problems/functions with respect to the amount of resources (e.g. time and/or space) needed to solve/compute them turned out to be an extremely difficult question. This has led researchers to develop a remarkable variety of approaches, employing different mathematical methods and theories. The future development of complexity theory will require a subtle understanding of the similarities, differences and limitations of the many current approaches. In fact, even though these study the same phenomenon, they are developed today within disjoint communities, with little or no communication between them (algorithms, logic, programming theory, algebra...). This dispersion is unfortunate since it hinders the development of hybrid methods and more generally the advancement of computational complexity as a whole. The goal (and peculiarity) of the Caleidoscope school is to reunite in a single event as many different takes on computational complexity as can reasonably be fit in one week. It is intended for graduate students as well as established researchers who wish to learn more about neighbouring areas. LECTURES 1. Boolean circuits and lower bounds. (Rahul Santhanam, University of Oxford) 2. Algebraic circuits and geometric complexity. (Peter Bürgisser, Technical University Berlin) 3. Proof complexity and bounded arithmetic. (Sam Buss, University of California San Diego) 4. Machine-free complexity (descriptive and implicit complexity). (Anuj Dawar, University of Cambridge and Ugo Dal Lago, University of Bologna) In addition to these broad-ranging themes, there will also be three more focussed topics, providing examples of (already established or potential) interactions between logic, algebra and complexity: 5. Constraint satisfaction problems. (Libor Barto, Charles University in Prague) 6. Communication complexity. (Sophie Laplante, Paris 7 University) 7. Duality in formal languages and logic. (Daniela Petrisan, Paris 7 University) REGISTRATION Registration to the school is free but mandatory. This is to help us plan tea/coffee breaks and social activities. https://caleidoscope.sciencesconf.org/registration/index FINANCIAL SUPPORT There may be opportunities for financial support for participants. We will make relevant information available via the webpage. https://caleidoscope.sciencesconf.org/ SPONSORS European Association for Computer Science Logic (http://www.eacsl.org/) DIM RFSI - Région Île-de-France (https://dim-rfsi.fr/) Université Paris 13 (https://www.univ-paris13.fr/) Laboratoire d'Informatique de Paris Nord (https://lipn.univ-paris13.fr/)

1 0

FSCD 2021 - CALL FOR LOCATION
by Sandra Alves 13 Dec '18

13 Dec '18

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Call for Location for FSCD 2021 The FSCD conference covers all aspects of Formal Structures for Computation and Deduction from theoretical foundations to applications. The annual FSCD conference comprises the main conference and a considerable number of affiliated workshops (expectedly, more than ten). We invite proposals for locations to host the 6th FSCD International Conference to be held during the summer of 2021. Previous (and upcoming) FSCD meetings include: FSCD 2016 in Porto (Portugal); FSCD 2017 in Oxford (UK) co-located with ICFP 2017; FSCD 2018 in Oxford (UK) as part of FLoC 2018; FSCD 2019 in Dortmund (Germany); FSCD 2020 in Paris (France) co-located with IJCAR 2020. Therefore, for 2021, we particularly encourage proposals outside Europe. The deadline for proposals is *** 31st March 2019 ***. Proposals should be sent to the FSCD Steering Committee Chair (see contact information above). We encourage proposers to register their intention informally as soon as possible. Selected proposals are to be presented at the business meeting of FSCD 2019 taking place at Dortmund in June 2019. The final decision about hosting and organising of FSCD 2021 will be taken by the SC after an advisory vote of the members of the community in attendance at the business meeting. Proposals should address the following points: FSCD Conference Chair (complete name and current position), host institution, FSCD Local Committee (complete names and current positions), availability of student-volunteers. National, regional, and local government and industry support, both organizational and financial. Accessibility to the location (i.e., transportation) and attractiveness of the proposed site. Accessibility can include both information about local transportation and travel information to the location (flight and/or train connections), as well as estimated costs. Appropriateness of the proposed dates (including consideration of holidays/other events during the period), hotel prices, and access to dormitory facilities for students. Estimated costs on registration for the conference and workshops, both for regular and student participants. Conference and exhibit facilities for the anticipated number of registrants (typically around 200). For example: number, capacity and audiovisual equipment of meeting rooms; a large plenary session room that can hold all the registrants; enough rooms for parallel sessions/workshops/tutorials; internet connectivity and workstations for demos/competitions; catering services; and presence of professional staff. Residence accommodations and food services in a range of price categories and close to the conference venue, for example, number and cost range of hotels, and availability and cost of dormitory rooms (e.g., at local universities) and kind of services they offer. Other relevant information, which can include information about leisure activities and attractiveness of the location (e.g., cultural and historical aspects, touristic activities, etc...). Contact information: Delia Kesner kesner(a)irif.fr FSCD SC Chair

1 0

Description Logics workshop 2019, preliminary CfP
by Evgenij Thorstensen 11 Dec '18

11 Dec '18

--------------------------------------------------------------------- ---------- PRELIMINARY CALL FOR PAPERS 32nd International Workshop on Description Logics, DL 2019 June 18th to June 21st, 2019 - Oslo, Norway http://dl.kr.org/dl2019/ --------------------------------------------------------------------- ---------- The DL workshop is the major annual event of the description logic research community. It is the forum at which those interested in description logics, both from academia and industry, meet to discuss ideas, share information and compare experiences. The 32nd edition will be held in Oslo, Norway from June 18th to June 21st, 2019. Important Dates =============== Paper registration deadline: March 22, 2019 Paper submission deadline: March 29, 2019 Notification of acceptance: May 3, 2019 Camera-ready copies: May 24, 2019 Workshop: June 18-21, 2019 Workshop Scope ============== We invite contributions on all aspects of description logics, including but not limited to: * Foundations of description logics: decidability and complexity of reasoning, expressive power, novel inference problems, inconsistency management, reasoning techniques, and modularity aspects * Extensions of description logics: closed-world and nonmonotonic reasoning, epistemic reasoning, temporal and spatial reasoning, procedural knowledge, query answering, reasoning over dynamic information * Integration of description logics with other formalisms: object- oriented representation languages, database query languages, constraint-based programming, logic programming, and rule-based systems * Applications and use areas of description logics: ontology engineering, ontology languages, databases, ontology-based data access, semi- structured data, graph structured data, linked data, document management, natural language, learning, planning, Semantic Web, cloud computing, conceptual modelling, web services, business processes * Systems and tools around description logics: reasoners, software tools for and using description logic reasoning (e.g. ontology editors, database schema design, query optimisation, and data integration tools), implementation and optimisation techniques, benchmarking, evaluation, modelling Submissions =========== Submissions may be of two types: (1) We invite regular papers of up to 11 pages. If the authors prefer the paper to not appear in the proceedings, an additional 2-page abstract of the paper has to be submitted (the 2-page abstract would appear in the proceedings, in case of acceptance). (2) Papers accepted or under review at some other conference can be submitted to the DL workshop. They should be submitted together with a 2-page abstract that also specifies where the paper has been accepted or is under review. Only the 2-page abstract would appear in the proceedings, in case of acceptance. * The regular papers and 2-page abstracts must be formatted using the Springer LNCS style. The list of references in these submissions does not count towards the page limit. * The option to publish a 2-page abstract is designed for authors who wish to announce results that have been published elsewhere, or which the authors intend to submit or have already submitted to a venue with an incompatible prior / concurrent publication policy. * All submissions may optionally include a clearly marked appendix (e.g., with additional proofs or evaluation data). The appendix will be read at the discretion of the reviewers and not included in the proceedings. The appendix does not need to be in LNCS format. * Accepted regular papers and 2-page abstracts will be made available electronically in the CEUR Workshop Proceedings series (http://www.CEUR-ws.org/). * Accepted submissions, be they regular papers or 2-page abstracts, will be selected for either oral or poster presentation at the workshop. Submissions will be judged solely based upon their content, and the type of submission will have no bearing on the decision between oral and poster presentation. Submission page: https://easychair.org/conferences/?conf=dl2019 Organization ============ * Martin Giese, University of Oslo, Norway (general co-chair) * Mantas Simkus, TU Wien, Austria (program co-chair) * Arild Waaler, University of Oslo, Norway (general co-chair) * Grant Weddell, University of Waterloo, Canada (program co-chair) Resources ========= * Information about submission, registration, travel information, etc., will be available on the DL 2019 homepage: http://dl.kr.org/dl2019/ * The official description logic homepage is at http://dl.kr.org/

1 0

LICS 2019 Final call for papers and workshops announcement
by Sam Staton 10 Dec '18

10 Dec '18

FINAL CALL FOR PAPERS AND WORKSHOPS ANNOUNCEMENT Thirty-Fourth Annual ACM/IEEE Symposium on LOGIC IN COMPUTER SCIENCE (LICS) Conference 24-27 June 2019, Vancouver Workshops 22-23 June 2019 https://lics.siglog.org/lics19/ IMPORTANT DATES FOR CONFERENCE SUBMISSIONS Authors are required to submit a paper title and a short abstract of about 100 words in advance of submitting the full extended abstract of the paper. The exact deadline time on these dates is given by anywhere on earth (AoE). Titles and Short Abstracts Due: 4 January 2019 Full Papers Due: 11 January 2019 Author Feedback/Rebuttal Period: 4-8 March 2019 Author Notification: 29 March 2019 Deadlines are firm; late submissions will not be considered. All submissions will be electronic via https://www.easychair.org/conferences/?conf=lics2019. Format instructions and scope advice are on the conference website, together with the full programme committee: https://lics.siglog.org/lics19/cfp.php WORKSHOPS LICS will be affiliated with the following workshops which will be organized 22-23 June 2019. LearnAut: Learning and Automata (organized by Rémi Eyraud, Tobias Kappé, Guillaume Rabusseau and Matteo Sammartino) LFMTP: Logical Frameworks and Metalanguages: Theory and Practice (organized by Dale Miller and Ivan Scagnetto) LMW: Logic Mentoring Workshop (organized by Filip Mazowiecki and Sandra Kiefer) LOLA: Syntax and semantics of Low level Languages (organized by Patricia Johann and Rasmus Eijlers Møgelberg) MoRe: Multi-objective reasoning in verification and synthesis (organized by Mickael Randour and Jeremy Sproston) WiL: Women in Logic (organized by Valeria de Paiva and Amy Felty) https://lics.siglog.org/lics19/

1 0

Call for Papers: JLAMP Special Issue on Relational and Algebraic Methods in Computer Science
by Walter Guttmann 10 Dec '18

10 Dec '18

OPEN CALL FOR PAPERS FOR JOURNAL SPECIAL ISSUE Relational and Algebraic Methods in Computer Science Special Issue of the Journal of Logical and Algebraic Methods in Programming (JLAMP) http://www.ramics-conference.org/ramics-2018-jlamp-cfp.pdf IMPORTANT DATES: Submission Deadline: 31 March 2019 Notification of Acceptance: late 2019/early 2020 TOPICS: Relational and algebraic methods belong to the core of computer science. This special issue aims to showcase the variety and relevance of recent developments in this field ranging from theory to applications. We invite submissions of high-quality original research articles in the general fields of algebras relevant to computer science and applications of such algebras. Topics include but are not limited to: * Theory - algebras such as semigroups, residuated lattices, semirings, Kleene algebras, relation algebras and quantales - their connections with program logics and other logics - their formalisation with theorem provers - their use in the theories of automata, concurrency, formal languages, games, networks and programming languages - the development of algebraic, algorithmic, category-theoretic, coalgebraic and proof-theoretic methods for these theories * Applications - tools and techniques for program correctness, specification and verification - quantitative and qualitative models and semantics of computing systems and processes - algorithm design, automated reasoning, network protocol analysis, social choice, optimisation and control - industrial applications While we welcome substantially extended versions of papers published in the proceedings of the RAMiCS 2018 conference (Springer LNCS 11194, https://www.springer.com/gp/book/9783030021481), this call is open to anyone interested in the field of relational and algebraic methods. SUBMISSION INSTRUCTIONS: All submissions will be evaluated solely with respect to their novelty, significance and technical quality according to the high standards of JLAMP. They must be in PDF format, adhere to the standard JLAMP guide for authors https://www.elsevier.com/journals/journal-of-logical-and-algebraic-methods-… and be uploaded on Elsevier's online EVISE system https://www.evise.com/profile/#/JLAMP/login selecting the issue type VSI: RAMiCS 2018 Deviation from these requirements may lead to immediate rejection. GUEST EDITORS: Jules Desharnais (Université Laval, Québec, Canada) Walter Guttmann (University of Canterbury, New Zealand) Stef Joosten (Open University of the Netherlands)

1 0

[fm-announcements] SPIN 2019 in Beijing - Call for Papers and Participation
by Havelund, Klaus (348B) 08 Dec '18

08 Dec '18

SPIN 2019 24th International Symposium on Model Checking of Software Beijing, China, July 15-19, 2019 https://conf.researchr.org/home/spin-2019 Co-located with ISSTA 2019 ________________________________ The 26th edition of the SPIN symposium aims at bringing together researchers and practitioners interested in automated tool-based techniques for the analysis of software as well as models of software, for the purpose of verification and validation. The symposium specifically focuses on concurrent software, but does not exclude analysis of sequential software. Submissions are solicited on theoretical results, novel algorithms, tool development, and empirical evaluation. Topics of interest include, but are not limited to: * Formal verification techniques for automated analysis of software * Formal analysis for modeling languages, such as UML/state charts * Formal specification languages, temporal logic, design-by-contract * Model checking * Automated theorem proving, including SAT and SMT * Verifying compilers * Abstraction and symbolic execution techniques * Static analysis and abstract interpretation * Combination of verification techniques * Modular and compositional verification techniques * Verification of timed and probabilistic systems * Automated testing using advanced analysis techniques * Combination of static and dynamic analyses * Derivation of specifications, test cases, or other useful material via formal analysis * Case studies of interesting systems or with interesting results * Engineering and implementation of software verification and analysis tools * Benchmark and comparative studies for formal verification and analysis tools * Formal methods education and training * Insightful surveys or historical accounts on topics of relevance to the symposium ________________________________ Invited Speakers ________________________________ Kim G. Larsen, Aalborg University Kuldeep S. Meel, National University of Singapore Call for Papers The SPIN symposium aims at bringing together researchers and practitioners interested in automated tool-based techniques for the analysis of software as well as models of software, for the purpose of verification and validation. The symposium specifically focuses on concurrent software, but does not exclude analysis of sequential software. Submissions are solicited on theoretical results, novel algorithms, tool development, empirical evaluation, and education. History: The SPIN symposium originated as a workshop focusing on explicit state model checking, specifically as related to the Spin model checker. However, over the years it has evolved to a broadly scoped symposium for software analysis using any automated techniques, including model checking, automated theorem proving, and symbolic execution. An overview of the previous SPIN symposia (and early workshops) can be found at: http://spinroot.com/spin/symposia. SPIN 2019 will be organized as an ACM SIGSOFT event, colocated with the International Symposium on Software Testing and Analysis (ISSTA 2019): https://conf.researchr.org/home/issta-2019. ________________________________ Submission Guidelines ________________________________ The contributions to SPIN 2019 will be published as ACM Proceedings, and should be submitted in the ACM Conference Format: https://www.acm.org/publications/proceedings-template (please use the sigconf template). Submissions must be original and should not have been published previously or be under consideration for publication while being evaluated for this symposium. Authors are required to adhere to the ACM Policy and Procedures on Plagiarism and the ACM Policy on Prior Publication and Simultaneous Submissions. * We are soliciting three categories of papers: * Full Research Papers describing fully developed work and complete results (16 pages – references are not included in this limit); * Short Papers presenting tools, technology, experiences with lessons learned, new ideas, work in progress with preliminary results, and novel contributions to formal methods (6 pages – references are not included in this limit). * Tool Demo Papers presenting the foundations, capabilities, application domains and relevant examples using the tools, with a clear description of what is expected to be shown in a live demonstration (4 pages to describe the tool foundations, features and use examples, plus an appendix explaining the content of the demo). Papers should be submitted via the EasyChair SPIN 2019 submission website: https://easychair.org/conferences/?conf=spin19. A selection of papers will be invited to a special issue of the International Journal on Software Tools for Technology Transfer (STTT). ________________________________ Important Dates ________________________________ * Please keep in mind the following dates for submission: * Paper Submission: April 5th, 2019 (23:59:59 Anywhere on Earth) * Author Notification: April 27th, 2019 * Camera-Ready Paper: May 2019 * Symposium: July 15-19, 2019 --- To opt-out from this mailing list, send an email to fm-announcements-request(a)lists.nasa.gov with the word 'unsubscribe' as subject or in the body. You can also make the request by contacting fm-announcements-owner(a)lists.nasa.gov

1 0

Call for Applications: Helmut Veith Stipend for Female Master´s Students in Computer Science at TU Wien - November 30, 2019
by Mihaela Rozman 06 Dec '18

06 Dec '18

Helmut Veith Stipend for Women in Computer Science Deadline: November 30, 2019 Female students in the field of computer science (CS) who plan to pursue (or are currently pursuing) one of the masters programs in Computer Science at the Vienna University of Technology TU Wien taught in English are invited to apply for the annually awarded Helmut Veith Stipend. The annually awarded Helmut Veith Stipend for female master students is dedicated to the memory of an outstanding computer scientist who worked in the fields of logic in computer science, computer-aided verification, software engineering, and computer security. Professor Helmut Veith (1971-2016). The Helmut Veith Stipend was established with generous support of TU Wien, Wolfgang Pauli Institute and with contributions by family and friends of the late Helmut Veith. BENEFITS -EUR 6000 per year -Waiver of tuition fees at TU Wien LOCATION OF MASTER STUDY For study in Austria, at Vienna University of Technology TU Wien FOR FIELD OF STUDY Applicants must be eligible for admission to one of the masters programs in computer science at Vienna University of technology - TU Wien that are taught in English. In 2018/2019 and 2019/2020 those are: Master in Logic and Computation Master in Business Informatics European Master in Computational Logic Master in Computer Engineering (Technische Informatik) Master in Data Science Master in Media and Human-Centered Computing APPLICATION Applications for funding can be filed after, before or in parallel with the admissions process. Your application must be submitted electronically to master(a)logic-cs.at as a single PDF document, by November 30, 2019. DEADLINE November 30, 2018. INQUIRES Electronically to master(a)logic-cs.at WEBSITE http://www.vcla.at/helmut-veith-stipend/

1 0

WORDS 2019, 1st call for papers
by Words 2019 28 Nov '18

28 Nov '18

*We apologize if you received this email several times. To be removed from our mailing list, please respond to this message with UNSUBSCRIBE in the subject line.* WORDS 2019 12th International Conference Loughborough, September 9–13, 2019 http://words2019.lboro.ac.uk *Announcement* WORDS is a biannual international conference covering the mathematical theory of words (sequences of symbols) from all points of view: combinatorial, algebraic, algorithmic, as well as its applications to biology, linguistics, physics, and others. The previous WORDS conferences have taken place in Rouen (1997, 1999), Palermo (2001), Turku (2003, 2013), Montreal (2005, 2017), Marseille (2007), Salerno (2009), Prague (2011), and Kiel (2015). The 12th International Conference on Words, WORDS 2019 will take place on September 9-13 2019 at Loughborough University, UK (http://www.lboro.ac.uk/departments/compsci/). Co-chairs of this edition are Robert Mercaș and Daniel Reidenbach. *Invited Speakers* Antonio Restivo (Palermo) Florin Manea (Kiel) Svetlana Puzynina (St. Petersburg) Antonio Restivo (Palermo) Gwenaël Richomme (Montpellier) Aleksi Saarela (Turku) Kristina Vuskovic (Leeds) *Program Committee* Marie-Pierre Béal (Paris) Srecko Brlek (Montreal) Émilie Charlier (Liège) Volker Diekert (Stuttgart) Gabriele Fici (Palermo) Anna Frid (Marseille) Amy Glen (Murdoch) Štěpán Holub (Prague) Shunsuke Inenaga (Kyushu) Robert Mercas (Loughborough) co-chair Dirk Nowotka (Kiel) Jarkko Peltomäki (Turku) Edita Pelantová (Prague) Narad Rampersad (Winnipeg) Daniel Reidenbach (Loughborough) co-chair Jeffrey Shallit (Waterloo) Arseny Shur (Yekaterinburg) *Important dates* Submission deadline: April 12, 2019 Notification to authors: May 20, 2019 Deadline for final versions: June 3, 2019 Conference: September 9–13, 2019 *Submission guidelines* Submitted papers should not exceed 12 pages and be prepared according to the following guidelines and LNCS-style LaTeX2e. All proofs omitted due to space constraints should be given in an appendix or made accessible through a reliable link to a freely available electronic preprint (updated before submission). These will be read at the discretion of the program committee. Only original submission which have not been submitted for publication elsewhere will be considered. Papers should be submitted electronically in PDF through the EasyChair system: https://easychair.org/conferences/?conf=words2019 *Contact* Words2019(a)lboro.ac.uk The conference is organised by the Department of Computer Science, School of Science, Loughborough University, UK.

1 0

FSCD 2019 Second Call for Papers
by Sandra Alves 27 Nov '18

27 Nov '18

(Apologies for multiple copies of this announcement. Please circulate.) --------------- Updated information: Invited speakers --------------- CALL FOR PAPERS Fourth International Conference on Formal Structures for Computation and Deduction (FSCD 2019) 24 -- 30 June 2019, Dortmund, Germany http://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> IMPORTANT DATES --------------- 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 algorithms). 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 calculi 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 INVITED SPEAKERS ----------- * Beniamino Accattoli (INRIA, Paris, France) https://sites.google.com/site/beniaminoaccattoli/ <https://sites.google.com/site/beniaminoaccattoli/> * Amy Felty (University of Ottawa, Canada) http://www.site.uottawa.ca/~afelty/ <http://www.site.uottawa.ca/~afelty/> * Sarah Winkler (University of Innsbruck, Austria) http://cl-informatik.uibk.ac.at/users/swinkler/ <http://cl-informatik.uibk.ac.at/users/swinkler/> * Hongseok Yang (KAIST, Korea) https://sites.google.com/view/hongseokyang/ <https://sites.google.com/view/hongseokyang/> PUBLICATION ----------- 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. SUBMISSION GUIDELINES --------------------- 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: http://easyconferences.eu/fscd2019/ <http://easyconferences.eu/fscd2019/> BEST PAPER AWARD BY JUNIOR RESEARCHERS -------------------------------------- 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 researcher(s). SPECIAL ISSUE ------------- Authors of selected papers will be invited to submit an extended version for a special issue of Logical Methods in Computer Science. PROGRAM COMMITTEE ----------------- 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 CONFERENCE CHAIR ---------------- Jakob Rehof, TU Dortmund LOCAL WORKSHOP CHAIR -------------------- Boris Düdder, U. of Copenhagen STEERING COMMITTEE WORKSHOP CHAIR -------------------------------- J. Vicary, Oxford U. PUBLICITY CHAIR --------------- Sandra Alves , Porto U. FSCD STEERING COMMITTEE ----------------------- 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.)

1 0