[TYPES/announce] Deadline Extension: Design and Analysis of Robust Systems (DARS 2019)

[Justin Hsu]

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

*Call for Abstracts*
*DARS 2019: 4th Workshop on the Design and Analysis of Robust Systems*
https://sites.google.com/view/dars2019/
Part of *CAV*  2019, New York, New York

*Description*
DARS 2019 is the 4th in an international workshop series dedicated to the
design and analysis of robust systems. Robustness refers to the ability of
a system to behave reliably in the presence of perturbation, either in the
system's dynamics and parameters, or irregularities in the system's
operating environment. This is particularly important in the context of
embedded systems that interact with a physical environment through sensors
and actuators, and communicate over wired or wireless networks. Such
systems are routinely subject to deviations arising from sensor or
actuation noise, quantization and sampling of data, uncertainty in the
physical environment, and delays or packet drops over unreliable network
channels. When deployed in safety critical applications, system robustness
in the presence of uncertainty is not just desirable, but crucial.
The goal of DARS is to foster dialogue and exchange of ideas and techniques
across several disciplines with an interest in robustness such as formal
verification, programming languages, fault-tolerance, control theory and
hybrid systems. Domains of interest include, but are not limited to:
reactive, timed, hybrid or probabilistic systems and programs, approximate
computing, fault tolerance of distributed systems, and robustness of neural
networks.
Topics of interest include (but are not limited to):

   - Specification languages for specifying qualitative and quantitative
   robustness
   - Runtime detection of non-robust conditions
   - Definitions of robustness, application-specific or more generic
   - Computationally tractable procedures for measuring robustness
   - Enforcing robustness of system integrations
   - Quantifying robustness for black-box systems
   - Robustness to adversarial/malicious attacks
   - Robustness in cyber-physical systems

*Workshop Format*
DARS is intended to be a forum for exchanging the latest scientific trends
between researchers and practitioners interested in various notions of
system robustness, application-specific or otherwise.  As a consequence,
the workshop will NOT have formal proceedings. We encourage submission of
abstracts that address any of the aforementioned topics of interest and
cover recently published results as well as work in progress.
*Submission instructions*
DARS solicits extended abstracts, which should be submitted via Easychair
at:

https://easychair.org/conferences/?conf=dars2019

Abstracts should be in PDF form, up to 3 pages in length, with 1-inch
margins and at least 10-point font size, and may contain up to three
figures. Abstracts should list the full names, affiliations, and contact
information of all authors. If you are interested in demonstrating a
technology you are working on at the workshop, including software tools,
please indicate so in your abstract submission.
Abstracts will be reviewed by the Program Committee, and will be accepted
for either an oral presentation or a poster. Accepted abstracts will be
posted to the workshop's website.
*Important Dates*

   -
*Submission deadline: May 1, 2019  (DEADLINE EXTENSION) *
   - *Notification: **May 24, 2019*
   - *Workshop:** July 13, 2019*

*Organizers and chairs*
Houssam Abbas , Oregon State
University, USA
Justin Hsu , University of Wisconsin-Madison, USA
*Technical Program Committee*
Houssam Abbas , Oregon State
University, USA
Md Ariful Islam ,
Texas Tech University
Stanley Bak , Safe Sky Analytics
Borzoo Bonakdarpour , Iowa State
University
Chuchu Fan , University of Illinois
Urbana-Champaign
Thomas Ferrère , IST Austria
Carlo A. Furia , Università della Svizzera
Italiana
Bardh Hoxha , Southern Illinois University
Radoslav Ivanov , University of
Pennsylvania
Justin Hsu , University of Wisconsin-Madison, USA
Soonho Kong , Toyota Research Institute
Dejan Ničković
,
Austrian Institute of Technology
Jan Otop , University
of Wrocław
Yash V Pant , University of Pennsylvania
Nicola Paoletti , Royal Holloway, University
of London
Corina S. Pasareanu 

[TYPES/announce] Deadline Extension : Structures and Deduction 2019, Dortmund June 29-30 (affiliated with FSCD)

[Pierre Clairambault]

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

