[TYPES/announce] Assistant Professors at ETH Zurich: Security, Software Engineering, and Programming Languages

[Mueller Peter]

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

Assistant Professors (Tenure Track)
Security, Software Engineering, and Programming Languages
The Department of Computer Science (www.inf.ethz.ch) at ETH Zurich invites 
applications for assistant professorships (tenure track) in computer science 
with focus on different aspects of Cyber Security, Software Engineering, and 
Programming Languages.

- Privacy
- Programming Languages/Software Engineering
- Security of IT Infrastructure
- Software Security
- Trustworthy Software
- Education Technology (e.g. assignment generation, feedback and grading for 
programming and math assignments)

Please apply for only one of the above areas as all applications will be 
jointly reviewed.

Applicants should be strongly rooted in computer science, have internationally 
recognized expertise in their field and pursue research at the forefront of 
computer science. Successful candidates should establish and lead a strong 
research program. They will be expected to supervise doctoral students and 
teach both undergraduate and graduate level courses (in German or in English). 
Collaboration in research and teaching is expected both within the department 
and with other groups of ETH Zurich and related institutions.

Assistant professorships have been established to promote the careers of 
younger scientists. ETH Zurich implements a tenure track system equivalent to 
other top international universities.
See 
https://ethz.ch/en/the-eth-zurich/working-teaching-and-research/faculty-affairs/ausgeschriebene-professuren/ingenieurwissenschaften/assistant-professors--tenure-track--of-computer-science---securi.html
 for details.

[TYPES/announce] Special Issue on "Static Analysis Techniques: Recent Advances and New Horizons"

[Agostino Cortesi]

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

Dear colleague,
we cordially invite you to consider submitting a paper to the Special
Issue of the journal Applied Sciences (ISSN 2076-3417; IF 2.217) on
“Static Analysis Techniques: Recent Advances and New Horizons”.

Static analysis is currently recognized as a key mean for enhancing
software security and reliability. It is widely recognized as a
fundamental approach for program verification, bug detection, compiler
optimization, program understanding, and software maintenance. In
fact, a white-box semantics-based approach to the analysis of source
code can automatically reveal errors that do not manifest until a
disaster occurs weeks, months or years after release, which might be
very difficult to reproduce and that might not be captured by testing,
as tests can only cover a finite number of execution traces. Several
techniques have been introduced in the scientific literature, and
several tools implementing such techniques are currently in use on
software written in different programming language targets and
focusing on different program properties.

This Special Issue is aimed at collecting new contributions in this
area, ranging from the introduction of new techniques to their
practical implementation and applications with a particular emphasis
on applied aspects, i.e., on the issues related to scalability,
interoperability, and maintainability of static analysis tools in
highly demanding real scenarios.

More infos at:
https://www.mdpi.com/journal/applsci/special_issues/Static_Analysis_Techniques

Contributions are welcome on all aspects of static analysis,
including, but not limited to:
Abstract Interpretation;
Data-flow and control-flow analysis;
Model checking;
Program verification;
Program certification;
Security analysis;
Type checking.

Submissions can address any programming paradigm, including
concurrent, constraint, functional, imperative, logic, and
object-oriented programming.
Extended versions of papers presented in international conferences are
welcome if the extended version contains significant additions which
were not in the conference version of the paper. In this case, the
authors are invited to submit a cover letter explaining how the
submitted paper differs from the conference one.

Prof. Dr. Agostino Cortesi
Dr. Pietro Ferrara
Guest Editors


___
prof. Agostino Cortesi
Università Ca' Foscari Venezia, Italy
[tel.: +39 041 234.8450 - mobile: +39 347 441.4010]

[TYPES/announce] Coalgebra Day 2019

[Clovis Eberhart]

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

Dear all,

We are pleased to announce that Coalgebra Day 2019 will be organised
in Tokyo, Japan.  There will be a series of talks by various speakers
and it will be an occasion for researchers to exchange on coalgebras
and related matters, and for students to get introduced to the field
of coalgebra.

Date and time: Mon 28 Oct, 2019. 9:30-17:30.

Place: room 2009-2010, National Institute of Informatics,
2-1-2 Hitotsubashi, Chiyoda-ku, Tokyo
Access: https://www.nii.ac.jp/en/about/access/

