[TYPES/announce] CFP: Twenty-second European Symposium on Research in Computer Security (ESORICS 2017)

[Cristina Alcaraz]

[ The Types Forum (announcements only),
http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


*** Apologies for multiple copies ***

C a l l F o r P a p e r s

Twenty-second European Symposium on Research in Computer Security 
(ESORICS 2017)


Oslo, Norway -- September  11-15, 2017

WWW: https://www.ntnu.edu/web/esorics2017/



Overview

ESORICS is the annual European research event in Computer Security. The 
Symposium started in 1990 and has been held in several European 
countries, attracting a wide international audience from both the 
academic and industrial communities. Papers offering novel research 
contributions in computer security are solicited for submission to the 
Symposium. The primary focus is on original, high quality, unpublished 
research and implementation experiences. We encourage submissions of 
papers discussing industrial research and development.



Important Dates

* Paper submission deadline: April 19, 2017
* Notification to authors: June 16, 2016
* Camera ready due: June 26, 2016

Topics of Interest

Topics of interest include, but are not limited to:
* access control
* accountability
* ad hoc networks
* anonymity
* applied cryptography
* authentication
* biometrics
* data and computation integrity
* database security
* data protection
* digital content protection
* digital forensics
* distributed systems security
* embedded systems security
* inference control
* information hiding
* identity management
* information flow control
* information security governance and management
* intrusion detection
* formal security methods
* language-based security
* network security
* phishing and spam prevention
* privacy
* privacy preserving data mining
* risk analysis and management
* secure electronic voting
* security architectures
* security economics
* security metrics
* security models
* security and privacy for big data
* security and privacy in cloud scenarios
* security and privacy in complex systems
* security and privacy in content centric networking
* security and privacy in crowdsourcing
* security and privacy in the IoT
* security and privacy in location services
* security and privacy for mobile code
* security and privacy in pervasive / ubiquitous computing
* security and privacy policies
* security and privacy in social networks
* security and privacy in web services
* security and privacy in cyber-physical systems
* security, privacy and resilience in critical infrastructures
* security verification
* software security
* systems security
* trust models and management
* trustworthy user devices
* usable security and privacy
* web security
* wireless security


Paper Submission Guidelines

Submissions must be made through EasyChair at:
https://easychair.org/conferences/?conf=esorics2017

Submitted papers must not substantially overlap with papers that have 
been published or that are simultaneously submitted to a journal or a 
conference/workshop with proceedings. The symposium proceedings will be 
published by Springer in the Lecture Notes in Computer Science series 
(LNCS).


All submissions should follow the LNCS template from the time they are 
submitted. Submitted papers should be at most 16 pages (using 10-point 
font), excluding the bibliography and well-marked appendices, and at 
most 20 pages total. Committee members are not required to read the 
appendices, so the paper should be intelligible without them. All 
submissions must be written in English. Submissions are to be made to 
the Submission web site. Only pdf files will be accepted.


Submissions not meeting these guidelines risk rejection without 
consideration of their merits. Authors of accepted papers must guarantee 
that their papers will be presented at the conference.


Papers must be received by the aforementioned dates, 11:59 p.m. American 
Samoa time (UTC-11).



Organisation Committee

General Chairs:

* Einar Snekkenes, Norwegian University of Science and Technology 
(NTNU), Norway.


Organization Chair:

* Laura Georg, Norwegian University of Science and Technology (NTNU), 
Norway.


Workshop Chair:

* Sokratis Katsikas, Norwegian University of Science and Technology 
(NTNU), Norway.


Program Committee Chairs:

* Dieter Gollman, Technische Universität Hamburg-Harburg, Germany
* Simon Foley, IMT Atlantique, France

Program Committee:
Gail-Joon Ahn, Arizona State University, USA
Alessandro Armando, University of Genoa, Italy
Michael Backes, Saarland University, Germany
Giampaolo Bella, Università degli studi di Catania, Italy
Elisa Bertino, Purdue University, USA
Carlo Blundo, Università degli studi di Salerno, Italy
Rainer Böhme, University 

[TYPES/announce] [fm-announcements] ISSTA 2017 Demonstrations - Call for Papers

[Havelund, Klaus (348B)]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


ISSTA 2017 Demonstrations

  http://conf.researchr.org/track/issta-2017/issta-2017-demos

Call for Papers

The ACM SIGSOFT International Symposium on Software Testing and
Analysis (ISSTA) 2017 Demonstrations Track serves as a venue for
publishing and presenting advances in software testing and analysis
tools that aid either practice, research, or both. Submissions may
describe early prototypes of tools, mature tools, and everything
inbetween. To help disseminate tools to the community, we encourage
submissions describing previously unpublished tools whose underlying
techniques may have already been published.

Highlighting scientific contributions through concrete artifacts is a
critical supplement to the traditional research papers published at
software engineering venues, including ISSTA. A demonstration provides
the opportunity to communicate how the scientific approach has been
implemented or how a specific hypothesis has been assessed, including
implementation and usage details, data models and representations, and
APIs for tool and data access. Authors of regular research papers at
ISSTA or other conferences are thus also encouraged to submit an
accompanying demonstration paper. However, the demonstration papers
must be original, and the tools must not have been previously
demonstrated or be concurrently under review at ISSTA or at another
venue.

The tool demonstrations must communicate clearly the following information:

the toolís envisioned users,
the software testing and analysis challenge(s) the tool addresses,
how the tool is used,
either results of conducted validation studies or the design of planned 
studies.

Evaluation

Each submission will be reviewed by at least three members of the 
demonstrations selection committee. The evaluation criteria include:

the relevance of the proposed demonstration to the ISSTA audience,
the technical soundness of the demonstrated tool,
the originality of the underlying ideas,
the quality of its presentation,
the comparison to related work.

How to Submit

Submissions must conform to the ACM Conference Format. A demonstration
submission may not exceed four pages, including all text, figures, and
references. A submission may not have been previously published in a
demonstration form. The paper submission must be in PDF. The
Demonstrations track will be using the single-blind reviewing model,
so the submitted PDFs should identify the authors.

Submit your papers via the EasyChair ISSTA Demonstrations 2017
submission website by May 2, 2017, 23:59:59 AoE.  Important Dates:
(there will be no extensions)

Submission deadline: May 2, 2017, 23:59:59 AoE.
Notification date: May 20, 2017
Camera-ready version deadline: May 27, 2017

Organization

For further information, please email the chairs at isstatools2...@easychair.org
Co-Chairs:

Yuriy Brun, University of Massachusetts, Amherst
Neha Rungta, Amazon Web Services, Inc.

Program Committee:

Ivan Beschastnikh, University of British Columbia
Milos Gligoric, The University of Texas at Austin
Jeff Huang, Texas A University
Claire Le Goues, Carnegie Mellon University
Eric Mercer, Brigham Young University
Suzette Person, University of NebraskañLincoln
Justyna Petke, University College London
Federica Sarro, University College London
Elena Sherman, Boise State University
Kathryn T. Stolee, North Carolina State University
Oksana Tkachuk, NASAís Ames Research Center



---
To opt-out from this mailing list, send an email to

fm-announcements-requ...@lists.nasa.gov

with the word 'unsubscribe' as subject or in the body. You can also make the 
request by contacting

fm-announcements-ow...@lists.nasa.gov 

[TYPES/announce] FORMATS 2017 - Submission 21 April 2017

[Thao Dang]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


[ Apologies for cross posting ] 

FORMATS 2017 

15th International Conference on 

Formal Modeling and Analysis of Timed Systems 

First Call for Papers 

http://formats17.ulb.be 



FORMATS '17 takes place in Berlin, Germany, where it is part of QONFEST 

and is colocated with CONCUR'17 and QEST'17. 





Invited speakers 

-- 



Laurent Fribourg , LSV, Université Paris-Saclay 

Morten Bisgaard , GomSpace (co-sponsored with QEST) 

Hongseok Yang , Department of computer science, Oxford University (co-sponsored 
with CONCUR and QEST) 







Objectives 

-- 

Control and analysis of the timing of computations is crucial to many domains 
of system engineering, be it, e.g., for ensuring timely response to stimuli 
originating in an uncooperative environment, or for synchronising components in 
VLSI. Reflecting this broad scope, timing aspects of systems from a variety of 
domains have been treated independently by different communities in computer 
science and control. Researchers interested in semantics, verification and 
performance analysis study models such as timed automata and timed Petri nets, 
the digital design community focuses on propagation and switching delays, while 
designers of embedded controllers have to take account of the time taken by 
controllers to compute their responses after sampling the environment, as well 
as of the dynamics of the controlled process during this span. 



Timing-related questions in these separate disciplines do have their 
particularities. However, there is a growing awareness that there are basic 
problems (of both scientific and engineering level) that are common to all of 
them. In particular, all these sub-disciplines treat systems whose behaviour 
depends upon combinations of logical and temporal constraints; namely, 
constraints on the temporal distances between occurrences of successive events. 
Often, these constraints cannot be separated, as the intrinsic dynamics of 
processes couples them, necessitating models, methods, and tools facilitating 
their combined analysis. Reflecting this, FORMATS '17 promotes submissions on 
hybrid discrete-continuous systems, and will promote a special session on this 
topic. 





Topics 

-- 

The aim of FORMATS is to promote the study of fundamental and practical aspects 
of timed systems, and to bring together researchers from different disciplines 
that share interests in modelling and analysis of timed systems and, as a 
generalisation, of hybrid systems. Typical topics include (but are not limited 
to): 



* Foundations and Semantics : 

Theoretical foundations of timed systems and languages; new models and logics 
or analysis and comparison of existing models (like automata, Petri nets, 
max-plus models, network calculus, or process algebras involving quantitative 
time; hybrid automata; probabilistic automata and logics). 



* Methods and Tools : 

Techniques, algorithms, data structures, and software tools for analysing or 
synthesising timed or hybrid systems and for resolving temporal constraints 
(scheduling, worst-case execution time analysis, optimisation, model checking, 
testing, constraint solving, etc.) 



* Applications : 

Adaptation and specialisation of timing technology in application domains in 
which timing plays an important role (real-time software, embedded control, 
hardware circuits, and problems of scheduling in manufacturing and 
telecommunications). 





Paper Submission 

 

FORMATS '17 solicits high-quality papers reporting research results and/or 
experience reports related to the topics mentioned above. Submitted papers must 
contain original, unpublished contributions, not submitted for publication 
elsewhere. The papers should be submitted electronically in PDF, following the 
Springer LNCS style guidelines. Submissions should not exceed 15 pages in 
length (not including the bibliography which is thus not restricted), but may 
be supplemented with a clearly marked appendix, which will be reviewed at the 
discretion of the program committee. 



Each paper will undergo a thorough review process. 



Papers are to be submitted electronically via the EasyChair online submission 
system, to be made available from the conference webpage. 



As traditional, publication of the proceedings of FORMATS '17 will be hosted by 
Springer in the Lecture Notes in Computer Science series. 





Important Dates 

--- 



Abstract Submission: 21 April, 2017 

Paper Submission: 28 April, 2017 

Notification: 10 June, 2017 

Final paper due: 30 June, 2017 

Conference: 5-7 September, 2017 





General Chair of QONFEST 

- 

Katinka Wolter, (FU Berlin) 

Uwe Nestermann, (TU Berlin) 





Program Committee Chairs 

 

Alessandro Abate (Oxford, UK) 

Gilles Geeraerts (ULB, BE) 





Publicity Chair 

--- 

[TYPES/announce] [Deadline Extended] CFP SBLP 2017: 21st Brazilian Symposium on Programming Languages

[Fabio Mascarenhas]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

SBLP 2017 is the 21st edition of the Brazilian Symposium on
Programming Languages, and will be held at Fortaleza, Ceará, on
September 2017, co-located with the other conferences of CBSoft 2017,
the Brazilian Conference on Software: Theory and Practice. SBLP is the
premier technical and scientific event in Brazil
in the area of programming languages, and aims to create a forum for
researchers, students and professionals to present and discuss
principles and innovations in the design, definition, analysis,
processing and implementation of programming languages.

# IMPORTANT DATES

Abstract submission: April 28th 2017 (extended)

Paper submission: May 5th 2017 (extended)

Author notification: June 23th 2017

Camera ready deadline: July 7th 2017

Authors are invited to submit original research on any relevant topic
which can be either in the form of regular or short papers.

# TOPICS

Topics of interest include, but are not limited to:

* Program generation and transformation, including domain-specific languages,
and model-driven development in the context of programming languages.
* Programming paradigms and styles, including functional, object-oriented,
aspect-oriented, scripting languages, real-time, service-oriented,
multithreaded,
parallel, and distributed programming.
* Formal semantics and theoretical foundations, including
denotational, operational, algebraic, and categorical.
* Program analysis and verification, including type systems, static analysis,
and abstract interpretation.
* Programming language design and implementation, including new
programming models, programming language environments, compilation,
and interpretation techniques.

# SUBMISSION AND PUBLICATION

All submissions will be peer-reviewed and judged on the basis of their
originality,
contribution to the field, technical and presentation quality, and
relevance to SBLP.
Papers may be written in Portuguese or English. Submission in English
is strongly
encouraged, since the symposium proceedings are indexed in the ACM
Digital Library.

Papers should fall into one of two different categories: regular
papers, which can be up to 8 pages long in ACM 2-column format
(available at
http://www.acm.org/publications/article-templates/proceedings-template.html),
or short papers, with up to 3 pages in the same format. Page limits include all
figures, references, and appendixes.

Short papers can discuss new ideas which are at an early stage of
development and which have not yet been thoroughly evaluated. We
encourage the submission of short papers reporting partial results of
on-going master dissertations or doctoral theses.

Papers must be submitted electronically (in PDF format) via the
Easychair System: http://www.easychair.org/conferences/?conf=sblp2017.

As in previous editions, after the conference, authors of selected
regular papers will be invited to submit an extended version of their
work to be considered for publication in a journal special issue.
Since 2009, selected papers of each SBLP edition are being published
in a special issue of Science of Computer Programming, by Elsevier.

# PROGRAM  CHAIR

Fabio Mascarenhas, Federal University of Rio de Janeiro

# PROGRAM COMMITTEE

Alberto Pardo, Universidad de la República
Alex Garcia, IME
Alvaro Moreira, Federal University of Rio Grande do Sul
Anamaria Martins Moreira, Federal University of Rio de Janeiro
André Murbach Maidl,PUC-PR
Andre Rauber-DuBois, Federal University of Pelotas
Carlos Camarão, Federal University of Minas Gerais
Christiano Braga, Fluminense Federal University
Fernando Castor, Federal University of Pernambuco
Fernando Pereira, Federal University of Minas Gerais
Francisco Heron Carvalho-Junior, Federal University of Ceara
Francisco Sant'Anna, UERJ
Gustavo Pinto, Federal Institute of Science and Technology of Pará
Hans-Wolfgang Loidl, Heriot-Watt University
Henrique Rebelo, Federal University of Pernambuco
Ismael Figueroa, Pontificia Universidad Católica de Valparaiso
João Ferreira, Teesside University
João Saraiva, University of Minho
João-Paulo Fernandes, University of Beira Interior
Leopoldo Teixeira, Federal University of Pernambuco
Louis-Noel Pouchet, University of California
Luis Barbosa, University of Minho
Manuel-A. Martins, University of Aveiro
Marcelo D'Amorim, Federal University of Pernambuco
Marcelo Maia, Federal University of Uberlândia
Mariza Bigonha, Federal University of Minas Gerais
Martin Musicante, Federal University of Rio Grande do Norte
Noemi Rodriguez, PUC-Rio
Rafael Lins, Federal University of Pernambuco
Roberto Bigonha, Federal University of Minas Gerais
Roberto Ierusalimschy, PUC-Rio
Rodrigo Geraldo, Federal University of Ouro Preto
Sandro Rigo, State University of Campinas
Sérgio Medeiros, Federal University of Rio Grande do Norte
Simon Thompson, University of Kent
Varmo Vene, University of Tartu
Wouter Swierstra, Utretch University
Yu 

[TYPES/announce] LFMTP 2017 - Call for papers

[Marino Miculan]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

CALL FOR PAPERS : deadline June 25, 2017

 LFMTP 2017: Logical Frameworks and Meta-Languages: Theory and Practice  


Affiliated with FSCD 2017
Oxford, United Kingdom, September 8, 2017

Conference website  http://lfmtp.org/workshops/2017/home.shtml
Submission link https://easychair.org/conferences/?conf=lfmtp2017

** Important dates:

Abstract registration deadline: June 18, 2017
Submission deadline: June 25, 2017
Notification to authors: July 30, 2017
Final version deadline: August 13, 2017


** Description

Logical frameworks and meta-languages form a common substrate for representing, 
implementing, and reasoning about a wide variety of deductive systems of 
interest in logic and computer science. Their design and implementation on the 
one hand and their use in reasoning tasks ranging from the correctness of 
software to the properties of formal computational systems on the other hand 
have been the focus of considerable research over the last three decades.
This workshop brings together designers, implementors, and practitioners to 
discuss various aspects impinging on the structure and utility of logical 
frameworks, including the treatment of variable bindings, inductive and 
co-inductive reasoning techniques, and the expressivity and lucidity of the 
reasoning process.

LFMTP 2017 will provide researchers a forum to present state-of-the-art 
techniques and discuss progress in areas such as the following:
- Encoding and reasoning about the meta-theory of programming languages and 
related formally specified systems.
- Theoretical and practical issues concerning the treatment of variable 
binding, especially the representation of, and reasoning about, datatypes 
defined from binding signatures.
- Logical treatments of inductive and co-inductive definitions and associated 
reasoning techniques.
- New theory contributions such as canonical and substructural frameworks, 
contextual frameworks, proof-theoretic foundations supporting binders, 
functional programming over logical frameworks, or homotopy type theory.
- Systematic translation, combination, and integration of logics or theorem 
prover libraries.
- Applications of logical frameworks, e.g. in certification and guarantee of 
security properties.
- Techniques for programming with binders in functional programming languages 
such as Haskell, OCaml, or Agda and logic programming languages such as lambda 
Prolog or Alpha-Prolog.

LFMTP 2017 will be also the occasion to celebrate the 70th birthday of Randy 
Pollack, author of the LEGO proof assistant and many other contributions to 
this field.


** Submission Guidelines

The following paper categories are welcome:
- Full papers describing original research and not simultaneously submitted to 
another journal or conference. 
- Work-in-progress reports, in a broad sense. Those do not need to report fully 
polished research results, but should be interesting for the community at large.

Submitted papers should be in PDF, formatted using the ACM SIGCONF format. The 
page limit is 8 pages for full papers, and 4 pages for work-in-progress reports.
Submission link is at https://easychair.org/conferences/?conf=lfmtp2017


** Program Committee

Thorsten Altenkirch (University of Nottingham, UK)
Kaustuv Chaudhuri (INRIA, France)
Gilles Dowek (ENS Cachan, France)
Amy Felty (University of Ottawa, Canada)
Andrzej Filinski (University of Copenhagen, Denmark)
Marino Miculan (DiMI, University of Udine, Italy),  co-chair
Florian Rabe (Jacobs University Bremen, Germany), co-chair
Wilmer Ricciotti (LFCS, University of Edinburgh, UK)
Claudio Sacerdoti Coen (University of Bologna, Italy)
Kristina Sojakova (Carnegie Mellon University, USA)

** Organizing committee

Florian Rabe (Jacobs University Bremen, Germany)
Marino Miculan (DiMI, University of Udine, Italy)

** Contact
All questions about submissions should be emailed to f.r...@jacobs-university.de

[TYPES/announce] International School on Rewriting 2017: Second Call for Participation

[Raamsdonk, F. van]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]


Second Call for Participation

9th INTERNATIONAL SCHOOL ON REWRITING (ISR 2017) 

July 3-7, 2017, Eindhoven, The Netherlands 
http://www.win.tue.nl/~hzantema/isr.html

Early registration deadline: May 15, 2017 

The 9th International School on Rewriting (ISR 2017) is aimed at master 
and PhD students, researchers, and practitioners interested in the study 
of rewriting concepts and their applications.

The school features lectures by renowned researchers in rewriting, and is 
organized in two parallel tracks: the Basic Track and the Advanced Track.

The BASIC TRACK is intended for students who enter the field. 
The basic track can, if desired, be round off with an examination of 3EC.
The teachers of the Basic Track are

   Aart Middeldorp (University of Innsbruck)
   Sarah Winkler (University of Innsbruck)

The ADVANCED TRACK consists of eight shorter courses.
The (preliminary) program of the Advanced Track is available via the website
   http://www.win.tue.nl/~hzantema/isr.html
The teachers and courses of the Advanced Track are:

  Beniamino Accatoli (INRIA)
  The Complexity of Beta-Reduction

  Carsten Fuhs (University of London)
  Proving Program Termination via Term Rewriting

  Thomas Genet (IRISA, France)
  Tree Automata for Reachability in Rewriting

  Philippe Malbos (University of Lyon), and 
  Samuel Mimram (Ecole Polytechnique)
  Two-dimensional Rewriting Techniques and Applications

  Temur Kutsia (University of Linz)
  Solving Equational Problems: Matching and Unification

  Julian Nagele (University of Innsbruck), and 
  Vincent van Oostrom (University of Innsbruck)
  Commutation 

  Christian Sternagel (University of Innsbruck), and 
  René Thiemann (University of Innsbruck)
  Formalizing Rewriting in Isabelle

  Johannes Waldmann (RWTH Leipzig)
  Weighted Automata and Rewriting

Poster Session:
Every participant has the opportunity to participate in the Poster Session.
The posters will be shown during the school, 
and can be presented in the Poster Session on Wednesday.

Registration:
You can register for ISR 2017 by sending an email to h.zant...@tue.nl.
Please mention your full name, institution, and the track you wish to attend.
It is appreciated if you mention the subjects you are particularly interested 
in.

Registration fee:
The registration fee is 250 euro for early registrations (before May 15, 2017), 
and 300 euro for late registrations (starting May 16, 2107). Registrations 
includes access to the lectures, printed copies of or electronic access to 
material provided by the lecturers, coffee breaks and lunches on Monday-Friday, 
and the excursion and dinner on Wednesday.

If you have any questions, please feel free to contact the organisers:

Hans Zantema, email: h.zant...@tue.nl
Femke van Raamsdonk, email: f.van.raamsd...@vu.nl
Margje Mommers-Lenders, email: wsin...@tue.nl


International Schools on Rewriting are promoted
by the IFIP Working Group 1.6 Term Rewriting.

Rewriting is a branch of computer science whose origins go back
to the origins of computer science itself (with Thue, Church, Post,
and many other prominent researchers). It has strong links with
mathematics, algebra, and logic, and it is the basis of well-known
programming paradigms like functional and equational programming.
In these programming paradigms and corresponding languages, the notions
of reduction, pattern matching, confluence, termination, strategy,
etc., are essential. Rewriting provides a solid framework for
understanding, using, and teaching all these notions. Rewriting
techniques are also used in many other areas of software engineering
(scripting, prototyping, automated transformation of legacy systems,
refactoring, web services, etc.) Rewriting techniques play a relevant
role in computing research, education, and industry.

[TYPES/announce] POPL 2018 - call for Workshops and co-located Events

[Gaboardi, Marco]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

 CALL FOR WORKSHOPS AND CO-LOCATED EVENTS

 POPL 2018

   45th ACM SIGPLAN-SIGACT  Symposium on
Principles of Programming Languages

 POPL: 8-13 January 2018
Affiliated Events: 8-9, 13 January 2018
  Los Angeles, USA

   http://popl18.sigplan.org

The 45th ACM SIGPLAN-SIGACT Symposium on Principles of Programming
Languages (POPL 2018) will be held in Los Angeles, USA.

POPL provides a forum for the discussion of fundamental principles
and important innovations in the design, definition, analysis,
transformation, implementation and verification of programming
languages, programming systems, and programming abstractions.

Events focusing on experimental and theoretical topics are welcome.

Proposals are invited for workshops and other events to be co-located
with POPL 2018. Events can either be sponsored by SIGPLAN
(http://acm.org/sigplan/) or supported through in-cooperation status.

Workshops should be more informal and focused than POPL itself,
include sessions that enable interaction among the workshop
attendees, and be fairly low cost. The preference is for one-day
workshops, but other schedules can also be considered.

-

Submission details 

   Deadline for submission:  15 May 2017
   Notification of acceptance:   5 June 2017

A workshop proposal should provide the following information.

• Name of the workshop.
• Duration of the workshop.
• Organizers: names, affiliation, contact information, brief (100 words) 
biography.
• A short description (150-200 words) of the topic.
• Event format: workshop; type of submissions if any; review process; results 
dissemination.
• Expected attendance and target audience.
• Potential PC members. 
• History of the workshop.

Proposal must be submitted in pdf or txt form by email to the workshop 
chair Marco Gaboardi (gaboa...@buffalo.edu).

-

Sponsorship vs in-cooperation status

Events can either be sponsored by SIGPLAN (http://acm.org/sigplan/) 
or supported through in-cooperation status.
Sponsored workshops are required to produce a final report after the
workshop has taken place that is suitable for publication in SIGPLAN
Notices. Further information about SIGPLAN sponsorship and
in-cooperation status of workshops is available here:

http://www.sigplan.org/Resources/Proposals/Cooperated
http://www.sigplan.org/Resources/Proposals/Sponsored

-

Selection committee

All submissions will be evaluated by a committee comprising the
following members of the POPL 2018 organizing committee, together with
the members of the SIGPLAN executive committee.

   Marco Gaboardi   University at Buffalo, SUNY Workshops chair
   Ranjit Jhala University of California, San Diego General chair
   Andrew Myers Cornell University  Program chair

-

Further information

Any query regarding POPL 2018 co-located event proposals should be
addressed to the workshops chair, Marco Gaboardi (gaboa...@buffalo.edu).

[TYPES/announce] FLoC 2018 Call for Workshops

[Gethin Norman]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

[apologies for cross posting]

FLoC 2018 — The 2018 Federated Logic Conference
6-19 July 2018
Oxford, England UK
http://www.floc2018.org/

CALL FOR WORKSHOPS

The Seventh Federated Logic Conference (FLoC 2018) will host the following nine 
conferences and affiliated workshops.

CAV (30th International Conference on Computer Aided Verification)
http://i-cav.org/
Workshop chair: Hana Chockler hana.chock...@kcl.ac.uk

CSF (31st IEEE Computer Security Foundations Symposium) 
http://www.ieee-security.org/CSFWweb/
Workshop chair: Cas Cremers cas.crem...@cs.ox.ac.uk

FM (23rd International Symposium on Formal Methods)
http://www.fmeurope.org/?page_id=221
Workshop chair: Helen Treharne h.treha...@surrey.ac.uk

FSCD (3rd International Conference on Formal Structures for Computation and 
Deduction) 
http://fscdconference.org/
Workshop chair: Paula Severi pg...@le.ac.uk

ICLP (35th International Conference on Logic Programming) 
https://www.cs.nmsu.edu/ALP/conferences/
Workshop chair: Stefan Woltran wolt...@dbai.tuwien.ac.at

IJCAR (International Joint Conference on Automated Reasoning)
http://www.ijcar.org
Workshop chair: Alberto Griggio grig...@fbk.eu

ITP (9th International Conference on Interactive Theorem Proving) 
http://itp2017.cic.unb.br
Workshop chair: Assia Mahboubi assia.mahbo...@inria.fr

LICS (33rd Annual ACM/IEEE Symposium on Logic in Computer Science) 
http://lics.rwth-aachen.de/
Workshop chair: Patricia Bouyer bou...@lsv.ens-cachan.fr

SAT (21st International Conference on Theory and Applications of Satisfiability 
Testing) 
http://www.satisfiability.org
Workshop chair: Martina Seidl martina.se...@jku.at

SUBMISSION OF WORKSHOP PROPOSALS

Researchers and practitioners are invited to submit proposals for workshops on 
topics in the field of computer science, related to logic in the broad sense. 
Each workshop proposal must indicate one affiliated conference of FLoC 2018.

It is strongly suggested that prospective workshop organizers contact the 
relevant conference workshop chair before submitting a proposal.

Each proposal should consist of the following two parts.

1) A short scientific justification of the proposed topic, its significance, 
and the particular benefits of the workshop to the community, as well as a list 
of previous or related workshops (if relevant). 

2) An organisational part including:

 - contact information for the workshop organizers;
 - proposed affiliated conference;
 - estimate of the number of workshop participants;
 - proposed format and agenda (e.g. paper presentations, tutorials, demo 
sessions, etc.)
 - potential invited speakers;
 - procedures for selecting papers and participants;
 - plans for dissemination, if any (e.g. a journal special issue);
 - duration (which may vary from one day to two days);
 - preferred period (pre, mid or post FLoC).
 
The FLoC Organizing Committee will determine the final list of accepted 
workshops based on the recommendations from the Workshop Chairs of the hosting 
conferences and availability of space and facilities.

Submission instructions will follow shortly from 
http://www.floc2018.org/workshops/

For further information on FLoC 2018 see http://www.floc2018.org

IMPORTANT DATES

Submission of workshop proposals deadline: June 19, 2017
Notification: July 31, 2017
Pre-FLoC workshops: Saturday & Sunday, July 7-8, 2018
Mid-FLoC workshops: Friday July 13, 2018
Post-FLoC workshops: Wednesday & Thursday, July 18-19, 2018

Note mid-FLoC workshops are expected be one day in duration, however we can 
consider two-day workshops under exceptional circumstance (details should be 
included in the proposal). 

CONTACT INFORMATION

Questions regarding proposals should be sent to the workshop chairs of the 
proposed affiliated conference. General questions should be sent to:
gethin.nor...@glasgow.ac.uk

FLoC 2018 WORKSHOP CHAIR
Gethin Norman
University of Glasgow

[TYPES/announce] LOLA 2017: Final call for talk proposals

[Matija Pretnar]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

FINAL CALL FOR TALK PROPOSALS


LOLA 2017: Syntax and Semantics of Low-Level Languages
==
Monday, 19 June 2017, Reykjavik, Iceland
A satellite workshop of LICS 2017
http://events.cs.bham.ac.uk/lola2017/


Important Dates
---

- Abstract submission: Wednesday, 19 April 2017
- Author notification: Monday, 1 May 2017
- Workshop: Monday, 19 June 2017


Invited Speakers


- Małgorzata Biernacka (University of Wroclaw)
- Damien Pous (CNRS, ENS Lyon)

Context
---

Since the late 1960s it has been known that tools and structures
arising in mathematical logic and proof theory can usefully be applied
to the design of high-level programming languages, and to the
development of reasoning principles for such languages. Yet low-level
languages, such as machine code, and the compilation of high-level
languages into low-level ones have traditionally been seen as having
little or no essential connection to logic.

However, a fundamental discovery of this past decade has been that
low-level languages are also governed by logical principles. From this
key observation has emerged an active and fascinating new research
area at the frontier of logic and computer science. The practically-
motivated design of logics reflecting the structure of low-level
languages (such as heaps, registers and code pointers) and low-level
properties of programs (such as resource usage) goes hand in hand with
some of the most advanced contemporary research in semantics and proof
theory, including classical realizability and forcing, double
orthogonality, parametricity, linear logic, game semantics,
uniformity, categorical semantics, explicit substitutions, abstract
machines, implicit complexity and resource bounded programming.

The LOLA workshop, affiliated with LICS 2017, will bring together
researchers interested in the relationships and connections between
logic and low-level languages and programs. Topics of interest
include, but are not limited to:

- Typed assembly languages
- Certified assembly programming
- Certified and certifying compilation
- Relaxed memory models
- Proof-carrying code
- Program optimization
- Modal logic and realizability in machine code
- Realizability and double orthogonality in assembly code
- Parametricity, modules and existential types
- General references, Kripke models and recursive types
- Continuations and concurrency
- Resource analysis and implicit complexity
- Closures and explicit substitutions
- Linear logic and separation logic
- Game semantics, abstract machines and hardware synthesis
- Monoidal and premonoidal categories, traces and effects


Submission
--

LOLA is an informal workshop aiming at a high degree of useful
interaction amongst the participants, welcoming proposals for talks on
work in progress, overviews of larger research programs, position
presentations, and short tutorials, as well as more traditional
research talks describing new results.

The program committee will select the workshop presentations from
submitted talk proposals, which may take the form either of a *two
page abstract* or of a longer (published or unpublished) paper
describing completed work.

Authors are invited to submit their contribution by April 19, 2017.
Abstracts must be written in English and be submitted as a single PDF
file at
[EasyChair](https://www.easychair.org/conferences/?conf=lola2017).

Submissions will undergo a lightweight review process and will be
judged on originality, relevance, interest and clarity. Submission
should describe novel works or works that have already appeared
elsewhere but that can stimulate the discussion between different
communities at the workshop.

The workshop will not have formal proceedings and is not intended to
preclude later publication at another venue.

Program Committee
-

- Beniamino Accattoli, INRIA
- Michael Greenberg, Pomona College
- Patricia Johann, Appalachian State University
- Ohad Kammar, University of Oxford
- Matija Pretnar, University of Ljubljana (co-chair)
- Nikos Tzevelekos, Queen Mary University of London
- Noam Zeilberger, University of Birmingham (co-chair)

[TYPES/announce] CID: information on a new research project

[Dieter Spreen]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

Dear moderator please forward this information about a new collaboration 
programme.


CID — Computing with Infinite Data

cid.uni-trier.de 


CID is a new international research project with about 20 participating 
institutions, mainly from Europe, but also from Chile, Japan, New Zealand, 
Russia, Singapore, South Africa, South Korea, and the USA. It is funded by the 
European Union as well as several national funding organisations, and is 
running for four years.

The joint research will study important aspects - both theoretical as well as 
applied - of computing with infinite objects. A central aim is laying the 
grounds for the generation of efficient and verified software in engineering 
applications. 

A prime example for infinite data is provided by the real numbers, most 
commonly conceived as infinite sequences of digits. Since the reals are 
fundamental in mathematics, any attempt to compute objects of mathematical 
interest has to be based on an implementation of real numbers. While most 
applications in science and engineering substitute the reals with floating 
point numbers of fixed finite precision and thus have to deal with truncation 
and rounding errors, the approach in this project is different: exact real 
numbers are taken as first-class citizens and while any computation can only 
exploit a finite portion of its input in finite time, increased precision is 
always available by continuing the computation process. We will refer to this 
mode of computing with real numbers as exact real arithmetic or ERA. These 
ideas are greatly generalised in Weihrauch’s type-two theory of effectivity 
which aims to represent infinite data of any kind as streams of finite data. 
This project aims to bring together the expertise of specialists in 
mathematics, logic, and computer science to push the frontiers of our 
theoretical and practical understanding of computing with infinite objects. 
Three overarching motivations drive the collaboration:  

Representation and representability. Elementary cardinality considerations tell 
us that it is not possible to represent arbitrary mathematical objects in a way 
that is accessible to computation. We will enlist expertise in topology, logic, 
and set theory, to address the question of which objects are representable and 
how they can be represented most efficiently.
Constructivity. Working in a constructive mathematical universe can greatly 
enhance our understanding of the link between computation and mathematical 
structure. Not only informs us which are the objects of relevance, it also 
allows us to devise algorithms from proofs.
Efficient implementation. The project also aims to make progress on concrete 
implementations. Theoretical insights from elsewhere will thus be tested in 
actual computer systems, while obstacles encountered in the latter will inform 
the direction of mathematical investigation.

The specific research objectives of this project are grouped together in three 
work packages:

WP1 — Foundations

This foundational study has two aims: (I) to compare two major models for 
computations with infinite objects, Markov computability and type-two theory of 
effectivity, and to obtain a better understanding of the first one in 
structural terms; and (II) to extend (effective) descriptive theory of sets and 
functions beyond its classical scope of Polish spaces.

A specific goal of (I) is to develop a characterisation of Markov computability 
in terms of Kolmogorov complexity. Objective II aims at extending Descriptive 
Set Theory to a Cartesian closed subcategory of Schroeder-Simpson-qcb-spaces, 
large enough to also contain non-countably based spaces, in particular, at 
devising specific (descriptive) complexity notions for qcb-spaces so to allow 
singling out a sufficiently large class of simply enough spaces. Further 
sub-goals are finding interesting well quasi-ordered substructures of the 
structure of Weihrauch degrees of multi-valued functions and exploring the 
interactions between the various notions of effectively presented spaces so as 
to identify the adequate ones.

WP2 — Exact computation in real analysis

In this investigation the connection between computability and important areas 
of applied mathematics such as dynamical systems, stochastic processes as well 
as differential equations will be explored. Moreover, the problem of 
algorithmic efficiency and computer realisations will be considered.

Research objectives are (I) to determine which long-term (asymptotic) 
properties of a dynamical system can be computed, at least in theory, and in a 
more refined manner, which ones can be computed given reasonable amount of 
resources such as time or memory; (II) to study in how much the theory of 
Kolmogorov complexity and algorithmic randomness applied to Brownian motion and 
other stochastic 

[TYPES/announce] SAS 2017 CFP: Extended Submission Deadline

[Urban Caterina]

[ The Types Forum (announcements only),
 http://lists.seas.upenn.edu/mailman/listinfo/types-announce ]

--

  SAS 2017

   24th Static Analysis Symposium

  New York City, NY, August 30th-September 1st, 2017

http://staticanalysis.org/sas2017

--

OBJECTIVE
Static Analysis is widely recognized as a fundamental tool for program
verification,   bug   detection,compiler   optimization,   program
understanding, and software maintenance. The series of Static Analysis
Symposia  has served  as the  primary  venue for  the presentation  of
theoretical, practical, and application advances in the area. The 24th
International Static Analysis Symposium, SAS 2017, will be held at New
York University, New  York City, NY, USA. Previous  symposia were held
in   Edinburgh,  Saint-Malo,   Munich,  Seattle,   Deauville,  Venice,
Perpignan,  Los  Angeles,  Valencia, Kongens  Lyngby,  Seoul,  London,
Verona,  San  Diego,  Madrid,  Paris,  Santa  Barbara,  Pisa,  Aachen,
Glasgow, and Namur.


TOPICS
The technical  program for SAS  2017 will consist of  invited lectures
and presentations  of refereed  papers. Contributions are  welcomed on
all aspects of static analysis, including, but not limited to:

- Abstract domains
- Abstract interpretation
- Automated deduction
- Data flow analysis
- Debugging
- Deductive methods
- Emerging applications
- Model checking
- Program optimization and transformation
- Program synthesis
- Program verification
- Security analysis
- Tool environments and architectures
- Theoretical frameworks
- Type checking

PAPER SUBMISSION
Submissions   can   address   any  programming   paradigm,   including
concurrent, constraint, functional, imperative, logic,
object-oriented,aspect,   multi-core,distributed,   andGPU
programming.  Papers  must  describe  original work,  be  written  and
presented in English,  and must not substantially  overlap with papers
that have  been published  or that are  simultaneously submitted  to a
journal or  a conference  with refereed proceedings.  Submitted papers
will be judged  on the basis of  significance, relevance, correctness,
originality, and clarity.  They should clearly identify  what has been
accomplished and why  it is significant. Paper  submissions should not
exceed 18 pages  in Springer's Lecture Notes in  Computer Science LNCS
format,  excluding bibliography  and  well-marked appendices.  Program
Committee members  are not required  to read the appendices,  and thus
papers  must be  intelligible  without them.  Submissions are  handled
online through easychair:
https://easychair.org/conferences/?conf=sas2017

ARTIFACT SUBMISSION
As in previous  years, we are encouraging authors to  submit a virtual
machine image  containing any  artifacts and evaluations  presented in
the paper. The  goal of the artifact submissions is  to strengthen our
field's  scientific approach  to  evaluations  and reproducibility  of
results. The virtual  machines will be archived on  a permanent Static
Analysis Symposium website to provide a record of past experiments and
tools,  allowing  future  research  to better  evaluate  and  contrast
existing work. Artifact submission is optional. We accept only virtual
machine images that can be processed with Virtual Box. Details on what
to submit  and how will be  sent to the corresponding  authors by mail
shortly after  the paper submission deadline.  The submitted artifacts
will  be used  by  the  program committee  as  a secondary  evaluation
criteria whose sole  purpose is to find  additional positive arguments
for the paper's acceptance.  Submissions without artifacts are welcome
and will not be penalized.

IMPORTANT DATES
- Abstract submission (extended): April 21, 2017 (anywhere on earth)
- Full paper submission (extended): April 27, 2017 (anywhere on earth)
- Artifact submission (extended): May 2, 2017 (anywhere on earth)
- Author notification: June 12, 2017
- Final version due: July 5, 2017
- Conference: August 30 - September 1, 2017

CONFERENCE VENUE
The conference  will be held  in the Forbes  Building of the  New York
University, 60 Fifth Avenue, New York City.

RADHIA COUSOT AWARD
Since 2014,  the program  committee of each  SAS conference  selects a
paper  for the  Radhia Cousot  Young Researcher  Best Paper  Award, in
memory of Radhia  Cousot, and her fundamental  contributions to static
analysis, as well as being one of the main promoters and organizers of
the SAS series of conferences.

SPECIAL ISSUE
Full versions of  a selection of accepted papers, to  be determined by
the  program  committee, will  be  invited  for submission  to  Formal
Methods in System Design journal.

INVITED SPEAKERS
Alex Aiken (Stanford University, USA)
Francesco Logozzo (Facebook, USA)
Peter Müller (ETH Zurich,