[TYPES/announce] Call for Tutorials and Workshops: PLDI 2022

[William J. Bowman]

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

Please distribute widely:

# Call for Workshops and Tutorials

PLDI 2022 is a world-class forum for researchers and practitioners in 
programming language design and implementation. As in previous years, PLDI is 
soliciting proposals for co-located workshops and tutorials that will take 
place on Monday June 20th, and Tuesday June 21st. Please propose your workshop 
or tutorial via the submission system.

The following details will be asked on submission:

* Name of the workshop/tutorial.
* Duration of the workshop/tutorial.
* Organizers: names, affiliation, contact information, brief (100 words) 
biography.
* A short description (150-200 words) of the topic.
* Event format: workshop/tutorial; type of submissions, if any; review process; 
results dissemination.
* Expected attendance and target audience within the PLDI community.
* How you plan to foster an inclusive environment and promote a diverse 
attendance.
* Information on any previous iterations of the workshop or tutorial.

*Note:* Workshops must make their own acceptance decisions by April 21, 2022 if 
there will be proceedings (final versions due May 5, 2022), or May 5, 2022.

## Submission
Submission site: 
https://urldefense.com/v3/__https://pldi22.sigplan.org/createProposal/d625158d-7188-4844-88cd-9bf71182aa9a__;!!IBzWLUs!CCl-RYsNYGH7YS0ia9oUuB-QeOvMMHsfGzUOZ6gY4BxKHS6cLvAx4ukxCc-Okbx9XJ7Y4m7rD1yHCg$
 

Workshops that would like their proceedings included in the ACM Digital Library 
must submit a proposal by November 18, 2021.

Workshops and tutorials that will have no formal proceedings should submit a 
proposal by November 30, 2021.

## Review

Proposals are reviewed by the Workshop and Tutorials Chairs, and if necessary, 
by the PLDI general chair.

* Proposals will be evaluated according to the relevance of the topic, the 
expertise and experience of the workshop organizers, and their potential to 
attract participants.
* Proposals submitted between November 18th and 30th will be evaluated on a 
first-come-first-served basis.

## Notification

We will notify workshop/tutorial acceptance by December 9th.

## Timeline

Submission deadline (with proceedings): November 18

Submission deadline (no proceedings): November 30

Notification: December 9

## Dissemination

A proposal should clearly state how the results of the workshop — i.e., 
published papers and other outcomes — will be made available to participants 
and others before and after the workshop event. The Workshops and Tutorials 
Chair will provide guidance to the organizers of accepted workshops that wish 
to publish proceedings in the ACM Digital Library. For those that choose to 
publish their papers in ACM Digital Library, please add the following text in 
the workshop call for papers and on the website:

*AUTHORS TAKE NOTE:* The official publication date is the date the proceedings 
are made available in the ACM Digital Library. This date may be up to two weeks 
prior to the first day of your conference. The official publication date 
affects the deadline for any patent filings related to published work. (For 
those rare conferences whose proceedings are published in the ACM Digital 
Library after the conference is over, the official publication date remains the 
first day of the conference.)

Workshops that elect to publish proceedings can do so in the ACM Digital 
Library with sponsoring by SIGPLAN. The application for SIGPLAN sponsorship 
includes reviewing the proposed program committee with the SIGPLAN Executive 
Committee, a process which the chairs will help facilitate.

## Workshop Co-Chairs
- Nadia Polikarpova, U. of California at San Diego
- Alexandra Silva, U. College London

[TYPES/announce] CfP Software Verification and Testing Track at SAC 2022

[Erika Abraham]

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


 37th Annual ACM/SIGAPP Symposium on Applied Computing
   Software Verification and Testing Track
 Brno, Czech Republic
April 25-29, 2022

SAC 2022 website:
https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3J9dUXiAw$ 


SAC-SVT 2022 website:
https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3K4i9zwmA$ 



 Important dates 

Oct. 15, 2021 - Submission of regular papers and SRC research abstracts
Dec. 10, 2021 - Notification
Dec. 21, 2021 - Camera-ready version
Dec. 21, 2021 - Author registration due date

 ACM Symposium on Applied Computing 

The ACM Symposium on Applied Computing (SAC) has gathered scientists
from different areas of computing over the last thirty years. The forum
represents an opportunity to interact with different communities sharing
an interest in applied computing.