*** DEADLINE EXTENSION : Structures and Deduction 2019 ***

SD’19: 5th Int. Workshop on Structures and Deduction 2019

Dortmund, June 29-30 2019 --- Affiliated with FSCD 2019

 Submission: ** April 23 **
 Notification: May 13

 Submission page: http://easychair.org/conferences/?conf=sd19
 Workshop page: http://anupamdas.com/sd19/
 FSCD 2019 page: http://easyconferences.eu/fscd2019/

SD’19 is the fifth in a series of workshops aiming to gather various
communities of structural proof theorists. As well as theoretical work
in the form of regular papers, we encourage submission of
implementations, tools and system descriptions.


*** Topics of interest ***

* Syntactic representations of proofs (e.g. sequent calculi, deep
inference, focusing)
* Combinatorial representations of proofs (e.g. proof nets)
* Algebraic representations of proofs (e.g. via game semantics or
category theory)
* Methods for proof manipulation and normal forms of proofs
* Formulas-as-types interpretations of proofs
* Computation and rewriting in proof search (e.g. deduction modulo or
cyclic proofs)
* Complexity theoretic aspects of proof representations


*** Invited Speakers ***

Andrea Aler Tubella (Umeå University)
Delia Kesner (Université Paris 7)
Revantha Ramanayake (TU Wien)
Thomas Seiller (CNRS, Université Paris 13)
(more TBA)


*** Programme Committee ***

David Cerna, Research Institute for Symbolic Computation, Austria.
Pierre Clairambault (co-chair), CNRS and Ecole Normale Supérieure de
Lyon, France.
Anupam Das (co-chair), University of Copenhagen, Denmark.
Alessio Guglielmi, University of Bath, UK.
Stepan Kuznetsov, Steklov Mathematical Institute of RAS, Russia.
Sonia Marin (co-chair), IT-University of Copenhagen, Denmark.
Guillaume Munch-Maccagnoni, Inria Bretagne, France.
Elaine Pimentel, Universidade Federal do Rio Grande do Norte, Brasil.
Benjamin Ralph, Inria Saclay, France.


*** Submission guidelines ***

We welcome submission of work that has already been published or
currently submitted to a journal or conference. The following submission
categories are welcome:

* Extended abstracts (up to 8 pages). Finished work, system
descriptions, surveys.
* Short abstracts (up to 4 pages). Work-in-progress, perspectives on
existing work.

The page limits above are only recommendations, there is no hard upper
or lower bound, within reason.

Please prepare your work using the EasyChair style files:

 http://www.easychair.org/publications/for_authors


*** Publication ***

We do not intend to have published proceedings, as we encourage people
to present work in progress, or material that is already submitted. If
there is a strong demand among the participants we may organise a
special issue of an open access journal for full papers.


*** Contact ***

We can be reached by email directly or via

 s...@easychair.org

The organisers.
Pierre Clairambault, Anupam Das, and Sonia Marin

[TYPES/announce] VTSA 2019 -- Call for applications

[Jun PANG]

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

UniGR Summer School on Verification Technology, Systems and
Applications (VTSA 2019)

July 1-5, 2019, Belval, Luxembourg

The summer school on verification technology, systems & applications
focuses on fundamental aspects of verification techniques, their
implementation, and their use for concrete applications. It is
organized by Inria Nancy, the Max-Planck-Institut für Informatik in
Saarbrücken, and the Universities of Liège and of Luxembourg, and will
take place at the University of Luxembourg, Belval Campus, Maison du
Savoir from July 1 to 5, 2019.


The following speakers have agreed to lecture at the school:

- Alexey Gotsman: Reasoning about data consistency in distributed systems
- Jochen Hoenicke: Software model checking with Ultimate
- Catalin Hritcu: Program verification with F*
- Marieke Huisman: Verification of concurrent and distributed software
- Cezary Kaliszyk: Artificial intelligence in theorem proving

Participation in the school is free to anybody holding at least a
bachelor degree or equivalent; it includes the lectures, coffee and
lunch breaks, and a school dinner. Attendance is limited to 40
participants. Please apply electronically by sending an email to
Soumya Paul (soumya.p...@uni.lu) including

