PACMPL Volume 4, Issue ICFP 2020
Call for Papers
accepted papers to be invited for presentation at
The 25th ACM SIGPLAN International Conference on Functional Programming
Jersey City, USA
http://icfp20.sigplan.org/
### Important dates
Submissions due: 3 March 2020 (Tuesday) Anywhere on Earth
https://icfp20.hotcrp.com
Author response: 21 April (Tuesday) - 24 Apri (Friday) 14:00 UTC
Notification: 8 May (Friday)
Final copy due: 1 July (Wednesday)
Conference: 18 August (Sunday) - 23 August (Friday)
### About PACMPL
Proceedings of the ACM on Programming Languages (PACMPL
<https://pacmpl.acm.org/>) is a Gold Open Access journal publishing
research on all aspects of programming languages, from design to
implementation and from mathematical formalisms to empirical
studies. Each issue of the journal is devoted to a particular subject
area within programming languages and will be announced through
publicized Calls for Papers, like this one.
### Scope
[PACMPL](https://pacmpl.acm.org/) issue ICFP 2020 seeks original
papers on the art and science of functional programming. Submissions
are invited on all topics from principles to practice, from
foundations to features, and from abstraction to application. The
scope includes all languages that encourage functional programming,
including both purely applicative and imperative languages, as well as
languages with objects, concurrency, or parallelism. Topics of
interest include (but are not limited to):
* Language Design: concurrency, parallelism, and distribution;
modules; components and composition; metaprogramming; macros;
pattern matching; type systems; type inference; dependent types;
session types; gradual typing; refinement types; interoperability;
domain-specific languages; imperative programming; object-oriented
programming; logic programming; probabilistic programming;
reactive programming; generic programming; bidirectional
programming.
* Implementation: abstract machines; virtual machines;
interpretation; compilation; compile-time and run-time
optimization; garbage collection and memory management; runtime
systems; multi-threading; exploiting parallel hardware; interfaces
to foreign functions, services, components, or low-level machine
resources.
* Software-Development Techniques: algorithms and data structures;
design patterns; specification; verification; validation; proof
assistants; debugging; testing; tracing; profiling; build systems;
program synthesis.
* Foundations: formal semantics; lambda calculus; program
equivalence; rewriting; type theory; logic; category theory;
monads; continuations; control; state; effects; names and binding;
program verification.
* Analysis and Transformation: control flow; data flow; abstract
interpretation; partial evaluation; program calculation.
* Applications: symbolic computing; formal-methods tools; artificial
intelligence; systems programming; distributed systems and web
programming; hardware design; databases; XML processing;
scientific and numerical computing; graphical user interfaces;
graphics and multimedia; GPU programming; scripting; system
administration; security.
* Education: teaching introductory programming; parallel
programming; mathematical proof; algebra.
Submissions will be evaluated according to their relevance,
correctness, significance, originality, and clarity. Each submission
should explain its contributions in both general and technical terms,
clearly identifying what has been accomplished, explaining why it is
significant, and comparing it with previous work. The technical
content should be accessible to a broad audience.
PACMPL issue ICFP 2020 also welcomes submissions in two separate
categories — Functional Pearls and Experience Reports — that must be
marked as such when submitted and that need not report original
research results. Detailed guidelines on both categories are given at
the end of this call.
Please contact the principal editor if you have questions or are
concerned about the appropriateness of a topic.
### Preparation of submissions
**Deadline**: The deadline for submissions is **Tuesday, March 3, 2020**,
Anywhere on Earth (<https://en.wikipedia.org/wiki/Anywhere_on_Earth>).
This deadline will be strictly enforced.
**Formatting**: Submissions must be in PDF format, printable in black
and white on US Letter sized paper, and interpretable by common PDF
tools. All submissions must adhere to the "ACM Small" template that is
available (in both LaTeX and Word formats) from
<https://www.acm.org/publications/authors/submissions>. For authors
using LaTeX, a lighter-weight package, including only the essential
files, is available from
<http://sigplan.org/Resources/Author/#acmart-format>.
There is a limit of **25 pages for a full paper or Functional Pearl**
and **12 pages for an Experience Report**; in either case, the
bibliography will not be counted against these limits. Submissions
that exceed the page limits or, for other reasons, do not meet the
requirements for formatting, will be summarily rejected. Supplementary
material can and should be **separately** submitted (see below).
See also PACMPL's Information and Guidelines for Authors at
<https://pacmpl.acm.org/authors.cfm>.
**Submission**: Submissions will be accepted at <https://icfp20.hotcrp.com/>
Improved versions of a paper may be submitted at any point before the
submission deadline using the same web interface.
**Author Response Period**: Authors will have a 72-hour period,
starting at 14:00 UTC on **Tuesday, April 21, 2020**, to read reviews
and respond to them.
**Supplementary Material**: Authors have the option to attach
supplementary material to a submission, on the understanding that
reviewers may choose not to look at it. This supplementary material
should **not** be submitted as part of the main document; instead, it
should be uploaded as a **separate** PDF document or tarball.
Supplementary material should be uploaded **at submission time**, not
by providing a URL in the paper that points to an external repository.
Authors are free to upload both anonymized and non-anonymized
supplementary material. Anonymized supplementary material will be
visible to reviewers immediately; non-anonymized supplementary
material will be revealed to reviewers only after they have submitted
their review of the paper and learned the identity of the author(s).
**Authorship Policies**: All submissions are expected to comply with
the ACM Policies for Authorship that are detailed at
<https://www.acm.org/publications/authors/information-for-authors>.
**Republication Policies**: Each submission must adhere to SIGPLAN's
republication policy, as explained on the web at
<http://www.sigplan.org/Resources/Policies/Republication>.
### Review Process
This section outlines the two-stage process with lightweight
double-blind reviewing that will be used to select papers for PACMPL
issue ICFP 2020. We anticipate that there will be a need to clarify
and expand on this process, and we will maintain a list of frequently
asked questions and answers on the conference website to address
common concerns.
**PACMPL issue ICFP 2020 will employ a two-stage review process.** The
first stage in the review process will assess submitted papers using
the criteria stated above and will allow for feedback and input on
initial reviews through the author response period mentioned
previously. At the review meeting, a set of papers will be
conditionally accepted and all other papers will be rejected.
Authors will be notified of these decisions on **May 8, 2020**.
Authors of conditionally accepted papers will be provided with
committee reviews (just as in previous conferences) along with a set
of mandatory revisions. After four weeks (June 5, 2020), the authors
will provide a second submission. The second and final reviewing phase
assesses whether the mandatory revisions have been adequately
addressed by the authors and thereby determines the final
accept/reject status of the paper. The intent and expectation is that
the mandatory revisions can be addressed within four weeks and hence
that conditionally accepted papers will in general be accepted in the
second phase.
The second submission should clearly identify how the mandatory
revisions were addressed. To that end, the second submission must be
accompanied by a cover letter mapping each mandatory revision request
to specific parts of the paper. The cover letter will facilitate a
quick second review, allowing for confirmation of final acceptance
within two weeks. Conversely, the absence of a cover letter will be
grounds for the paper's rejection.
**PACMPL issue ICFP 2020 will employ a lightweight double-blind
reviewing process.** To facilitate this, submitted papers must
adhere to two rules:
1. **author names and institutions must be omitted**, and
2. **references to authors' own related work should be in the third
person** (e.g., not "We build on our previous work ..." but rather
"We build on the work of ...").
The purpose of this process is to help the reviewers come to an
initial judgement about the paper without bias, not to make it
impossible for them to discover the authors if they were to
try. Nothing should be done in the name of anonymity that weakens the
submission or makes the job of reviewing the paper more difficult
(e.g., important background references should not be omitted or
anonymized). In addition, authors should feel free to disseminate
their ideas or draft versions of their paper as they normally
would. For instance, authors may post drafts of their papers on the
web or give talks on their research ideas.
### Information for Authors of Accepted Papers
* As a condition of acceptance, final versions of all papers must
adhere to the new ACM Small format. The page limit for the final
versions of papers will be increased by two pages to help authors
respond to reviewer comments and mandatory revisions: **27 pages
plus bibliography for a regular paper or Functional Pearl, 14 pages
plus bibliography for an Experience Report**.
* Authors of accepted submissions will be required to agree to one of
the three ACM licensing options: open access on payment of a fee
(**recommended**, and SIGPLAN can cover the cost as described next);
copyright transfer to ACM; or retaining copyright but granting ACM
exclusive publication rights. Further information about ACM author
rights is available from <http://authors.acm.org>.
* PACMPL is a Gold Open Access journal. It will be archived in ACM's
Digital Library, but no membership or fee is required for
access. Gold Open Access has been made possible by generous funding
through ACM SIGPLAN, which will cover all open access costs in the
event authors cannot. Authors who can cover the costs may do so by
paying an Article Processing Charge (APC). PACMPL, SIGPLAN, and ACM
Headquarters are committed to exploring routes to making Gold Open
Access publication both affordable and sustainable.
* ACM offers authors a range of copyright options, one of which is
Creative Commons CC-BY publication; this is the option recommended
by the PACMPL editorial board. A reasoned argument in favour of this
option can be found in the article [Why
CC-BY?](https://oaspa.org/why-cc-by/) published by OASPA, the Open
Access Scholarly Publishers Association.
* We intend that the papers will be freely available for download from
the ACM Digital Library in perpetuity via the OpenTOC mechanism.
* ACM Author-Izer is a unique service that enables ACM authors to
generate and post links on either their home page or institutional
repository for visitors to download the definitive version of their
articles from the ACM Digital Library at no charge. Downloads
through Author-Izer links are captured in official ACM statistics,
improving the accuracy of usage and impact
measurements. Consistently linking to the definitive version of an
ACM article should reduce user confusion over article
versioning. After an article has been published and assigned to the
appropriate ACM Author Profile pages, authors should visit
<http://www.acm.org/publications/acm-author-izer-service> to learn
how to create links for free downloads from the ACM DL.
* The official publication date is the date the papers are made
available in the ACM Digital Library. This date may be up to *two
weeks prior* to the first day of the conference. The official
publication date affects the deadline for any patent filings related
to published work.
* At least one author of each accepted submission will be expected to
attend and present that paper at the conference. The schedule for
presentations will be determined and shared with authors after the
full program has been selected. Presentations will be videotaped and
released online if the presenter consents.
In extraordinary circumstances, at the discretion of the principal
editor, alternative presentation methods may be approved for
specific papers. The canonical example is where all authors are
denied visas to the ICFP host country, in which case a nonauthor may
be deputized to present, or various electronic substitutes may be
considered. We list these options in the interest of transparency,
but please keep in mind that, most years, no exceptions are
granted. This option is not meant, e.g., to excuse cases where
authors find themselves double-booked with other meetings (so, at
the time of submitting a paper, please do keep the days of the
conference reserved on at least one author's calendar).
### Artifact Evaluation
Authors of papers that are conditionally accepted in the first phase
of the review process will be encouraged (but not required) to submit
supporting materials for Artifact Evaluation. These items will then be
reviewed by an Artifact Evaluation Committee, separate from the paper
Review Committee, whose task is to assess how the artifacts support
the work described in the associated paper. Papers that go through the
Artifact Evaluation process successfully will receive a seal of
approval printed on the papers themselves. Authors of accepted papers
will be encouraged to make the supporting materials publicly available
upon publication of the papers, for example, by including them as
"source materials" in the ACM Digital Library. An additional seal
will mark papers whose artifacts are made available, as outlined in
the ACM guidelines for artifact badging.
Participation in Artifact Evaluation is voluntary and will not
influence the final decision regarding paper acceptance.
### Special categories of papers
In addition to research papers, PACMPL issue ICFP solicits two kinds
of papers that do not require original research contributions:
Functional Pearls, which are full papers, and Experience Reports,
which are limited to half the length of a full paper. Authors
submitting such papers should consider the following guidelines.
#### Functional Pearls
A Functional Pearl is an elegant essay about something related to
functional programming. Examples include, but are not limited to:
* a new and thought-provoking way of looking at an old idea
* an instructive example of program calculation or proof
* a nifty presentation of an old or new data structure
* an interesting application of functional programming techniques
* a novel use or exposition of functional programming in the classroom
While pearls often demonstrate an idea through the development of a
short program, there is no requirement or expectation that they do
so. Thus, they encompass the notions of theoretical and educational
pearls.
Functional Pearls are valued as highly and judged as rigorously as
ordinary papers, but using somewhat different criteria. In particular,
a pearl is not required to report original research, but, it should be
concise, instructive, and entertaining. A pearl is likely to be
rejected if its readers get bored, if the material gets too
complicated, if too much specialized knowledge is needed, or if the
writing is inelegant. The key to writing a good pearl is polishing.
A submission that is intended to be treated as a pearl must be marked
as such on the submission web page, and should contain the words
"Functional Pearl" somewhere in its title or subtitle. These steps
will alert reviewers to use the appropriate evaluation
criteria. Pearls will be combined with ordinary papers, however, for
the purpose of computing the conference's acceptance rate.
#### Experience Reports
The purpose of an Experience Report is to help create a body of
published, refereed, citable evidence that functional programming
really works -- or to describe what obstacles prevent it from
working.
Possible topics for an Experience Report include, but are not limited to:
* insights gained from real-world projects using functional programming
* comparison of functional programming with conventional programming
in the context of an industrial project or a university curriculum
* project-management, business, or legal issues encountered when
using functional programming in a real-world project
* curricular issues encountered when using functional programming in
education
* real-world constraints that created special challenges for an
implementation of a functional language or for functional
programming in general
An Experience Report is distinguished from a normal PACMPL issue ICFP
paper by its title, by its length, and by the criteria used to
evaluate it.
* Both in the papers and in any citations, the title of each
accepted Experience Report must end with the words "(Experience
Report)" in parentheses. The acceptance rate for Experience
Reports will be computed and reported separately from the rate for
ordinary papers.
* Experience Report submissions can be at most 12 pages long,
excluding bibliography.
* Each accepted Experience Report will be presented at the
conference, but depending on the number of Experience Reports and
regular papers accepted, authors of Experience reports may be
asked to give shorter talks.
* Because the purpose of Experience Reports is to enable our
community to accumulate a body of evidence about the efficacy of
functional programming, an acceptable Experience Report need not
add to the body of knowledge of the functional-programming
community by presenting novel results or conclusions. It is
sufficient if the Report states a clear thesis and provides
supporting evidence. The thesis must be relevant to ICFP, but it
need not be novel.
The review committee will accept or reject Experience Reports based on
whether they judge the evidence to be convincing. Anecdotal evidence
will be acceptable provided it is well argued and the author explains
what efforts were made to gather as much evidence as
possible. Typically, more convincing evidence is obtained from papers
which show how functional programming was used than from papers which
only say that functional programming was used. The most convincing
evidence often includes comparisons of situations before and after the
introduction or discontinuation of functional programming. Evidence
drawn from a single person's experience may be sufficient, but more
weight will be given to evidence drawn from the experience of groups
of people.
An Experience Report should be short and to the point: it should make
a claim about how well functional programming worked on a particular
project and why, and produce evidence to substantiate this claim. If
functional programming worked in this case in the same ways it has
worked for others, the paper need only summarize the results —
the main part of the paper should discuss how well it worked and in
what context. Most readers will not want to know all the details of
the project and its implementation, but the paper should characterize
the project and its context well enough so that readers can judge to
what degree this experience is relevant to their own projects. The
paper should take care to highlight any unusual aspects of the
project. Specifics about the project are more valuable than
generalities about functional programming; for example, it is more
valuable to say that the team delivered its software a month ahead of
schedule than it is to say that functional programming made the team
more productive.
If the paper not only describes experience but also presents new
technical results, or if the experience refutes cherished beliefs of
the functional-programming community, it may be better to submit it as
a full paper, which will be judged by the usual criteria of novelty,
originality, and relevance. The principal editor will be happy to
advise on any concerns about which category to submit to.
### ICFP Organizers
General Chair: Stephanie Weirich (University of Pennsylvania, USA)
Artifact Evaluation Co-Chairs: Ben Lippmeier (UNSW, Australia)
Brent Yorgey (Hendrix College, USA)
Industrial Relations Chair: Alan Jeffrey (Mozilla Research, USA)
Programming Contest Organiser: Igor Lukanin (Kontur, Russia)
Publicity and Web Chair: Sam Tobin-Hochstadt (Indiana University, USA)
Student Research Competition Chair: Youyou Cong (Tokyo Institute of Technology, Japan)
Workshops Co-Chair: Leonidas Lampropoulos (University of Maryland, USA)
Jennifer Hackett (University of Nottingham, UK)
Conference Manager: Annabel Satin (P.C.K.)
### PACMPL Volume 4, Issue ICFP 2020
Principal Editor: Adam Chlipala (MIT, USA)
Review Committee:
Andreas Abel (Gothenburg University, Sweden)
Nada Amin (Harvard University, USA)
Edwin Brady (University of St. Andrews, UK)
William E. Byrd (University of Alabama at Birmingham, USA)
David Darais (University of Vermont)
Richard A. Eisenberg (Bryn Mawr College, USA)
Matthew Fluet (Rochester Institute of Technology, USA)
Makoto Hamana (Gunma University, Japan)
Fritz Henglein (Department of Computer Science, University of Copenhagen (DIKU) and Deon Digital, Denmark)
Jan Hoffmann (Carnegie Mellon University, USA)
Robbert Krebbers (Delft University of Technology, Netherlands)
Neel Krishnaswami (Computer Laboratory, University of Cambridge, UK)
Geoffrey Mainland (Drexel University, USA)
Magnus O. Myreen (Chalmers University of Technology, Sweden)
Atsushi Ohori (Tohoku University, Japan)
Frank Piessens (KU Leuven, Belgium)
Nadia Polikarpova (University of California San Diego, USA)
Jonathan Protzenko (Microsoft Research, USA)
Jerome Simeon (Clause, France)
KC Sivaramakrishnan (IIT Madras, India)
External Review Committee:
Danel Ahman (University of Ljubljana, Slovenia)
Aws Albarghouthi (University of Wisconsin-Madison, USA)
Kenichi Asai (Ochanomizu University, Japan)
Patrick Bahr (IT University of Copenhagen, Denmark)
Stephanie Balzer (Carnegie Mellon University, USA)
Jean-Philippe Bernardy (University of Gothenburg, Sweden)
Sandrine Blazy (Univ Rennes-IRISA, France)
Benjamin Canou (OCamlPro, France)
Giuseppe Castagna (CNRS - Université de Paris, France)
Jesper Cockx (TU Delft, Netherlands)
Youyou Cong (Tokyo Institute of Technology, Japan)
Leonardo De Moura (Microsoft Research, USA)
Sebastian Erdweg (JGU Mainz, Germany)
Ronald Garcia (University of British Columbia, Canada)
Jennifer Hackett (University of Nottingham, UK)
Troels Henriksen (University of Copenhagen, Denmark)
Gabriele Keller (Utrecht University, Netherlands)
Delia Kesner (IRIF, France / University of Paris Diderot, France)
Shriram Krishnamurthi (Brown University, United States)
Jan Midtgaard (University of Southern Denmark, Denmark)
Andrey Mokhov (Jane Street, USA)
J. Garrett Morris (University of Kansas, USA)
Stefan Muller (Carnegie Mellon University, USA)
Rasmus Ejlers Møgelberg (IT University of Copenhagen, Denmark)
Cyrus Omar (University of Chicago, USA)
Dominic Orchard (University of Kent, UK)
Ivan Perez (NIA / NASA Formal Methods)
Brigitte Pientka (McGill University, Canada)
Juan Pedro Bolívar Puente (Independent Consultant, Sinusoidal Engineering)
Norman Ramsey (Tufts University, USA)
Christine Rizkallah (UNSW Sydney, Australia)
Tiark Rompf (Purdue University, USA)
Guido Salvaneschi (Technische Universität Darmstadt, Germany)
Tom Schrijvers (KU Leuven, Belgium)
Chung-chieh Shan (Indiana University, USA)
Vincent St-Amour (Northwestern University, USA)
Aaron Stump (The University of Iowa, USA)
Nicolas Tabareau (Inria, France)
Ross Tate (Cornell University, USA)
Dimitrios Vytiniotis (DeepMind, UK)
John Wiegley (DFINITY, USA)
Beta Ziliani (FAMAF, UNC and CONICET, Argentina)
2020-01-20
[Caml-list] 13th International Conference on Graph Transformation (ICGT'2020): Call for Papers
=======================================================
13th International Conference on Graph Transformation
ICGT 2020
http://icgt2020.di.unipi.it
co-located with STAF 2020, June 22-26 Bergen, Norway
=======================================================
Aims and Scope
-------------------------------------------------------
The use of graphs and graph-like structures as a formalism for
specification and modelling is widespread in all areas of computer
science as well as in many fields of computational research and
engineering. Relevant examples include software architectures, pointer
structures, state space graphs, control/data flow graphs, UML and other
domain-specific models, network layouts, topologies of cyber-physical
environments, and molecular structures. Often, these graphs undergo
dynamic change, ranging from reconfiguration and evolution to various
kinds of behaviour, all of which may be captured by rule-based graph
manipulation. Thus, graphs and graph transformation form a fundamental
universal modelling paradigm that serves as a means for formal reasoning
and analysis, ranging from the verification of certain properties of
interest to the discovery of fundamentally new insights.
The International Conference on Graph Transformation aims at fostering
exchange and collaboration of researchers from different backgrounds
working with graphs and graph transformation, either in contributing to
their theoretical foundations or by applying established formalisms to
classical or novel areas. The conference not only serves as a
well-established scientific publication outlet, but also as a platform
to boost inter- and intra-disciplinary research and to leeway for new ideas.
The 13th International Conference on Graph Transformation (ICGT 2020)
will be held in Bergen, Norway, as part of STAF 2020 (Software
Technologies: Applications and Foundations). The conference takes place
under the auspices of EATCS and IFIP WG 1.3. Proceedings will be
published by Springer in the Lecture Notes in Computer Science (LNCS)
series.
Topics of Interest
-------------------------------------------------------
In order to foster a lively exchange of perspectives on the subject of
the conference, the programme committee of ICGT 2020 encourages all
kinds of contributions related to graphs and graph transformation,
either from a theoretical point of view or a practical one.
Topics of interest include, but are not limited to the following subjects:
- General models of graph transformation (e.g. adhesive categories and
hyperedge replacement systems)
- Analysis and verification of graph transformation systems
- Graph theoretical properties of graph languages
- Automata on graphs and parsing of graph languages
- Logical aspects of graph transformation
- Computational models based on graphs
- Structuring and modularization of graph transformation
- Hierarchical graphs and decomposition of graphs
- Parallel, concurrent, and distributed graph transformation
- Term graph and string diagram rewriting
- Petri nets and other models of concurrency
- Business process models and notations
- Bigraphs and bigraphical reactive systems
- Graph databases and graph queries
- Model-driven development and model transformation
- Model checking, program analysis and verification, simulation and
animation
- Syntax, semantics and implementation of programming languages,
including domain-specific and visual languages
- Graph transformation languages and tool support
- Efficient algorithms (e.g. pattern matching, graph traversal, network
analysis)
- Applications and case studies in software engineering (e.g. software
architectures, refactoring, access control, and service-orientation)
- Applications to computing paradigms (e.g. bio-inspired, quantum,
ubiquitous, and visual)
Important Dates
-------------------------------------------------------
Abstract submission: February 21, 2020
Paper submission: February 28, 2020
Notification: April 10, 2020
Camera-ready: May 01, 2020
Conference: June 22-26, 2020
Submission Guidelines
-------------------------------------------------------
Papers can be submitted at
http://www.easychair.org/conferences/?conf=icgt2020 using Springer's
LNCS format (http://www.springer.com/lncs). For regular and tool
demonstration papers, simultaneous submission to other conferences with
proceedings or submission of material that has already been published
elsewhere is not allowed. The page limits are strict and include references.
Papers are solicited in three categories:
- Regular papers (limited to 16 pages in Springer LNCS format)
describe innovative contributions and are evaluated with respect to
their originality, significance, and technical soundness. We also
solicit case studies describing applications of graph transformation in
any application domain. Additional material intended for reviewers but
not for publication in the final version may be included in a clearly
marked appendix.
- Tool presentation papers (limited to 8 pages in Springer LNCS format)
demonstrate the main features and functionality of graph-based tools. A
tool presentation paper may have an appendix with a detailed demo
description (up to 4 pages), which will be reviewed but not included in
the proceedings.
- New ideas papers (limited to 2 pages in Springer LNCS format)
report on relevant contributions to the theory or applications of graph
transformation, which may have been published (or accepted for
publication) in a peer-reviewed conference other than ICGT, as a book
chapter or journal article since 2018. Papers in this category will be
selected for presentation at the conference according to their relevance
to the graph transformation community, and they will be considered for
the special issues. Submissions will consist of a 2-page abstract. In
case of extended abstracts of published papers, the submission must
refer to the published paper and include the original paper in PDF.
Special Issues
-------------------------------------------------------
We are pleased to confirm two special issues for ICGT2020, devoted to
the theoretical and application-oriented sides of the conference,
respectively. The former is going to appear in Theoretical Computer
Science
(https://www.journals.elsevier.com/theoretical-computer-science), the
latter has been accepted as special issue in Science of Computer
Programming
(https://www.journals.elsevier.com/science-of-computer-programming).
Keynote Speaker
-------------------------------------------------------
TBA
Program Chairs
-------------------------------------------------------
Fabio Gadducci (University of Pisa, Italy)
Timo Kehrer (Humboldt-Universität zu Berlin, Germany)
Program Committee
-------------------------------------------------------
Paolo Baldan, Università degli Studi di Padova, Italy
Gábor Bergmann, Budapest University of Technology and Economics, Hungary
Paolo Bottoni, Sapienza Università di Roma, Italy
Andrea Corradini, University of Pisa, Italy
Juergen Dingel, Queen's University Kingston, Ontario, Canada
Maribel Fernandez, King's College London, United Kingdom
Holger Giese, Hasso-Plattner-Institut Potsdam, Germany
Reiko Heckel, University of Leicester, United Kingdom
Thomas Hildebrandt, University of Copenhagen, Denmark
Wolfram Kahl, McMaster University, Canada
Barbara König, Universität Duisburg-Essen, Germany
Jean Krivine, IRIF (Institut de recherche en informatique fondamentale,
Université de Paris), France
Leen Lambers, Hasso-Plattner-Institut Potsdam, Germany
Yngve Lamo, Western Norway University of Applied Sciences Bergen, Norway
Juan de Lara, Universidad Autónoma de Madrid, Spain
Detlef Plump, University of York, United Kingdom
Arend Rensink, University of Twente Enschede, Netherlands
Leila Ribeiro, Federal University of Rio Grande do Sul (UFRGS) Porto
Alegre, Brazil
Andy Schürr, Technische Universität Darmstadt, Germany
Pawel Maria Sobocinski, Taltech Tallinn University of Technology, Estonia
Gabriele Taentzer, Philipps-Universität Marburg, Germany
Matthias Tichy, Universität Ulm, Germany
Uwe Egbert Wolter, University of Bergen, Norway
Steffen Zschaler, King's College London, United Kingdom
13th International Conference on Graph Transformation
ICGT 2020
http://icgt2020.di.unipi.it
co-located with STAF 2020, June 22-26 Bergen, Norway
=======================================================
Aims and Scope
-------------------------------------------------------
The use of graphs and graph-like structures as a formalism for
specification and modelling is widespread in all areas of computer
science as well as in many fields of computational research and
engineering. Relevant examples include software architectures, pointer
structures, state space graphs, control/data flow graphs, UML and other
domain-specific models, network layouts, topologies of cyber-physical
environments, and molecular structures. Often, these graphs undergo
dynamic change, ranging from reconfiguration and evolution to various
kinds of behaviour, all of which may be captured by rule-based graph
manipulation. Thus, graphs and graph transformation form a fundamental
universal modelling paradigm that serves as a means for formal reasoning
and analysis, ranging from the verification of certain properties of
interest to the discovery of fundamentally new insights.
The International Conference on Graph Transformation aims at fostering
exchange and collaboration of researchers from different backgrounds
working with graphs and graph transformation, either in contributing to
their theoretical foundations or by applying established formalisms to
classical or novel areas. The conference not only serves as a
well-established scientific publication outlet, but also as a platform
to boost inter- and intra-disciplinary research and to leeway for new ideas.
The 13th International Conference on Graph Transformation (ICGT 2020)
will be held in Bergen, Norway, as part of STAF 2020 (Software
Technologies: Applications and Foundations). The conference takes place
under the auspices of EATCS and IFIP WG 1.3. Proceedings will be
published by Springer in the Lecture Notes in Computer Science (LNCS)
series.
Topics of Interest
-------------------------------------------------------
In order to foster a lively exchange of perspectives on the subject of
the conference, the programme committee of ICGT 2020 encourages all
kinds of contributions related to graphs and graph transformation,
either from a theoretical point of view or a practical one.
Topics of interest include, but are not limited to the following subjects:
- General models of graph transformation (e.g. adhesive categories and
hyperedge replacement systems)
- Analysis and verification of graph transformation systems
- Graph theoretical properties of graph languages
- Automata on graphs and parsing of graph languages
- Logical aspects of graph transformation
- Computational models based on graphs
- Structuring and modularization of graph transformation
- Hierarchical graphs and decomposition of graphs
- Parallel, concurrent, and distributed graph transformation
- Term graph and string diagram rewriting
- Petri nets and other models of concurrency
- Business process models and notations
- Bigraphs and bigraphical reactive systems
- Graph databases and graph queries
- Model-driven development and model transformation
- Model checking, program analysis and verification, simulation and
animation
- Syntax, semantics and implementation of programming languages,
including domain-specific and visual languages
- Graph transformation languages and tool support
- Efficient algorithms (e.g. pattern matching, graph traversal, network
analysis)
- Applications and case studies in software engineering (e.g. software
architectures, refactoring, access control, and service-orientation)
- Applications to computing paradigms (e.g. bio-inspired, quantum,
ubiquitous, and visual)
Important Dates
-------------------------------------------------------
Abstract submission: February 21, 2020
Paper submission: February 28, 2020
Notification: April 10, 2020
Camera-ready: May 01, 2020
Conference: June 22-26, 2020
Submission Guidelines
-------------------------------------------------------
Papers can be submitted at
http://www.easychair.org/conferences/?conf=icgt2020 using Springer's
LNCS format (http://www.springer.com/lncs). For regular and tool
demonstration papers, simultaneous submission to other conferences with
proceedings or submission of material that has already been published
elsewhere is not allowed. The page limits are strict and include references.
Papers are solicited in three categories:
- Regular papers (limited to 16 pages in Springer LNCS format)
describe innovative contributions and are evaluated with respect to
their originality, significance, and technical soundness. We also
solicit case studies describing applications of graph transformation in
any application domain. Additional material intended for reviewers but
not for publication in the final version may be included in a clearly
marked appendix.
- Tool presentation papers (limited to 8 pages in Springer LNCS format)
demonstrate the main features and functionality of graph-based tools. A
tool presentation paper may have an appendix with a detailed demo
description (up to 4 pages), which will be reviewed but not included in
the proceedings.
- New ideas papers (limited to 2 pages in Springer LNCS format)
report on relevant contributions to the theory or applications of graph
transformation, which may have been published (or accepted for
publication) in a peer-reviewed conference other than ICGT, as a book
chapter or journal article since 2018. Papers in this category will be
selected for presentation at the conference according to their relevance
to the graph transformation community, and they will be considered for
the special issues. Submissions will consist of a 2-page abstract. In
case of extended abstracts of published papers, the submission must
refer to the published paper and include the original paper in PDF.
Special Issues
-------------------------------------------------------
We are pleased to confirm two special issues for ICGT2020, devoted to
the theoretical and application-oriented sides of the conference,
respectively. The former is going to appear in Theoretical Computer
Science
(https://www.journals.elsevier.com/theoretical-computer-science), the
latter has been accepted as special issue in Science of Computer
Programming
(https://www.journals.elsevier.com/science-of-computer-programming).
Keynote Speaker
-------------------------------------------------------
TBA
Program Chairs
-------------------------------------------------------
Fabio Gadducci (University of Pisa, Italy)
Timo Kehrer (Humboldt-Universität zu Berlin, Germany)
Program Committee
-------------------------------------------------------
Paolo Baldan, Università degli Studi di Padova, Italy
Gábor Bergmann, Budapest University of Technology and Economics, Hungary
Paolo Bottoni, Sapienza Università di Roma, Italy
Andrea Corradini, University of Pisa, Italy
Juergen Dingel, Queen's University Kingston, Ontario, Canada
Maribel Fernandez, King's College London, United Kingdom
Holger Giese, Hasso-Plattner-Institut Potsdam, Germany
Reiko Heckel, University of Leicester, United Kingdom
Thomas Hildebrandt, University of Copenhagen, Denmark
Wolfram Kahl, McMaster University, Canada
Barbara König, Universität Duisburg-Essen, Germany
Jean Krivine, IRIF (Institut de recherche en informatique fondamentale,
Université de Paris), France
Leen Lambers, Hasso-Plattner-Institut Potsdam, Germany
Yngve Lamo, Western Norway University of Applied Sciences Bergen, Norway
Juan de Lara, Universidad Autónoma de Madrid, Spain
Detlef Plump, University of York, United Kingdom
Arend Rensink, University of Twente Enschede, Netherlands
Leila Ribeiro, Federal University of Rio Grande do Sul (UFRGS) Porto
Alegre, Brazil
Andy Schürr, Technische Universität Darmstadt, Germany
Pawel Maria Sobocinski, Taltech Tallinn University of Technology, Estonia
Gabriele Taentzer, Philipps-Universität Marburg, Germany
Matthias Tichy, Universität Ulm, Germany
Uwe Egbert Wolter, University of Bergen, Norway
Steffen Zschaler, King's College London, United Kingdom
[Caml-list] FSCD 2020 - Third Call for Papers (Abstract: February 6/ Submission: February 9)
(Apologies for multiple copies of this announcement. Please circulate.)
==================================================================
Updated information on: Submission guidelines
==================================================================
CALL FOR PAPERS
Fifth International Conference on
Formal Structures for Computation and Deduction (FSCD 2020)
June 29 – July 5, 2020, Paris, France
IMPORTANT DATES
---------------
All deadlines are midnight anywhere-on-earth (AoE); late submissions will not be considered.
Abstract: February 6, 2020
Submission: February 9, 2020
Rebuttal: March 27-29, 2020
Notification: April 13, 2020
Final version: April 27, 2020
INVITED SPEAKERS
----------------
- René Thiemann: FSCD-IJCAR joint speaker
- John Harrison: FSCD-IJCAR joint speaker
- Brigitte Pienta
- Andrew Pitts
- Simona Ronchi della Rocca
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:
1. 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.
2. Methods in Computation and Deduction: Type systems (poly- morphism, dependent, recursive, intersection, session, etc.);
Induction, coinduction; Matching, unification, completion, order- ings; Strategies (normalization, completeness, etc.);
Tree automata; Model building and model checking; Proof search and theorem proving;
Constraint solving and decision procedures.
3. Semantics: Operational semantics and abstract machines; Game Semantics and applications;
3. 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.
4. Algorithmic Analysis and Transformations of Formal Systems: Type Inference and type checking;
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;
5. Tools and Applications: Programming and proof environments; Verification tools;
Proof assistants and interactive theorem provers; Applications in industry;
Applications of formal sys- tems in other sciences.
6. Semantics and Verification in new challenging areas: Certification; Security; Blockchain protocols;
6. Semantics and Verification in new challenging areas: Certification; Security; Blockchain protocols;
Data Bases; Deep learning and machine learning algorithms; Planning.
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.
SPECIAL ISSUE
----------------------
Authors of selected papers will be invited to submit an extended version to a special issue of
Logical Methods in Computer Science.
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.
Complete instructions on submitting a paper can be found on the conference web site.
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).
PROGRAM COMMITTEE CHAIR
-----------------------
Zena M. Ariola, University of Oregon
PROGRAM COMMITTEE
-----------------
M. Alpuente, Technical Univ. of Valencia
S. Alves, University of Porto
A. Bauer, University of Ljubljana
M. P. Bonacina, Università 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. Fernández, 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
A. Bauer, University of Ljubljana
M. P. Bonacina, Università 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. Fernández, 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
STEERING COMMITTEE WORKSHOP CHAIR
--------------------------------
J. Vicary, Oxford University
PUBLICITY CHAIR
---------------
S. Alves, University of Porto
FSCD STEERING COMMITTEE
-----------------------
S. Alves (University of Porto),
M. Ayala-Rincón (University of Brasilia)
C. Fuhs (Birkbeck, London University)
H. Geuvers (Radboud University)
D. Kesner (Chair, University of Paris Diderot )
H. Kirchner (Inria)
C. Kop (Radboud University)
D. Mazza (University of Paris 13)
D. Miller (Inria)
L. Ong (Oxford University)
J. Rehof (TU Dortmund)
S. Staton (Oxford University)
2020-01-14
[Caml-list] [TFP'20] call for participation: Trends in Functional Programming 2020, 13-14 February, Krakow, Poland
-------------------------------------------------------------------------
Call for participation
21st Symposium on Trends in Functional Programming
tfp2020.org
-------------------------------------------------------------------------
The list of accepted papers is available at
http://www.cse.chalmers.se/~rjmh/tfp/
The symposium on Trends in Functional Programming (TFP) is an international
forum for researchers with interests in all aspects of functional
programming,
taking a broad view of current and future trends in the area. It aspires
to be
a lively environment for presenting the latest research results, and other
contributions.
* TFP is moving to new winter dates, to provide an FP forum in between the
annual ICFP events.
* TFP offers a supportive reviewing process designed to help less
experienced
authors succeed, with two rounds of review, both before and after the
symposium itself. Authors have an opportunity to address reviewers'
concerns
before final decisions on publication in the proceedings.
* TFP offers two "best paper" awards, the John McCarthy award for best
paper,
and the David Turner award for best student paper.
* This year we are particularly excited to co-locate with Lambda Days in
beautiful Krakow. Lambda Days is a vibrant developer conference with
hundreds
of attendees and a lively programme of talks on functional
programming in
practice. TFP will be held in the same venue, and participants will
be able
to session-hop between the two events.
Important Dates
---------------
Submission deadline for pre-symposium review: 15th November, 2019
-- passed --
Submission deadline for draft papers: 10th January, 2020
-- passed --
Registration (regular): 2nd February, 2020
Registration (late): 13th February, 2020
Symposium dates: 13-14th February, 2020
Visit tfp2020.org for more information.
Call for participation
21st Symposium on Trends in Functional Programming
tfp2020.org
-------------------------------------------------------------------------
The list of accepted papers is available at
http://www.cse.chalmers.se/~rjmh/tfp/
The symposium on Trends in Functional Programming (TFP) is an international
forum for researchers with interests in all aspects of functional
programming,
taking a broad view of current and future trends in the area. It aspires
to be
a lively environment for presenting the latest research results, and other
contributions.
* TFP is moving to new winter dates, to provide an FP forum in between the
annual ICFP events.
* TFP offers a supportive reviewing process designed to help less
experienced
authors succeed, with two rounds of review, both before and after the
symposium itself. Authors have an opportunity to address reviewers'
concerns
before final decisions on publication in the proceedings.
* TFP offers two "best paper" awards, the John McCarthy award for best
paper,
and the David Turner award for best student paper.
* This year we are particularly excited to co-locate with Lambda Days in
beautiful Krakow. Lambda Days is a vibrant developer conference with
hundreds
of attendees and a lively programme of talks on functional
programming in
practice. TFP will be held in the same venue, and participants will
be able
to session-hop between the two events.
Important Dates
---------------
Submission deadline for pre-symposium review: 15th November, 2019
-- passed --
Submission deadline for draft papers: 10th January, 2020
-- passed --
Registration (regular): 2nd February, 2020
Registration (late): 13th February, 2020
Symposium dates: 13-14th February, 2020
Visit tfp2020.org for more information.
2020-01-13
[Caml-list] 2nd Call for Participation: BOB 2020 (February 28, Berlin, early-bird until Jan 20)
We're thrilled to have Gabriel Scherer among the speakers!
================================================================================
BOB 2020
Conference
"What happens if we simply use what's best?"
February 28, 2020, Berlin
http://bobkonf.de/2020/
Program: http://bobkonf.de/2020/en/program.html
Registration: http://bobkonf.de/2020/en/registration.html
================================================================================
BOB is the conference for developers, architects and decision-makers
to explore technologies beyond the mainstream in software development,
and to find the best tools available to software developers today. Our
goal is for all participants of BOB to return home with new insights
that enable them to improve their own software development
experiences.
The program features 14 talks and 8 tutorials on current topics:
http://bobkonf.de/2020/en/program.html
The subject range of talks includes functional programming,
formal methods, architecture documentation, functional-reactive
programming, and language design.
The tutorials feature introductions to Idris, Haskell, F#, TLA+,
ReasonML, and probabilistic programming.
Heather Miller will give the keynote talk.
Registration is open online:
http://bobkonf.de/2020/en/registration.html
NOTE: The early-bird rates expire on January 20, 2020!
BOB cooperates with the Racketfest conference on the day before BOB:
https://racketfest.com/
BOB cooperates with the :clojureD conference on the day after BOB:
https://clojured.de/
================================================================================
BOB 2020
Conference
"What happens if we simply use what's best?"
February 28, 2020, Berlin
http://bobkonf.de/2020/
Program: http://bobkonf.de/2020/en/program.html
Registration: http://bobkonf.de/2020/en/registration.html
================================================================================
BOB is the conference for developers, architects and decision-makers
to explore technologies beyond the mainstream in software development,
and to find the best tools available to software developers today. Our
goal is for all participants of BOB to return home with new insights
that enable them to improve their own software development
experiences.
The program features 14 talks and 8 tutorials on current topics:
http://bobkonf.de/2020/en/program.html
The subject range of talks includes functional programming,
formal methods, architecture documentation, functional-reactive
programming, and language design.
The tutorials feature introductions to Idris, Haskell, F#, TLA+,
ReasonML, and probabilistic programming.
Heather Miller will give the keynote talk.
Registration is open online:
http://bobkonf.de/2020/en/registration.html
NOTE: The early-bird rates expire on January 20, 2020!
BOB cooperates with the Racketfest conference on the day before BOB:
https://racketfest.com/
BOB cooperates with the :clojureD conference on the day after BOB:
https://clojured.de/
2020-01-08
[Caml-list] Computability in Europe 2020 THIRD CALL FOR PAPERS
Computability in Europe 2020 THIRD CALL FOR PAPERS:
CiE 2020:
Salerno, Italy
June 29 - July 3, 2020
IMPORTANT DATES:
Deadline for abstract registration: 17 January 2020 AOE (extended)
Deadline for article submission: 24 January 2020 AOE (extended)
Notification of acceptance: 14 March 2020
Final versions due: 7 April 2020
Deadline for informal presentations submission: 10 April 2020
(The notifications of acceptance for informal presentations will be sent a few days after submission.)
Early registration before: 1 May 2020
CiE 2020 is the 16th conference organized by CiE (Computability in Europe), a European association of mathematicians, logicians, computer scientists, philosophers, physicists and others interested in new developments in computability and their underlying significance for the real world.
Previous meetings have taken place in Amsterdam (2005), Swansea (2006), Siena (2007), Athens (2008), Heidelberg (2009), Ponta Delgada (2010), Sofia (2011), Cambridge (2012), Milan (2013), Budapest (2014), Bucharest (2015), Paris (2016), Turku (2017), Kiel (2018), and Durham (2019).
TUTORIAL SPEAKERS:
- Virginia Vassilevska Williams (MIT)
- Martin Ziegler (Korea Advanced Institute of Science and Technology)
INVITED SPEAKERS:
Paolo Boldi (University of Milan)
Véronique Bruyère (University of Mons)
Ekatarina Fokina (Vienna University of Technology)
Amaury Pouly (CNRS Paris)
Antonio Restivo (University of Palermo)
Damien Woods (Maynooth University)
HOSTED BY:
Department of Computer Science, University of Salerno
SPECIAL SESSIONS:
Algorithmic Learning Theory
Combinatorial String Matching
Computable Topology
HAPOC session on Fairness in Algorithms
Large scale Bioinformatics and Computational Sciences
Modern aspects of Formal Languages
CONTRIBUTED PAPERS:
Contributed papers will be selected from submissions received by the PROGRAMME COMMITTEE consisting of:
Marcella Anselmo University of Salerno (co-chair)
Veronica Becher Universidad de Buenos Aires
Paola Bonizzoni University of Milano-Bicocca
Laura Crosilla University of Oslo
Liesbeth De Mol Université de Lille 3
Gianluca Della Vedova University of Milano-Bicocca
Jérôme Durand-Lose Université d'Orléans
Pawel Gawrychowski University of Wroclaw
Mathieu Hoyrup LORIA
Juliette Kennedy University of Helsinki
Karoliina Lehtinen University of Liverpool
Benedikt Loewe Universiteit van Amsterdam
Florin Manea Universität Göttingen
Timothy McNicholl Iowa State University
Klaus Meer BTU Cottbus-Senftenberg
Turlough Neary University of Zurich
Daniel Paulusma Durham University
Arno Pauly Swansea University (co-chair)
Karin Quaas University of Leipzig
Viola Schiaffonati Politecnico di Milano
Markus L. Schmid Humboldt University Berlin
Alexander Schoenhuth Bielefeld University
Thomas Schwentick Universität Dortmund
Marinella Sciortino University of Palermo
Victor Selivanov Institute on Informatics Systems
Mariya Soskova University of Wisconsin-Madison
Peter Van Emde Boas Universiteit van Amsterdam
Linda Brown Westrick Pennsylvania State University
The CiE conferences serve as an interdisciplinary forum for research in all aspects of computability, foundations of computer science, logic, and theoretical computer science, as well as the interplay of these areas with practical issues in computer science and with other disciplines such as biology, mathematics, philosophy, or physics.
THE PROGRAMME COMMITTEE cordially invites all researchers (European and non-European) to submit original research articles in all areas related to the above for presentation at the conference and inclusion in the proceedings of CiE 2020 at https://easychair.org/conferences/?conf=cie2020.
Papers must be submitted in PDF format, using the LNCS style (available at https://www.springer.com/gp/computer-science/lncs/conference-proceedings-guidelines) and must have a maximum of 12 pages, including references but excluding a possible appendix in which one can include proofs and other additional material. Papers building bridges between different parts of the research community are particularly welcome.
The CONFERENCE PROCEEDINGS will be published by LNCS, Springer Verlag.
Women in Computability Travel Grants
We are very happy to announce that within the framework of the Women in Computability programme sponsored by ACM-W we are able to offer four grants of up to 250 EUR for junior female researchers who want to participate in CiE 2020.
Applications for this grant should be sent to johanna.franklin@gmail.com, before April 30, 2020 and include a short cv (at most 2 pages) and contact information for an academic reference. Preference will be given to junior female researchers who are presenting a paper (including informal presentations) at CiE 2020.
2020-01-06
[Caml-list] MSFP 2020 - Final Call for Papers
Eighth Workshop on
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
Saturday 25th April 2020, Dublin, Ireland
A satellite workshop of ETAPS 2020
https://msfp-workshop.github.io/msfp2020/
** Deadline: 9th January (abstract), 16th January (paper) **
The eighth workshop on Mathematically Structured Functional
Programming is devoted to the derivation of functionality from
structure. It is a celebration of the direct impact of Theoretical
Computer Science on programs as we write them today. Modern
programming languages, and in particular functional languages, support
the direct expression of mathematical structures, equipping
programmers with tools of remarkable power and abstraction. Where
would Haskell be without monads? Functional reactive programming
without temporal logic? Call-by-push-value without adjunctions? The
list goes on. This workshop is a forum for researchers who seek to
reflect mathematical phenomena in data and control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth
workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The
fifth workshop was held in Grenoble, France, as part of ETAPS
2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven,
Netherlands, as part of ETAPS 2016. The seventh MSFP Workshop was held
in July 2018, in Oxford, UK, as part of FLoC 2018.
Important Dates:
================
Abstract deadline: 9th January (Thursday)
Paper deadline: 16th January (Thursday)
Notification: 27th February (Thursday)
Final version: 26th March (Thursday)
Workshop: 25th April (Saturday)
Invited Speakers:
=================
Pierre-Marie Pédrot - Inria Rennes-Bretagne-Atlantique, France
Satnam Singh - Google Research, USA
Program Committee:
==================
Stephanie Balzer - CMU, USA
Kwanghoon Choi - Chonnam, South Korea
Ralf Hinze - Kaiserslautern, Germany
Marie Kerjean - Inria Nantes, France
Sam Lindley - Edinburgh and Imperial, UK (co-chair)
Max New - Northeastern, USA (co-chair)
Fredrik Nordvall-Forsberg - Strathclyde, UK
Alberto Pardo - Montevideo, Uruguay
Exequiel Rivas Gadda - Inria Paris, France
Claudio Russo - DFINITY, UK
Tarmo Uustalu - Reykjavik, Iceland
Nicolas Wu - Imperial, UK
Maaike Zwart - Oxford, UK
Submission:
===========
Submissions are welcomed on, but by no means restricted to, topics
such as:
structured effectful computation
structured recursion
structured corecursion
structured tree and graph operations
structured syntax with variable binding
structured datatype-genericity
structured search
structured representations of functions
structured quantum computation
structure directed optimizations
structured types
structure derived from programs and data
Please contact the programme chairs Sam Lindley (Sam.Lindley@ed.ac.uk)
and Max New (maxnew@ccs.neu.edu) if you have any questions about the
scope of the workshop.
We accept two categories of submission: full papers of no more than 15
pages that will appear in the proceedings, and extended abstracts of
no more than 2 pages that we will post on the website, but which do
not constitute formal publications and will not appear in the
proceedings. References and appendices are not included in page
limits. Appendices may not be read by reviewers.
Submissions must report previously unpublished work and not be
submitted concurrently to another conference with refereed
proceedings. Accepted papers must be presented at the workshop by one
of the authors. The proceedings will be published under the auspices
of EPTCS with a Creative Commons license.
A short abstract should be submitted a week in advance of the paper
deadline (for both full paper and extended abstract submissions).
We are using EasyChair to manage submissions. To submit a paper, use
this link:
https://easychair.org/conferences/?conf=msfp2020
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
MATHEMATICALLY STRUCTURED FUNCTIONAL PROGRAMMING
Saturday 25th April 2020, Dublin, Ireland
A satellite workshop of ETAPS 2020
https://msfp-workshop.github.io/msfp2020/
** Deadline: 9th January (abstract), 16th January (paper) **
The eighth workshop on Mathematically Structured Functional
Programming is devoted to the derivation of functionality from
structure. It is a celebration of the direct impact of Theoretical
Computer Science on programs as we write them today. Modern
programming languages, and in particular functional languages, support
the direct expression of mathematical structures, equipping
programmers with tools of remarkable power and abstraction. Where
would Haskell be without monads? Functional reactive programming
without temporal logic? Call-by-push-value without adjunctions? The
list goes on. This workshop is a forum for researchers who seek to
reflect mathematical phenomena in data and control.
The first MSFP workshop was held in Kuressaare, Estonia, in July 2006,
affiliated with MPC 2006 and AMAST 2006. The second MSFP workshop was
held in Reykjavik, Iceland as part of ICALP 2008. The third MSFP
workshop was held in Baltimore, USA, as part of ICFP 2010. The fourth
workshop was held in Tallinn, Estonia, as part of ETAPS 2012. The
fifth workshop was held in Grenoble, France, as part of ETAPS
2014. The sixth MSFP Workshop was held in April 2016, in Eindhoven,
Netherlands, as part of ETAPS 2016. The seventh MSFP Workshop was held
in July 2018, in Oxford, UK, as part of FLoC 2018.
Important Dates:
================
Abstract deadline: 9th January (Thursday)
Paper deadline: 16th January (Thursday)
Notification: 27th February (Thursday)
Final version: 26th March (Thursday)
Workshop: 25th April (Saturday)
Invited Speakers:
=================
Pierre-Marie Pédrot - Inria Rennes-Bretagne-Atlantique, France
Satnam Singh - Google Research, USA
Program Committee:
==================
Stephanie Balzer - CMU, USA
Kwanghoon Choi - Chonnam, South Korea
Ralf Hinze - Kaiserslautern, Germany
Marie Kerjean - Inria Nantes, France
Sam Lindley - Edinburgh and Imperial, UK (co-chair)
Max New - Northeastern, USA (co-chair)
Fredrik Nordvall-Forsberg - Strathclyde, UK
Alberto Pardo - Montevideo, Uruguay
Exequiel Rivas Gadda - Inria Paris, France
Claudio Russo - DFINITY, UK
Tarmo Uustalu - Reykjavik, Iceland
Nicolas Wu - Imperial, UK
Maaike Zwart - Oxford, UK
Submission:
===========
Submissions are welcomed on, but by no means restricted to, topics
such as:
structured effectful computation
structured recursion
structured corecursion
structured tree and graph operations
structured syntax with variable binding
structured datatype-genericity
structured search
structured representations of functions
structured quantum computation
structure directed optimizations
structured types
structure derived from programs and data
Please contact the programme chairs Sam Lindley (Sam.Lindley@ed.ac.uk)
and Max New (maxnew@ccs.neu.edu) if you have any questions about the
scope of the workshop.
We accept two categories of submission: full papers of no more than 15
pages that will appear in the proceedings, and extended abstracts of
no more than 2 pages that we will post on the website, but which do
not constitute formal publications and will not appear in the
proceedings. References and appendices are not included in page
limits. Appendices may not be read by reviewers.
Submissions must report previously unpublished work and not be
submitted concurrently to another conference with refereed
proceedings. Accepted papers must be presented at the workshop by one
of the authors. The proceedings will be published under the auspices
of EPTCS with a Creative Commons license.
A short abstract should be submitted a week in advance of the paper
deadline (for both full paper and extended abstract submissions).
We are using EasyChair to manage submissions. To submit a paper, use
this link:
https://easychair.org/conferences/?conf=msfp2020
--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.
2020-01-04
[Caml-list] Call for Participation: The AAAI-20 Workshop on Privacy-Preserving Artificial Intelligence
Apologies for cross-posting - Please forward to anybody who might be interested
Invited Speakers
The AAAI-20 Workshop on Privacy-Preserving Artificial Intelligence [Call for Participation]
Workshop URL: https://www2.isye.gatech.edu/~fferdinando3/cfp/PPAI20
Registration URL: https://aaai.org/Conferences/AAAI-20/registration/
Online Registration Deadline: January 10, 2020
Location: AAAI 2020 - Hilton New York Midtown, New York, NY, USA
Date: February 7, 2020 (Full day)
Scope
The availability of massive amounts of data, coupled with high-performance cloud computing platforms, has driven significant progress in artificial intelligence and, in particular, machine learning and optimization. Indeed, much scientific and technological growth in recent years, including in computer vision, natural language processing, transportation, and health, has been driven by large-scale data sets which provide a strong basis to improve existing algorithms and develop new ones. However, due to their large-scale and longitudinal collection, archiving these data sets raise significant privacy concerns. They often reveal sensitive personal information that can be exploited, without the knowledge and/or consent of the involved individuals, for various purposes including monitoring, discrimination, and illegal activities.
The goal of the AAAI-20 Workshop on Privacy-Preserving Artificial Intelligence is to provide a platform for researchers to discuss problems and present solutions related to privacy issues arising within AI applications. The workshop will focus on both theoretical and practical challenges arising in the design of privacy-preserving AI systems and algorithms. It will place particular emphasis on algorithmic approaches to protect data privacy in the context of learning, optimization, and decision making that raise fundamental challenges for existing technologies. Additionally, it will welcome algorithms and frameworks to release privacy-preserving benchmarks and datasets.
Technical Program
The goal of the AAAI-20 Workshop on Privacy-Preserving Artificial Intelligence is to provide a platform for researchers to discuss problems and present solutions related to privacy issues arising within AI applications. The workshop will focus on both theoretical and practical challenges arising in the design of privacy-preserving AI systems and algorithms. It will place particular emphasis on algorithmic approaches to protect data privacy in the context of learning, optimization, and decision making that raise fundamental challenges for existing technologies. Additionally, it will welcome algorithms and frameworks to release privacy-preserving benchmarks and datasets.
Technical Program
• 8:45 - 9:00: Poster Setup and Opening Statement
• 9:00 - 9:45: Invited Talk: Catuscia Palamidessi
• 9:45 - 10:30: Session I
Session Chair: TBA
• Gilie Gefen, Omer Ben-Porat, Moshe Tennenholtz and Elad Yom-Tov.
• 9:00 - 9:45: Invited Talk: Catuscia Palamidessi
• 9:45 - 10:30: Session I
Session Chair: TBA
• Gilie Gefen, Omer Ben-Porat, Moshe Tennenholtz and Elad Yom-Tov.
Privacy, altruism, and experience: Estimating the perceived value of Internet data for medical uses.
• Reza Shokri, Martin Strobel and Yair Zick.
Exploiting Transparency Measures for Membership Inference: a Cautionary Tale.
• Shubhankar Mohapatra, Xi He, Gautam Kamath and Om Thakkar.
Diffindo! Differentially Private Learning with Noisy Labels.
• 10:30 - 11:00: Break and Poster Session
• 11:00 - 11:45: Invited Talk: Boi Faltings
• 11:45 - 12:30: Poster Session
• 12:30 - 14:00: Lunch (not sponsored)
• 14:00 - 14:45: Invited Talk: Aleksandar Nikolov
• 14:45 - 15:30: Session II
Session Chair: TBA
• Kai Wen Wang, Travis Dick and Maria-Florina Balcan.
Scalable and provably accurate algorithms for differentially private distributed decision tree learning.
• Chaitali Ashok Choudhary, Martine De Cock, Rafael Dowsley, Anderson Nascimento and Davis Railsback.
Secure Training of Extra Trees Classifiers over Continuous Data.
• Dominik Fay, Jens Sjölund and Tobias J. Oechtering.
Private Learning for High-Dimensional Targets with PATE.
• 15:30 - 16:00: Break and Poster Session
• 16:00 - 17:00: Poster Session
• 17:00 - 18:00: Panel Discussion
• Reza Shokri, Martin Strobel and Yair Zick.
Exploiting Transparency Measures for Membership Inference: a Cautionary Tale.
• Shubhankar Mohapatra, Xi He, Gautam Kamath and Om Thakkar.
Diffindo! Differentially Private Learning with Noisy Labels.
• 10:30 - 11:00: Break and Poster Session
• 11:00 - 11:45: Invited Talk: Boi Faltings
• 11:45 - 12:30: Poster Session
• 12:30 - 14:00: Lunch (not sponsored)
• 14:00 - 14:45: Invited Talk: Aleksandar Nikolov
• 14:45 - 15:30: Session II
Session Chair: TBA
• Kai Wen Wang, Travis Dick and Maria-Florina Balcan.
Scalable and provably accurate algorithms for differentially private distributed decision tree learning.
• Chaitali Ashok Choudhary, Martine De Cock, Rafael Dowsley, Anderson Nascimento and Davis Railsback.
Secure Training of Extra Trees Classifiers over Continuous Data.
• Dominik Fay, Jens Sjölund and Tobias J. Oechtering.
Private Learning for High-Dimensional Targets with PATE.
• 15:30 - 16:00: Break and Poster Session
• 16:00 - 17:00: Poster Session
• 17:00 - 18:00: Panel Discussion
Accepted Poster Presentations
• Qiu Yuchen, Yuanyuan Qiao, Aimin Zhang and Jie Yang
Residence and Workplace Recovery: User Privacy Risk in Mobility Data
Residence and Workplace Recovery: User Privacy Risk in Mobility Data
• Hanten Chang and Hiroyasu Ando
Privacy Preserving Data Sharing by Integrating Perturbed Distance Matrices
Privacy Preserving Data Sharing by Integrating Perturbed Distance Matrices
• Shreya Sharma, Xing Chaoping and Yang Liu
Privacy-Preserving Deep Learning with SPDZ
Privacy-Preserving Deep Learning with SPDZ
• Liyue Fan
A Survey of Differentially Private Generative Adversarial Networks
A Survey of Differentially Private Generative Adversarial Networks
• Colin Wan, Zheng Li, Alicia Guo and Yue Zhao
SynC: A Unified Framework for Generating Synthetic Population with Gaussian Copula
SynC: A Unified Framework for Generating Synthetic Population with Gaussian Copula
• Ashish Dandekar, Debabrota Basu and Stephane Bressan
Differential Privacy at Risk: Bridging Randomness and Privacy Budget
Differential Privacy at Risk: Bridging Randomness and Privacy Budget
• Ulrich Aïvodji, Sébastien Gambs and Timon Ther
GAMIN: An Adversarial Approach to Black-Box Model Inversion
GAMIN: An Adversarial Approach to Black-Box Model Inversion
• Longfei Zheng, Chaochao Chen, Yingting Liu, Bingzhe Wu, Xibin Wu, Li Wang, Lei Wang and Jun Zhou
Industrial Scale Privacy Preserving Deep Neural Network
Industrial Scale Privacy Preserving Deep Neural Network
• Yingting Liu, Chaochao Chen, Longfei Zheng, Li Wang and Jun Zhou
Privacy Preserving PCA for Multiparty Modeling
Privacy Preserving PCA for Multiparty Modeling
• Clémence Mauger, Gaël Le Mahec and Gilles Dequen
Modeling and Evaluation of k-anonymization Metrics
Modeling and Evaluation of k-anonymization Metrics
• Aleksei Triastcyn and Boi Faltings
Bayesian Differential Privacy for Machine Learning
Bayesian Differential Privacy for Machine Learning
• Himanshu Arora
Guided PATE for Scalable Learning
Guided PATE for Scalable Learning
• Adam Richardson, Aris Filos-Ratsikas, Ljubomir Rokvic and Boi Faltings
Privately Computing Influence in Regression Models
Privately Computing Influence in Regression Models
• Hui Hu and Chao Lan
Inference Attack and Defense Mechanisms on the Distributed Private Fair Machine Learning Framework
Inference Attack and Defense Mechanisms on the Distributed Private Fair Machine Learning Framework
• Yulin Zhang and Dylan Shell
Plans that Remain Private Even in Hindsight
Plans that Remain Private Even in Hindsight
• Junhong Cheng, Wenyan Liu, Xiaoling Wang, Xingjian Lu, Jing Feng and Yi Li
Adaptive Distributed Differential Privacy with SGD
Adaptive Distributed Differential Privacy with SGD
Invited Speakers
· Boi Faltings (EPFL)
· Aleksandar Nikolov (University of Toronto)
· Catuscia Palamidessi (INRIA)
Workshop Committee
· Aleksandar Nikolov (University of Toronto)
· Catuscia Palamidessi (INRIA)
Workshop Committee
· Aws Albarghouthi - University of Wisconsin-Madison
· Carsten Baum - Bar Ilan University
· Aurélien Bellet - INRIA
· Elette Boyle - Technion
· Mark Bun - Boston University
· Kamalika Chaudhuri - University of California San Diego
· Graham Cormode - The University of Warwick
· Marco Gaboardi - Boston University
· Antti Honkela - University of Helsinki
· Peter Kairouz - Google AI
· Kim Laine - Microsoft
· Audra McMillan - Northeastern University
· Sebastian Meiser - University College London
· Ilya Mironov - Google
· Aleksandar Nikolov - University of Toronto
· Kobbi Nissim - Georgetown University
· Catuscia Palamidessi - INRIA
· Reza Shokri - National University of Singapore
· Jonathan Ullman - Northeastern University
· Xiao Wang - Northwestern University
Workshop Chairs
· Ferdinando Fioretto (Syracuse University)
· Pascal Van Hentenryck (Georgia Institute of Technology)
· Rachel Cummings (Georgia Institute of Technology)
· Carsten Baum - Bar Ilan University
· Aurélien Bellet - INRIA
· Elette Boyle - Technion
· Mark Bun - Boston University
· Kamalika Chaudhuri - University of California San Diego
· Graham Cormode - The University of Warwick
· Marco Gaboardi - Boston University
· Antti Honkela - University of Helsinki
· Peter Kairouz - Google AI
· Kim Laine - Microsoft
· Audra McMillan - Northeastern University
· Sebastian Meiser - University College London
· Ilya Mironov - Google
· Aleksandar Nikolov - University of Toronto
· Kobbi Nissim - Georgetown University
· Catuscia Palamidessi - INRIA
· Reza Shokri - National University of Singapore
· Jonathan Ullman - Northeastern University
· Xiao Wang - Northwestern University
Workshop Chairs
· Ferdinando Fioretto (Syracuse University)
· Pascal Van Hentenryck (Georgia Institute of Technology)
· Rachel Cummings (Georgia Institute of Technology)
Subscribe to:
Posts (Atom)