SAC 2022 is sponsored by the ACM Special Interest Group on Applied
Computing (SIGAPP), and will take place on April 25-29, 2022 in
Brno, Czech Republic.

 Software Verification and Testing Track (SVT) 

The Software Verification and Testing track aims at contributing to the
challenge of improving the usability of formal methods in software
engineering. The track covers areas such as formal methods for
verification and testing, based on theorem proving, model checking,
static analysis, and run-time verification. We invite authors to submit
new results in formal verification and testing, as well as development
of technologies to improve the usability of formal methods in software
engineering. Also are welcome detailed descriptions of applications of
mechanical verification to large scale software.

 Topics 

Possible topics include, but are not limited to:

* model checking
* theorem proving
* correct by construction development
* model-based testing
* software testing
* symbolic execution
* static and dynamic analysis
* abstract interpretation
* analysis methods for dependable systems
* software certification and proof carrying code
* fault diagnosis and debugging
* verification and validation of large scale software systems
* real world applications and case studies applying software testing
  and verification
* benchmarks and data sets for software testing and verification

 Submission Guidelines 

Paper submissions must report on original, unpublished work. Submitted
papers will undergo a double-blind review process.  Author(s) name(s)
and address(es) must not appear in the body of the paper, and self-
reference should be avoided and made in the third person. We welcome
research papers and posters. Research papers should have at most 8
two-column pages in ACM format (further two pages, to a total of 10
pages, may be available at a charge). The length of a poster is limited
to three pages (one extra page may be available at a charge). Please
comply to this page limitation already at submission time.

Furthermore, in the context of the Student Research Competition (SRC)
Program to provide graduate students the opportunity to meet and
exchange ideas with researchers and practitioners in their areas of
interest, graduate students are invited to submit research abstracts
(maximum of 4 pages in ACM camera-ready format) following the
instructions published at the SAC 2022 website at

https://urldefense.com/v3/__https://www.sigapp.org/sac/sac2022/authorkit/ACM_SigConf-SRC2022.pdf__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3IT43u8Pg$ 


Submission of the same abstract to multiple tracks is not allowed.

Accepted papers will be published in the ACM SAC 2022 proceedings in the
ACM digital library. Paper registration is required, allowing the
inclusion of the paper/poster in the conference proceedings. An author
or a proxy attending SAC MUST present the paper. This is a requirement
for the paper/poster to be included in the ACM digital library. No-show
of registered papers and posters will result in excluding them from the
ACM digital library.

Detailed submission instructions are available on the SAC 2022
website.

 Track Chairs 

Erika Abraham, RWTH Aachen University, Germany
Pascale Le Gall, CentraleSupélec, Université Paris-Saclay, France

For  further information we refer to the SAC-SVT 2022 website:
https://urldefense.com/v3/__http://logimics.mics.centralesupelec.fr/en/SAC-SVT-2022__;!!IBzWLUs!HguDhwyE0DLDs44JNg27-c3v-B1Z4taG0QjGtGMfArzNa8LUnUWPtn42spR5AUP7ZXfxC3K4i9zwmA$ 

[TYPES/announce] tenure-track assistant professor positions at Boston University Computer Science Department

[Gaboardi, Marco]

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

Boston University Computer Science Department has openings for two tenure-track 
assistant professorships. The search is open to all the areas of computer 
science and strong applicants working on the principles of programming 
languages and related areas will be seriously considered. 

You can find below the official announcement, which is also available at the 
link:
https://urldefense.com/v3/__https://www.bu.edu/cs/2021/09/17/bu-cs-invites-applications-for-new-faculty-members/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWbSUCKoyA$
 

We do hope to expand our Principles of Programming Languages and Verification 
group. 
https://urldefense.com/v3/__http://www.bu.edu/cs/research/popv/__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWY-t4-Wfw$
 

I am happy to answer any question that interested candidates may have. 

Best!
Marco



Official Announcement 
——— 
Boston University Computer Science has openings for two tenure-track assistant 
professorships beginning July 1, 2022. Strong applicants in all areas of 
computer science, including security, privacy, foundations of programming 
languages and formal verification, machine learning and optimization, systems, 
human-computer interaction, artificial intelligence, algorithms, and theory, 
are encouraged to apply. We also have an opening for an associate professor of 
the practice beginning July 1, 2022. This search is particularly focused in the 
areas of artificial intelligence, machine learning, and deep learning.

