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 submissions relating to programming languages in general, beyond Java, including submissions related to C#, Scala, and similar languages, and submissions on more general topics that may be relevant to such languages.

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.

Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Tue 18 Jul

Displayed time zone: Pacific Time (US & Canada) change

08:00 - 08:30
08:00
30m
Coffee break
Break
ECOOP and ISSTA Catering

09:00 - 10:00
09:00
60m
Keynote
Towards Code-Aware Code Models
ECOOP and ISSTA Keynotes
K: Baishakhi Ray Columbia University
10:00 - 10:30
10:00
30m
Coffee break
Break
ECOOP and ISSTA Catering

10:30 - 12:00
10:30
25m
Talk
Verifying C++ dynamic binding
FTfJP
Niels Mommen KU Leuven, Bart Jacobs imec-DistriNet, Dept. CS, KU Leuven
Link to publication DOI Pre-print
10:55
15m
Talk
Correctness-by-Construction meets Refinement Types
FTfJP
Baber Rehman University of Hong Kong
11:10
25m
Talk
Towards Verified Scalable Parallel Computing with Coq and Spark
FTfJP
Frederic Loulergue Université d'Orléans, Jolan Philippe IMT Atlantique
DOI
11:35
25m
Talk
Constructing Structured SSA from FJ
FTfJP
Kenny Zhuo Ming Lu ISTD, Singapore University of Technology and Design, Daniel Yu Hian Low Singapore University of Technology and Design
12:00 - 13:30
12:00
90m
Lunch
Lunch
ECOOP and ISSTA Catering

13:30 - 15:00
Runtime checking and static analysisFTfJP at Anderson Seminar Room (Gates 271)
13:30
25m
Talk
Gradual Guarantee for FJ with lambda-expressions
FTfJP
Pedro Ângelo University of Porto, Viviana Bono University of Torino, Mariangiola Dezani Università di Torino, Mário Florido Universidade do Porto
13:55
25m
Talk
Points-to Analysis for Context-Oriented JavaScript Programs
FTfJP
Sergio Cardenas Universidad de los Andes, Paul Leger Universidad Católica del Norte, Chile, Hiroaki Fukuda Shibaura Institute of Technology, Nicolás Cardozo Universidad de los Andes
DOI Media Attached
14:20
25m
Talk
Dependency-free Capture Tracking
FTfJP
Edward Lee University of Waterloo, Kavin Satheeskumar University of Waterloo, Ondřej Lhoták University of Waterloo
15:00 - 15:30
15:00
30m
Coffee break
Break
ECOOP and ISSTA Catering

15:30 - 17:00
15:30
25m
Talk
Runtime verification of hash code in mutable classes
FTfJP
Davide Ancona DIBRIS, University of Genova, Italy, Angelo Ferrando DIBRIS, Università di Genova, Viviana Mascardi DIBRIS, University of Genova, Italy
15:55
25m
Talk
Verifying Well-Typedness Preservation of Refactorings using Scope Graphs
FTfJP
Luka Miljak Delft University of Technology, Casper Bach Poulsen Delft University of Technology, Flip van Spaendonck TU Eindhoven
DOI
16:25
20m
Talk
Using Rewrite Strategies for Efficient Functional Automatic Differentiation
FTfJP
Timon Böhler Technical University of Darmstadt, David Richter Technical University of Darmstadt, Mira Mezini TU Darmstadt
Pre-print
17:30 - 20:30

Call for Papers

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.

All submissions and reviews will be managed within EasyChair. Submissions should be made via https://easychair.org/conferences/?conf=ftfjp2023. There is no need to indicate the paper category (long/short).

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. Reviewing will be single blind, there is no need to anonymize submissions.

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.

All authors should use the official “ACM Master article template”, which can be obtained from the ACM Proceedings Template pages (https://www.acm.org/publications/proceedings-template). Latex users should use the “sigconf” option as well as “review” (to produce line numbers for easy reference by the reviewers). To that end, the following latex code can be placed at the start of the latex document: \documentclass[sigconf,review]{acmart}

All questions about submissions should be emailed to Aaron Tomb aarontomb@gmail.com

Questions? Use the FTfJP contact form.