Speakers:
- Bart Jacobs (Radboud University Nijmegen)
- Jurriaan Rot (Radboud University Nijmegen)
- Ana Sokolova (University of Salzburg)
- Yuichi Komorida (National Institute of Informatics)
- David Sprunger (National Institute of Informatics)
- Clovis Eberhart (National Institute of Informatics, Japanese French
Laboratory for Informatics)
- Shin-ya Katsumata (National Institute of Informatics)
- Satoshi Kura (National Institute of Informatics)

We are planning to have an informal dinner.

Registration is free but mandatory for practical reasons.
Please register through this form:
https://docs.google.com/forms/d/e/1FAIpQLSdja7qMesKpyA6ed1Z-PfMjP_RYP288zKfQxLxVgWQ1UTCYaQ/viewform
The deadline is Oct 18th 23:59, AoE.

For more information, see
http://group-mmm.org/coalgebra-day-2019/
or send an email to one of the organisers.

Please feel free to distribute this email to people that you think
could be interested.

Best,
Clovis Eberhart
for the organisers

[TYPES/announce] post-doc positions in Oxford and Cambridge

[Anuj Dawar]

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


Two three-year post-doc positions in Semantics and Descriptive
Complexity at Oxford and Cambridge.

There are two post-doctoral research positions open, one at Oxford and
one at Cambridge, to work on a new EPSRC-funded project on "Resources
and co-Resources: A junction between semantics and descriptive
complexity" which is jointly led by Prof. Samson Abramsky FRS at
Oxford, and Prof. Anuj Dawar at the University of Cambridge.

The positions are available to start as soon as possible, and are
funded for 36 months.

The project seeks to explore ways in which methods from the study of
logic and algorithms (specifically finite model theory and descriptive
complexity) can be combined with methods from semantics (such as
category theory) to build a cohesive algebraic theory of
resources. This builds on recent work obtaining categorical accounts
of essential constructions in finite model theory (by Abramsky, Dawar
and Wang and Abramsky and Shah), as well as categorical accounts of
quantum resources (by Abramsky, Barbosa, de Silva and Zapata).  This
work made essential use of monads -- seen as encapsulating quantum and
other resources -- and of comonads, which encapsulate “coresources”,
i.e. ways of limiting access to a structure corresponding to
definability in various logics. The project will seek to apply these
new tools to major results in descriptive complexity, to expand them
to cover other important constructions, to find ways of combining
accounts of quantum resources and logical co-resources, and to build a
general theory of these.

There are separate application processes for applying for the two
positions.  Details of these and further information may be found at
these webpages:
 http://www.cs.ox.ac.uk/news/1735-full.html
 http://www.jobs.cam.ac.uk/job/23436/

For further questions or enquiries, contact
 samson.abram...@cs.ox.ac.uk or anuj.da...@cl.cam.ac.uk




signature.asc
Description: OpenPGP digital signature