- a one-page CV,
- an application letter explaining your interest in the school and
your experience in the area
- a copy of your bachelor certificate (or equivalent or a more
significant certificate)
- a short statement if you want to contribute to the student sessions

The deadline for application is May 10, 2019. Notification of
acceptance will be given by May 17, 2019.

Full details can be found on the school Web page at
https://www.mpi-inf.mpg.de/vtsa19

[TYPES/announce] Extended deadline - International Workshop on Confluence - April 22(a), April 29(p)

[Mauricio Ayala-Rincon]

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

Dear colleagues,

My apologies for multiple emails.

Mauricio.


--//////////////////////////--

 Final Call For Papers - EXTENDED DEADLINE 
(April 22 abs., April 29 p.)


    8th International Workshop on Confluence
   http://iwc2019.cic.unb.br
   June 28, 2019

Collocated with FSCD, June 24-30, 2019
--//////////////////////////--

The 8th International Workshop on Confluence (IWC 2019) aims at 
promoting further research in confluence and related properties. 
Confluence provides a general notion of determinism and has always been 
conceived as one of the central properties of rewriting. Recently there 
is a renewed interest in confluence research, resulting in new 
techniques, tool support, certification as well as new applications. The 
workshop aims at promoting further research in confluence and related 
properties.


Confluence relates to many topics of rewriting (completion, modularity, 
termination, commutation, etc.) and has been investigated in many 
formalisms of rewriting such as first-order rewriting, lambda-calculi, 
higher-order rewriting, constrained rewriting, conditional rewriting, 
etc. Recently there is a renewed interest in confluence research, 
resulting in new techniques, tool supports, certification as well as new 
applications.


TOPICS:

* confluence and related properties (unique normal forms, commutation, 
ground confluence)

* completion
* critical pair criteria
* decidability issues
* complexity issues
* system descriptions
* certification
* applications of confluence

The objective of this workshop is to bring together theoreticians and 
practitioners to promote new techniques and results, and to facilitate 
feedback on the implementation and application of such techniques and 
results in practice. IWC 2019 also aims to be a forum for presenting and 
discussing work in progress, and therefore to provide feedback to 
authors on their preliminary research.


