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
- Pearls (programs or proofs)
FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, and position papers.
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.
Submissions should be made via EasyChair https://easychair.org/conferences/?conf=ftfjp2019. 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.
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.
Submissions will be taken in two rounds. Authors of papers rejected in Round One are free to resubmit to Round Two in either paper category, regardless of the type of Round One submission.
Mon 15 JulDisplayed time zone: Belfast change
10:45 - 12:15
|Invited Talk - JayHorn: A Java Model Checker|
Philipp Ruemmer Uppsala University
|CallƐ: An Effect System for Method Calls|
13:30 - 15:00
|Invited Talk - Building Trustworthy Software with CakeML|
Scott Owens University of Kent, UK
|Decidable, Tag-Based Semantic Subtyping for Nominal Types, Tuples, and Unions|
Julia Belyakova Northeastern University, USADOI Pre-print
15:30 - 17:00
|Towards Deductive Verification of C11 Programs with Event-B and ProB|
|Specifying I/O using Abstract Nested Hoare Triples in Separation Logic|
|Analysis of MiniJava Programs via Translation to ML|
Martin Lester University of Reading
|Translating Classes to First-Order Logic: An Example|