The Department is in the midst of an extended period of sustained growth, and 
is looking to both deepen areas of existing strength as well as to broaden into 
additional, new areas.   Over the past several years, the tenure track faculty 
size has grown by 50%, with corresponding increases in graduate student 
population as well as in space and other resources. In December 2019, Boston 
University broke ground on a new 17-story, 350,000-square-foot Data Sciences 
Center, to house Computer Science along with other units contributing to Data 
Science, with planned opening in January 2023.

Boston University, which has steadily increased in rankings over the past 
decade, is committed to nurturing and supporting interdisciplinary and 
cross-departmental research. BU is situated centrally in Boston, a vibrant city 
with an enormous range of options for industrial and academic collaboration 
around technology.

The Department consists of a diverse group of 32 tenured and tenure-track 
faculty members, and offers programs leading to B.A., M.S., and Ph.D. degrees. 
The Department has research strengths in data mining, databases, graphics, 
image and video computing, machine learning, natural language processing, 
networking, distributed systems, operating systems, software design and 
implementation, real-time systems, security and cryptography, and theory of 
computation and algorithms. In addition, members of the Department collaborate 
closely with faculty across the university including mathematics and 
statistics, computer engineering, mechanical engineering, biology, earth and 
environment, economics, law, medicine, among others.Additional information 
about the Department is available at 
https://urldefense.com/v3/__http://www.bu.edu/cs__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaVu0197A$
 .

Boston University as well as the Department of Computer Science expect 
excellence in research and in teaching and are committed to building a 
culturally, racially, and ethnically diverse scholarly community.

To apply:

Assistant Professor position (review to begin on 12/1/21 and continue on a 
rolling basis): 
https://urldefense.com/v3/__https://academicjobsonline.org/ajo/jobs/19503__;!!IBzWLUs!CMKBQNqbXEeJD5W5B1dMbgTBYGnzsLkWrjfywyUVGokca_ZGVHBX26EkWD5uD0bJWUjwfWaoWnpNHQ$
 

BU is an equal opportunity employer and all qualified applicants will receive 
consideration for employment without regard to race, color, religion, sex, 
sexual orientation, gender identity, national origin, disability status, 
protected veteran status, or any other characteristic protected by law. We are 
a VEVRAA Federal Contractor.

Applicants are encouraged to consider other open faculty positions in related 
academic units at Boston University, including Computing & Data Sciences, 
Electrical & Computer Engineering, and Statistics. Upon request, successful 
candidates will have the opportunity to secure secondary appointments in 
cognate academic units at Boston University as appropriate.

[TYPES/announce] Call for (Self-)Nominations for the ASPLOS 2022 Artifact Evaluation Committee

[Eva Darulova]

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

We are looking for motivated students, researchers and engineers to be 
part of the ASPLOS'22 artifact evaluation committee. This year, you can 
nominate yourself or your students/postdocs or fellow engineers. You can 
find more information about ASPLOS'22 artifact evaluation here: 
https://urldefense.com/v3/__https://ctuning.org/ae/asplos2022.html__;!!IBzWLUs!BSsrsk8wGDOu8-Zfqun3mlmWvGycVTqcWfzaTh43CDHOoCaRoVVTwJqUdjGI7ruClng3wxiUVH_Xmg$ 

The (self-)nomination form is available at: 
https://urldefense.com/v3/__https://forms.gle/pTVYYeYcfR1vLj6GA__;!!IBzWLUs!BSsrsk8wGDOu8-Zfqun3mlmWvGycVTqcWfzaTh43CDHOoCaRoVVTwJqUdjGI7ruClng3wxjpBDfyTQ$ , and open until 22 October.


As a committee member, your responsibility will be to review artifacts 
submitted for already accepted papers, e.g. by inspecting and running 
code and checking whether it allows to reproduce the main results of the 
paper. All evaluators will be acknowledged in the proceedings.


ASPLOS AE'22 will use the HotCRP submission website to communicate 
asynchronously with artifact authors to allow to resolve issues quickly. 
We expect the main work to take place between December 8 and January 17.

[TYPES/announce] 27th WoLLIC 2021 - Call for Participation (Online)

[Ruy Jose Guerra Barretto de Queiroz]

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

[Please circulate. Apologies for multiple copies.]

CALL FOR PARTICIPATION

WoLLIC 2021
27th Workshop on Logic, Language, Information and Computation
October 5 to 8, 2021
(Virtual Event)

ORGANISATION
Universidade de São Paulo, Brazil
University College London, UK
Centro de Informática, Universidade Federal de Pernambuco, Brazil