IWC 2019 is a satellite workshop of Formal Structures for Computation 
and Deduction (FSCD'19) in Dortmund. Previous editions took place in 
Oxford (2018 and 2017), Obergurgl (2016), Berlin (2015), Vienna (2014), 
Eindhoven (2013) and Nagoya (2012).

More information about the workshop can be found in the home page of IWC.

SUBMISSIONS

We solicit short papers or extended abstracts of at most five pages. 
There will be no formal reviewing. In particular, we welcome short 
versions of recently published articles and papers submitted elsewhere. 
The program committee checks relevance and may provide additional 
feedback. The accepted papers will be made available electronically 
before the workshop. The page limit for papers is 5 pages in EasyChair 
style. Short papers or extended abstracts must be submitted 
electronically through the EasyChair system at:

https://www.easychair.org/conferences/?conf=iwc2019

EasyChair style:
http://easychair.org/publications/for_authors

IMPORTANT DATES

    Title and Abstract:      April 14, 2019 EXTENDED TO April 
22, 2019
    Paper Submission:    April 21, 2019   EXTENDED TO April 29, 
2019

    Notification to authors:     May 24, 2019
    Workshop date:   June 28, 2019

INVITED SPEAKERS

    Cynthia Kop Radboud Universiteit Nijmegen
    Francisco Durán Universidad de Málaga

PROGRAM COMMITTEE

    Sandra Alves (Universidade de Porto)
    Mauricio Ayala-Rincón (Universidade de Brasília) - co-chair
    Cyrille Chenavier (INRIA Lille)
    Alejandro Díaz-Caro (Universidad Nacional de Quilmes & ICC/UBA-CONICET)
    Jörg Endrullis (Vrije Universiteit Amsterdam)
    Jakob Grue Simonsen (DIKU, University of Copenhagen) - co-chair
    Raúl Gutiérrez (Universitat Politècnica de València)
    Camilo Rocha (Pontificia Universidad Javeriana - Cali)
    Masahiko Sakai (Nagoya University)
    Sarah Winkler (Universität Innsbruck)

FSCD 2019 ORGANISING COMMITTEE

    FSCD Conference Chair: Jakob Rehof (TU Dortmund)
    FSCD Workshops Chair: Boris Düdder (TU Dortmund)

[TYPES/announce] FTfJP 2019: Second Call for Papers

[Toby Murray]

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

SECOND CALL FOR PAPERS
Submission deadline: Sunday 21 April (AoE)

21st Workshop on Formal Techniques for Java-like Programs (FTfJP 2019)
https://conf.researchr.org/home/FTfJP-2019/

Monday 15th July 2019, London

Co-located with ECOOP 2019

## About FTfJP 2019

Formal techniques can help analyse programs, precisely describe
program behaviour, and verify program properties. Modern programming
languages are interesting targets for formal techniques due to their
ubiquity and wide user base, stable and well-defined interfaces and
platforms, and powerful (but also complex) libraries. New languages
and applications in this space are continually arising, resulting in
new programming languages (PL) research challenges.

Work on formal techniques and tools and on the formal underpinnings of
programming languages themselves naturally complement each
other. FTfJP is an established workshop which has run annually since
1999 alongside ECOOP, with the goal of bringing together people
working in both fields.

The workshop has a broad PL theme; the most important criterion is
that submissions will generate interesting discussions within this
community. The term “Java-like” is somewhat historic and should be
interpreted broadly: FTfJP solicits and welcomes submission relating
to programming languages in general, beyond Java, C#, Scala, etc.

Example topics of interest include:

* Language design and semantics
* Type systems
* Concurrency and new application domains
* Specification and verification of program properties
* Program analysis (static or dynamic)
* Program Synthesis
* Security
* Pearls (programs or proofs)

FTfJP welcomes submissions on technical contributions, case studies,
experience reports, challenge proposals, and position papers.


## Submissions

Contributions are sought in two categories:

* Full Papers (6 pages, excluding references) present a technical
  contribution, case study, or detailed experience report. We welcome
  both complete and incomplete technical results; ongoing work is
  particularly welcome, provided it is substantial enough to stimulate
  interesting discussions.

* Short Papers (2 pages, excluding references) should advocate a
  promising research direction, or otherwise present a position likely
  to stimulate discussion at the workshop. We encourage
  e.g. established researchers to set out a personal vision, and
  beginning researchers to present a planned path to a PhD.

Both types of contributions will benefit from feedback received at the
workshop. Submissions will be peer reviewed, and will be evaluated
based on their clarity and their potential to generate interesting
discussions. The format of the workshop encourages interaction. FTfJP
is a forum in which a wide range of people share their expertise, from
experienced researchers to beginning PhD students.

Submissions are accepted via https://easychair.org/conferences/?conf=ftfjp2019


## Formatting and Publication

Submissions should be in acmart/sigplan style, 10pt font. Formatting
requirements are detailed on the SIGPLAN Author Information page
(https://www.sigplan.org/Resources/Author).

Accepted papers will be published in the ACM Digital Library by
default, though authors will be able to opt out of this publication,
if desired. At least one author of an accepted paper must attend the
workshop to present the work and participate in the discussions.


## Important Dates

* Submission: 21 April (AoE)
* Notification: 2 June


## Program Committee

* Yuyan Bao (Pennsylvania State University)
* James Bornholt (University of Washington)
* Gidon Ernst (Co-Chair; LMU Munich)
* Marie Farrell (University of Liverpool)
* Carlo A. Furia (USI – Università della Svizzera Italiana)
* Marie-Christine Jakobs (TU Darmstadt)
* Wojciech Mostowski (Halmstad University)
* Toby Murray (Co-Chair; University of Melbourne)
* Christine Rizkallah (University of New South Wales and Data61)
* Martin Schäf (Amazon Web Services)

[TYPES/announce] Open PhD position at Radboud University Nijmegen

[Cynthia Kop]

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


Dear all,

There is currently a PhD position available at Radboud University 
Nijmegen (the Netherlands) in the topic /Implicit Complexity through 
Higher-Order Rewriting/. The position is for four years, and comes with 
a competitive salary and very attractive employment conditions.


Interested students who either already hold a Masters' degree in 
computer science, mathematics, or a related area, or who will complete 
such a degree before September, are encouraged to apply. The initial 
application deadline is 29 April, but will be extended if no suitable 
candidate is found by that time.


*The project*

As a PhD candidate, you will work with Dr Cynthia Kop on the NWO-funded 
project `/Implicit Complexity through Higher Order Rewriting/’. The work 
will be carried out in collaboration with researchers in several 
European countries.


/Computational complexity/ is the study of resources (typically /time / 
and /space/) required to algorithmically solve a problem. This area 
studies some highly elusive questions of theoretical importance, such as 
(but certainly not limited to) the famous 'Clay Mathematics Prize 
"million-dollar" problem P=NP?. Rather than analysing programs directly, 
the area of /implicit/ complexity seeks to encode queries into calculi 
or logics. This allows methods from widely different areas to be brought 
to bear on the questions of complexity; inversely, this study can create 
new insights into the underlying logics.


In this project, you will use /higher-order term rewriting/ as a method 
for analysing implicit complexity. Term rewriting is a formal system 
that can be used to specify algorithms. Its simple, rigorous definition 
makes it very suitable for formal analysis, and as a result, its 
properties are well studied. Higher-order term rewriting extends 
standard term rewriting with anonymous functions and binders as in the 
λ-calculus, thus providing a highly liberal class of systems. You can 
build on several existing approaches, but will have the freedom to 
define your own direction.


You will be supervised by Dr Cynthia Kop. If you wish to learn more, 
feel free to send an e-mail to c@cs.ru.nl.


*Work environment*

Strategically located in Europe, Radboud University is one of the 
leading academic communities in the Netherlands. It is a place with a 
personal touch, where top-notch education and research take place on a 
beautiful green campus, in modern buildings with state-of-the-art 
facilities.


The position is available in the Software Science group of the Institute 
for Computing and Information Sciences (iCIS) at Radboud University. 
Research at iCIS focuses on software science, digital security and data 
science. During recent evaluations, iCIS has been consistently ranked as 
the No. 1 Computing Science department in the Netherlands. Evaluation 
committees praised our flat and open organisational structure, our 
ability to attract external funding, our strong ties to other 
disciplines, and our solid contacts with government and industrial 
partners. The Software Science group is well known for its contributions 
to the mathematical foundations of software, formal methods, and 
functional programming.


*What we expect from you*

 * you will be able to start before the end of September;
 *

   you hold an Msc or equivalent degree in computer science,
   mathematics or a closely related field -- or will graduate from such
   a field before starting the PhD position;

 *

   you are able to work both independently and as part of a team;

 *

   you are proficient in English (knowledge of Dutch is not required).

Note that prior knowledge of term rewriting or implicit complexity is 
not required, nor is competence with programming (although it helps).


*What we have to offer*

 *

   employment: 0.8 - 1.0 FTE;

 *

   a maximum gross monthly salary of € 2,972 based on a 38-hour working
   week;

 *

   the gross starting salary amounts to €2,325 per month, and will
   increase to €2,972 in the fourth year;

 *

   in addition to the salary: an 8% holiday allowance and an 8.3%
   end-of-year bonus;

 *

   duration of the contract: 4 years;

 *

   your performance will be evaluated after 18 months. If the
   evaluation is positive, the contract will be extended by 2.5 years;

 *

   you will be classified as a PhD Candidate (promovendus) in the Dutch
   university job-ranking system (UFO);

 *

   you will be able to make use of our dual career service (
   
https://www.ru.nl/english/working-at/why-work-at-radboud-university-0/our-way-working-personal-approach/dual-career-service/
   ) where our Dual Career Officer
   will assist with family related support, such as child care, and
   help your partner prepare for the local labour market and with
   finding an occupation;

 * For our employment conditions, see
 

[TYPES/announce] CfP - FACS 2019 (Formal Aspects of Component Software)

[Sung-Shik Jongmans]

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


**
**   Call for Papers: FACS 2019
**
**16th International Conference on
**  Formal Aspects of Component Software
**
**  23-25 October 2019, Amsterdam
**
** http://facs2019.org
**


## OVERVIEW

Component-based software development proposes sound engineering principles and 
techniques to cope with the complexity of present-day software systems. 
However, many challenging conceptual and technological issues remain in 
component-based software development theory and practice. Furthermore, the 
advent of service-oriented and cloud computing, cyber-physical systems, and the 
Internet of Things has brought to the fore new dimensions, such as quality of 
service and robustness to withstand faults, which require revisiting 
established concepts and developing new ones.

FACS 2019 is concerned with how formal methods can be applied to 
component-based software and system development. Formal methods have provided 
foundations for component-based software through research on mathematical 
models for components, composition and adaptation, and rigorous approaches to 
verification, deployment, testing, and certification.


## INVITED SPEAKERS

 * Wan Fokkink (Vrije Universiteit Amsterdam)
 * Carlo Ghezzi (Polytechnic University of Milan)
 * Kim Larsen (Aalborg University)


## DATES

 * Abstract: 21 June 2019
 * Paper: 28 June 2019
 * Notification: 30 August 2019
 * Conference: 23-25 October 2019

All deadlines are AoE.


## SCOPE

The conference seeks to address the application of formal methods in all 
aspects of software components and services. Specific topics include, but are 
not limited to:

 * formal models for software components and their interaction;
 * formal aspects of services, service-oriented architectures, business 
processes, cloud computing, cyber-physical systems, Internet of Things, and 
similar artifacts;
 * design and verification methods for software components and services;
 * composition and deployment: models, calculi, languages;
 * formal methods and modeling languages for components and services;
 * (behavioral) type systems for components and services;
 * models for QoS and other extra-functional properties (e.g., trust, 
compliance, security) of components and services;
 * components for real-time, safety-critical, secure, and/or embedded systems;
 * components for the Internet of things and cyber-physical systems;
 * probabilistic techniques for modeling and verification of component-based 
systems;
 * model-based testing of components and services;
 * case studies and experience reports;
 * tools supporting formal methods for components and services.


## PAPER CATEGORIES

We solicit submissions related to the topics mentioned above in the following 
categories:

 * A – full papers: original research, applications and experiences, surveys 
(18 pages max, excluding references);
 * B – short papers: tools and demonstrations, new ideas and emerging results, 
position papers (6 pages max, excluding references);
 * C – journal-first papers (2 pages).

All submissions in categories A and B must be original, unpublished, and not 
submitted concurrently for publication elsewhere. Submissions in category C 
must be 2-page abstracts of journal papers published after January 1st, 2018. 
The objective of journal-first papers is to offer FACS attendees a richer 
program and further opportunities for interaction. Authors of published papers 
in high-quality journals can submit a proposal to present their journal paper 
at FACS. The journal paper must adhere to the following criteria:

 * It should be clearly in the scope of FACS.
 * It should be recent: only journal papers available after January 1st, 2018 
(online or paper) can be presented.
 * It reports new research results that significantly extend prior work. As 
such, the journal paper does not simply extend prior work with material 
presented for completeness only (such as omitted proofs, algorithms, minor 
enhancements, or empirical results).
 * It has not been presented at, and is not under consideration for, 
journal-first programs of other similar conferences or workshops.
 * Journal-first submissions must be marked as such in EasyChair, and they must 
explicitly include pointers to the journal publication (such as a DOI).


## SUBMISSION & PUBLICATION

Paper submission is done via EasyChair at: 
https://easychair.org/conferences/?conf=facs2019. Each paper will be reviewed 
by at least three PC members and evaluated in terms of novelty, importance, 
evidence, and clarity.

The post-proceedings of FACS 2019 will be published as a volume of LNCS; it 
consists of accepted papers in categories A and B. Authors should consult 
Springer’s authors’ guidelines and use their proceedings templates, either for 
LaTeX or for Word, for the preparation of their papers. Springer encourages 
authors to include their ORCIDs in