[TYPES/announce] [PLNL'19] Call for talk proposals - Programming Languages in the Netherlands, 12-12-2019, Radboud University

[Peter Achten]

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


===

    PLNL 2019

    2nd Workshop on Programming Languages
 in The Netherlands
  --
 Thursday, December 12, 2019
  Radboud University, Nijmegen, The Netherlands

    CALL FOR TALK PROPOSALS

   https://wiki.clean.cs.ru.nl/PLNL19
===

Workshop Overview
-
After the succesfull launch of this new workshop series, PLNL'18, we are 
happy to invite you to give a presentation or attend the second edition. 
The purpose of PLNL is to bring together researchers in the area of 
programming languages in the Netherlands. The workshop targets 
programming language research in the broad sense, included but not 
limited to the design, implementation, theory, application, and teaching 
of programming languages.


Workshop Format
---
The workshop will consist of a number of contributed talks. These talks 
should provoke discussion and/or questions --- we strive to have 
interactive talks with plenty of discussion by the audience.


Coffee and lunch breaks will provide the opportunity to network with 
your colleagues and to meet new people. Junior researchers and senior 
researchers are equally welcome, and both are encouraged to submit a 
talk proposal.


Researchers that are not from the Netherlands, but for example, from 
neighboring countries like Belgium or Germany, are also welcome to 
attend. The language of the workshop is English.


Registration

Participation is free, but you will need to register. The deadline for 
registration is December 5, 2019.


To register, please visit https://forms.gle/p1Pn3UnBycQH6zyr6

Submission details
--
Submission page: https://easychair.org/conferences/?conf=plnl19

Submission:   Monday, November 18, 2019.
Notification: Monday, November 25, 2019
Workshop: Thursday, December 12, 2019.

Submissions for talk proposals should be described in an abstract of at 
most 300 words. Proposals do not need to represent original work. It is 
fine to propose to talk about (recently) published work.


Organizers
--
Pieter Koopman (pie...@cs.ru.nl)
Peter Achten   (p.ach...@cs.ru.nl)

Program Committee
-
- Pieter Koopman Radboud University
- Peter Achten   Radboud University
- Robbert Krebbers   Delft University of Technology
- Wouter Swierstra   University of Utrecht
- Eelco Visser   Delft University of Technology

[TYPES/announce] Call for Presentations on Principles of Secure Compilation (PriSC Workshop @ POPL 2020)

[Deian Stefan]

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

(apologies if you receive multiple copies of this announcement)

===
Call for Presentations on Secure Compilation (PriSC Workshop @ POPL'19)
===

The emerging field of secure compilation aims to preserve security
properties of programs when they have been compiled to low-level languages
such as assembly, where high-level abstractions don’t exist, and unsafe,
unexpected interactions with libraries, other programs, the operating
system and even the hardware are possible. For unsafe source languages like
C, secure compilation requires careful handling of undefined
source-language behavior (like buffer overflows and double frees).
Formally, secure compilation aims to protect high-level language
abstractions in compiled code, even against adversarial low-level contexts,
thus enabling sound reasoning about security in the source language. A
complementary goal is to keep the compiled code efficient, often leveraging
new hardware security features and advances in compiler design. Other
necessary components are identifying and formalizing properties that secure
compilers must possess, devising efficient security mechanisms (both
software and hardware), and developing effective verification and proof
techniques. Research in the field thus puts together advances in compiler
design, programming languages, systems security, verification, and computer
architecture.

4th Workshop on Principles of Secure Compilation (PriSC 2020)
==

The Workshop on Principles of Secure Compilation (PriSC)
 is a relatively new, informal
1-day workshop without any proceedings. The goal is to bring together
researchers interested in secure compilation and to identify interesting
research directions and open challenges.

The 4th edition of PriSC will be held on January 25 in New Orleans,
Louisiana USA together with the ACM SIGPLAN Symposium on Principles of
Programming Languages (POPL), 2020.

Important Dates
=
* Fri 18 Oct 2019: Submission deadline
* Wed 13 Nov 2019: Notification
* Sat 25 Jan 2020: Workshop

Presentation Proposals and Attending the Workshop
=

Anyone interested in presenting at the workshop should submit an extended
abstract (up to 2 pages, details below) covering past, ongoing, or future
work. Any topic that could be of interest to secure compilation is in
scope. Secure compilation should be interpreted very broadly to include any
work in security, programming languages, architecture, systems or their
combination that can be leveraged to preserve security properties of
programs when they are compiled or to eliminate low-level vulnerabilities.
Presentations that provide a useful outside view or challenge the community
are also welcome. This includes presentations on new attack vectors such as
microarchitectural side-channels, whose defenses could benefit from
compiler techniques.

Specific topics of interest include but are not limited to:

- Attacker models for secure compiler chains.
- Secure compiler properties: fully abstract compilation and similar
properties, memory safety, control-flow integrity, preservation of safety,
information flow and other (hyper-)properties against adversarial contexts,
secure multi-language interoperability.
- Secure interaction between different programming languages: foreign
function interfaces, gradual types, securely combining different memory
management strategies.
- Enforcement mechanisms and low-level security primitives: static
checking, program verification, typed assembly languages, reference
monitoring, program rewriting, software-based isolation/hiding techniques
(SFI, crypto-based, randomization-based, OS/hypervisor-based),
security-oriented architectural features such as Intel’s SGX, MPX and MPK,
capability machines, side-channel defenses, object capabilities.
- Experimental evaluation and applications of secure compilers.
- Proof methods relevant to compilation: (bi)simulation, logical relations,
game semantics, trace semantics, multi-language semantics, embedded
interpreters.
- Formal verification of secure compilation chains (protection mechanisms,
compilers, linkers, loaders), machine-checked proofs, translation
validation, property-based testing.

Guidelines for Submitting Extended Abstracts
===

Extended abstracts should be submitted in PDF format and not exceed 2
pages. They should be formatted in two-column layout, 10pt font, and be
printable on A4 and US Letter sized paper. We recommend using the new
acmart LaTeX style

in sigplan mode.

Submissions are not anonymous and