VISION
WoLLIC is an annual international forum on inter-disciplinary research
involving formal logic, computing and programming theory, and natural
language and reasoning. Each meeting includes invited talks and tutorials
as well as contributed papers. The twenty-seventh WoLLIC will be held
online from October 5 to 8, 2021.  It is scientifically sponsored by the
Association for Symbolic Logic (ASL), the Interest Group in Pure and
Applied Logics (IGPL), the The Association for Logic, Language and
Information (FoLLI), the European Association for Theoretical Computer
Science (EATCS), ACM Special Interest Group on Logic and Computation
(ACM-SIGLOG) (TBC), the Sociedade Brasileira de Computação (SBC), and the
Sociedade Brasileira de Lógica (SBL).

INVITED SPEAKERS
Catarina Dutilh Novaes (VU Amsterdam)
Santiago Figueira (Universidad de Buenos Aires, Argentina)
Andreas Herzig (IRIT, France)
Cláudia Nalon (UnB - Brazil)

PROGRAMME COMMITTEE
Carlos Areces (FaMAF - Universidad Nacional de Córdoba, Argentina)
Arthur Azevedo de Amorim (Boston University, USA)
Paul Brunet (University College London, UK)
Nina Gierasimczuk (Technical University of Denmark, Denmark)
Helle Hvid Hansen (University of Groningen, The Netherlands)
Justin Hsu (University of Pennsylvania, USA)
Fairouz Kamareddine (Heriot-Watt University, UK)
Sandra Kiefer (RWTH Aachen University, Germany)
Clemens Kupke (Strathclyde University, Scotland)
Konstantinos Mamouras (Rice University, USA)
Maria Vanina Martinez (Universidad de Buenos Aires, Argentina)
Larry Moss (Indiana Univ, USA)
Claudia Nalon (University of Brasília, Brazil)
Valeria de Paiva (Samsung Research, USA, and Univ Birmingham, UK)
Elaine Pimentel (UFRN, Brazil)
Revantha Ramanayake (University of Groningen, The Netherlands)
Jurriaan Rot (Radboud University, The Netherlands)
Alexandra Silva (Cornell Univ, USA) (Co-Chair)
Christine Tasson (IRIF, France)
Sebastiaan Terwijn (Radboud University, The Netherlands)
Renata Wassermann (Univ São Paulo, Brazil) (Co-Chair)

STEERING COMMITTEE
Samson Abramsky, Anuj Dawar, Juliette Kennedy, Ulrich Kohlenbach, Daniel
Leivant, Leonid Libkin, Lawrence Moss, Luke Ong, Valeria de Paiva, Ruy de
Queiroz.

ADVISORY COMMITTEE
Johan van Benthem, Joe Halpern, Wilfrid Hodges, Angus Macintyre, Hiroakira
Ono, Jouko Väänänen.

ORGANISING COMMITTEE
Renata Wassermann (Univ São Paulo, Brazil) (Co-Chair)
Alexandra Silva (Cornell Univ, USA) (Co-Chair)
Anjolina G. de Oliveira (Univ Federal de Pernambuco, Brazil)
Ruy de Queiroz (Univ Federal de Pernambuco, Brazil) (co-chair)

SCIENTIFIC SPONSORSHIP
Interest Group in Pure and Applied Logics (IGPL)
The Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
European Association for Theoretical Computer Science (EATCS)
ACM Special Interest Group on Logic and Computation (ACM-SIGLOG) (TBC)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)

SPECIAL SESSION: SCREENING OF MOVIES ABOUT MATHEMATICIANS
It is planned to have a special session with the exhibition of a one-hour
documentary film about a remarkable mathematician whose contributions were
recognized with a Fields Medal just a few years before her untimely death.
It is a joint production of The Mathematical Sciences Research Institute
(MSRI) and George Csicsery (Zala Films): ‘Secrets of the Surface - The
Mathematical Vision of Maryam Mirzakhani’. “The biographical film is about
Maryam Mirzakhani, a brilliant woman, and Muslim immigrant to the United
States who became a superstar in her field. The story of her life will be
complemented with sections about Mirzakhani’s mathematical contributions,
as explained by colleagues and illustrated with animated sequences.
Throughout, we will look for clues about the sources of Mirzakhani’s
insights and creativity." 
(https://urldefense.com/v3/__http://www.zalafilms.com/secrets/__;!!IBzWLUs!HEv2-DwY0JEZr8aScD9B1yw79wdD-a-pgVZ_n72_bUTrQV5pu_SRyVcmZ2SbOZEPAUdfL1m7Pzn_wQ$
 )

