Blogs (61) >>

20th Workshop on Formal Techniques for Java-like Programs

Formal techniques can help analyze programs, precisely describe program behavior, and verify program properties. Languages such as Java, C#, and Scala 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 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. 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)
  • Security
  • Pearls (programs or proofs)

FTfJP welcomes submissions on technical contributions, case studies, experience reports, challenge proposals, and position papers. Just as the number and the feature set of Java-like languages is expanding, the term “Java-like” should be interpreted broadly.

Accepted Papers

Title
A Formalism for Specification of Java API Interfaces
FTfJP
Pre-print
An Exercise in Verifying Sequential Programs with VerCors
FTfJP
Pre-print
Incremental Overload Resolution in Object-Oriented Programming Languages
FTfJP
Pre-print
Monotonic Gradual Typing in a Common Calculus
FTfJP
Pre-print
Reasoning about Functional Programming in Java and C++
FTfJP
Pre-print
Safely Abstracting Memory Layouts
FTfJP
Pre-print
Specification Idioms from Industrial Experience
FTfJP
Pre-print
Static Latency Tracking with Placement Types
FTfJP
Pre-print
Tool demonstration: The VerCors Verification Toolset
FTfJP
Pre-print
Towards specifications of robustness -- the things that programs do *not* doKeynote
FTfJP

Call for Papers

Contributions related to formal techniques for Java-like programs are sought in two categories:

Full Papers. In 6 two-column pages, the paper should 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. In 2 two-column pages, the paper 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 based on 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.

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. The use of ACM’s template for the SIGPLAN format is required. At least one author of an accepted paper must attend the workshop to present the work and participate in the discussions.

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

Mon 16 Jul
Times are displayed in time zone: Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna

11:00 - 12:30: Session 1FTfJP at Hanoi
11:00 - 11:30
Full-paper
Monotonic Gradual Typing in a Common Calculus
FTfJP
Benjamin ChungNortheastern University, Jan VitekNortheastern University
Pre-print
11:30 - 12:00
Full-paper
Incremental Overload Resolution in Object-Oriented Programming Languages
FTfJP
Tamás Szabóitemis AG / TU Delft, Edlira KuciTU Darmstadt, Germany, Matthijs BijmanDelft University of Technology, Mira MeziniTU Darmstadt, Sebastian ErdwegTU Delft
Pre-print
12:00 - 12:30
Full-paper
Safely Abstracting Memory Layouts
FTfJP
Juliana FrancoMicrosoft Research, Cambridge, Alexandros TasosImperial College London, Sophia DrossopoulouImperial College London, Tobias WrigstadUppsala University, Susan EisenbachImperial College London
Pre-print
14:00 - 15:30: Session 2FTfJP at Hanoi
14:00 - 15:00
Talk
Towards specifications of robustness -- the things that programs do *not* doKeynote
FTfJP
Sophia DrossopoulouImperial College London
15:00 - 15:30
Full-paper
Specification Idioms from Industrial Experience
FTfJP
David CokCEA, LIST, Software Safety and Security Laboratory
Pre-print
16:00 - 18:15: Session 3FTfJP at Hanoi
16:00 - 16:25
Short-paper
Reasoning about Functional Programming in Java and C++
FTfJP
David CokCEA, LIST, Software Safety and Security Laboratory
Pre-print
16:25 - 16:50
Short-paper
A Formalism for Specification of Java API Interfaces
FTfJP
Davide AnconaUniversity of Genova, Francesco DagninoDIBRIS, University of Genova, Italy, Luca FranceschiniDIBRIS, University of Genova
Pre-print
16:50 - 17:15
Short-paper
Static Latency Tracking with Placement Types
FTfJP
Pascal WeisenburgerTechnische Universität Darmstadt, Tobias ReinhardTechnische Universität Darmstadt, Guido SalvaneschiTU Darmstadt
Pre-print
17:15 - 17:45
Demonstration
Tool demonstration: The VerCors Verification Toolset
FTfJP
Wytse OortwijnUniversity of Twente, The Netherlands
Pre-print
17:45 - 18:15
Full-paper
An Exercise in Verifying Sequential Programs with VerCors
FTfJP
Sebastiaan Joosten, Wytse OortwijnUniversity of Twente, The Netherlands, Mohsen SafariUniversity of Twente, The Netherlands, Marieke HuismanUniversity of Twente
Pre-print