finite-model-theory

Download

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

February 2019

11 participants
12 discussions

DICE-FOPARA 2019: Call for Papers
by Thomas Seiller 01 Feb '19

01 Feb '19

CALL FOR PAPERS DICE-FOPARA 2019 Joint international workshop on Developments in Implicit Computational complExity and Foundational and Practical Aspects of Resource Analysis 6-7 April 2019, Prague; Satellite event of ETAPS 2019 https://conf.researchr.org/track/etaps-2019/dice-fopara-2019-papers ** OBJECTIVES ** The joint DICE-FOPARA workshop provides synergies by combining two complementary communities: The DICE workshop explores the area of Implicit Computational Complexity (ICC), which grew out from several proposals to use logic and formal methods to provide languages for complexity-bounded computation (e.g. Ptime, Logspace computation). It aims at studying the computational complexity of programs without referring to external measuring conditions or a particular machine model, but only by considering language restrictions or logical/computational principles entailing complexity properties. Several approaches have been explored for that purpose, such as restrictions on primitive recursion and ramification, rewriting systems, linear logic, types and lambda calculus, interpretations of functional and imperative programs. The FOPARA workshop serves as a forum for presenting original research results that are relevant to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged. We also encourage papers that combine theory and practice. The joint DICE-FOPATA workshop at ETAPS 2019 follows the successful experiences of co-location of DICE-FOPARA at ETAPS 2015 in London and ETAPS 2017 in Uppsala. ** TOPICS ** The joint workshop serves as a forum for presenting original and established research results that are relevant to the implicit computational complexity theory and to the analysis of resource (e.g. time, space, energy) consumption by computer programs. The workshop aims to bring together the researchers that work on foundational issues with the researchers that focus more on practical results. Therefore, both theoretical and practical contributions are encouraged, as well as papers that combine theory and practice. Areas of interest to the workshop include, but are not limited to, the following: - type systems for controlling/inferring/checking complexity; - logical and machine-independent characterisations of complexity classes; - programming languages for complexity-bounded computation; - logics closely related to complexity classes; - theoretical foundations of program complexity analysis; - static resource analysis and practical applications; - resource analysis by term and graph rewriting. - semantics of complexity-bounded computation; - applications of implicit complexity to security; - termination and resource analysis for probabilistic programs; - semantic methods to analyse resources, including quasi-interpretations; - practical applications of resource analysis; ** SUBMISSIONS ** We ask for submission of regular papers describing original work (up to 15 pages) or extended abstracts (up to 5 pages) presenting already published work or work in progress. With respect to regular papers, submissions will be in particular verified for originality and novelty and the manuscript must not have been already published, nor is presently submitted, elsewhere. With respect to submissions of extended abstracts, the goal is to provide a forum for discussing work in progress, but presentations of already published results are also welcome, provided those are within the scope of the workshop and potentially give rise to lively discussions during the meeting. A special issue of an international journal devoted to the joint workshop may be proposed. In this case, the CFP will be posted after the workshop and will be open to long versions of papers presented at this venue, as well as other submissions relevant to the scientific scope. Papers must be prepared using the LaTeX EPTCS style (http://style.eptcs.org/). Papers should be submitted electronically via the easychair submission page: https://easychair.org/conferences/?conf=dicefopara2019 ** IMPORTANT DATES ** Paper Submission -- January 31st, 2019 Author Notification -- February 21st, 2019 Final Version -- February 28th, 2019 Workshop -- April 6th and 7th, 2019 ** PROGRAM COMMITTEE ** Chairs: Steffen Jost, LMU, Munich, DE Thomas Seiller, CNRS, LIPN, Villetaneuse, FR Progam Committee: Robert Atkey, University of Strathclyde, Glasgow, UK Martin Avanzini, INRIA, Sophia Antipolis, FR Lennart Beringer, Princeton University, US Ezgi Cicek, Facebook, London, UK Lukasz Czajka, TU Dortmund, DE Ankush Das, Carnegie Mellon University, Pittsburgh, US Hugo Feree, University of Kent, UK Samir Genaim, Universidad Complutense de Madrid, ES Hans-Wolfgang Loidl, Heriot-Watt University, Edinburgh, UK Joanna Ochremiak, University of Cambridge, UK Romain Pechoux, Université de Lorraine, FR Paolo Pistone, Universität Tübingen, DE Pedro Vasconcelos, University of Porto, PT Margherita Zorzi, Università degli Studi di Verona, IT

1 1

FSCD 2019 - Deadline reminder (Abstracts: 8 February, Full Papers: 11 February)
by Sandra Alves 01 Feb '19

01 Feb '19

(Apologies for multiple copies of this announcement. Please circulate.) --------------- 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 ----------- Titles and abstracts available at http://easyconferences.eu/fscd2019/invited-speakers/ <http://easyconferences.eu/fscd2019/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