FURTHER INFORMATION
Contact one of the Co-Chairs of the Organising Committee.

WEB PAGE
https://urldefense.com/v3/__http://wollic.org/__;!!IBzWLUs!HEv2-DwY0JEZr8aScD9B1yw79wdD-a-pgVZ_n72_bUTrQV5pu_SRyVcmZ2SbOZEPAUdfL1n1iA0frA$
 

[TYPES/announce] ITRS Call for Post-Proceedings

[Riccardo Treglia]

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

ITRS 2021 Call for Post-ProceedingsTenth Workshop on Intersection Types and
Related Systems - ITRS 2021

17 July 2021, Online

Affiliated with FSCD 
, 17-24 July 2021, Buenos
Aires

Web page: 
https://urldefense.com/v3/__http://www.di.unito.it/*deligu/ITRS2021/__;fg!!IBzWLUs!FLn7aHMzY6HrXO3KJJA59O83OnWqksX9LvNZresHtiVy7ClLtbwjipgIXqebOfIjGgo_N6dpZd2c0Q$
 
Aims and Scope

Intersection types were introduced near the end of the 1970s to overcome
the limitations of Curry's type assignment system and to provide a
characterization of the strongly normalizing terms of the Lambda Calculus.
The key idea is to introduce an intersection type constructor ∧ such that a
term of type t ∧ s can be used at both type t and s within the same
context. This provides a finite polymorphism where various, even unrelated,
types of the term are listed explicitly, differently from the more widely
used universally quantified types where the polymorphic type is the common
schema that stands for its various type instances. As a consequence, more
terms (all and only the normalizing terms) can be typed than with universal
polymorphism.

Although intersection types were initially intended for use in analyzing
and/or synthesizing lambda models as well as in analyzing normalization
properties, over the last twenty years the scope of the research on
intersection types and related systems has broadened in many directions.
Restricted (and more manageable) forms have been investigated, such as
refinement types. Type systems based on intersection type theory have been
extensively studied for practical purposes, such as program analysis and
higher-order model checking. The dual notion of union types turned out to
be quite useful for programming languages. Finally, the behavioral approach
to types, which can give a static specification of computational
properties, has become central in the most recent research on type theory.

The ITRS 2021 workshop aims to bring together researchers working on both
the theory and practical applications of systems based on intersection
types and related approaches. Possible topics for submitted papers include,
but are not limited to:

   - Formal properties of systems with intersection types.
   - Results for related systems, such as union types, refinement types, or
   singleton types.
   - Applications to lambda calculus, pi-calculus and similar systems.
   - Applications for programming languages, program analysis, and program
   verification.
   - Applications for other areas, such as database query languages and
   program extraction from proofs.
   - Related approaches using behavioral/intensional types and/or
   denotational semantics to characterize computational properties.
   - Quantitative refinements of intersection types.

ITRS workshops have been held every two years (with the exception of 2020,
because of COVID-19 outbreak). Information about the previous events is
available on the ITRS home page 
.
Post-Proceedings

We are planning post-proceedings, including presentations to the workshop
and submissions accepted via an open call with *dates*:

   - submission deadline: *1 October*
   - acceptance communication: *5 November*
   - camera-ready version: *19 November*

Papers should not be published elsewhere, with original results or
surveying ongoing research. They should be written in English using LaTex
and will appear on EPTCS: see Information for Authors
. Submissions should be 20 pages long, excluding
bibliography and avoiding technical appendices. Submissions are expected
via EasyChair 
.
Program Committee

   - Antonio Bucciarelli, Université de Paris, France
   - Daniel de Carvalho, Université Grenoble Alpes, France
   - Andrej Dudenhefner, Saarland University, Germany
   - Silvia Ghilezan, University of Novi Sad, Serbia
   - Giulio Guerrieri, University of Bath, UK
   - Ugo de' Liguoro, Università di Torino, Italy (chair)
   - Jeremy Siek, Indiana University Bloomington, USA (co-chair)

--
Steering Committee

   - Mariangiola Dezani-Ciancaglini, Università di Torino, Italy
   - Jakob Rehof, TU University of Dortmund, Germany
   - Joe Wells, Heriot-Watt University, Scotland


Organizers:


   - Ugo de' Liguoro, Università di Torino, Italy
   - Riccardo