FTfJP 2017 (Formal Techniques for Java-like Programs)
FTfJP is an established workshop, running annually since 1999 alongside ECOOP. Its goal is to bring together people working on formal techniques and tool support for Java, or closely related languages such as C# or Scala, either with the aim to describe, analyse, and verify aspects and properties of these programming languages themselves (type systems, semantics, bytecode verification, etc.), or of programs written in these languages.
- Werner Dietl (chair)
- Sophia Drossopoulou
- Gary T. Leavens
- K. Rustan M. Leino
- Rosemary Monahan
- Peter Müller
For more information about the series of workshops, see https://ftfjp.bitbucket.io/.
Tue 20 Jun
|09:30 - 09:50|
|09:50 - 10:25|
|10:25 - 10:30|
|11:00 - 11:20|
|11:20 - 12:30|
|14:00 - 14:20|
|14:20 - 14:55|
|14:55 - 15:30|
|16:00 - 16:20|
|16:20 - 16:55|
|16:55 - 17:30|
Call for Papers
Contributions related to formal techniques for Java-like programs are sought in two categories:
Technical Work. In 6 two-column pages, the paper should present a technical contribution. We welcome both complete and incomplete results, as long as they are substantial enough to stimulate discussion on future research directions.
Position Paper. In 2 two-column pages, the paper should advocate a promising research direction. Using this format, we encourage established researchers to set out their vision, and we also encourage beginning researchers to plan their path to a PhD.
Both types of contributions will benefit from feedback received at the workshop. Both theory and tools are welcome. Topics include but are not limited to
- model checking
- program analysis (static or dynamic)
- verification (traditional, quantitative, at runtime, …)
- language design (for programs or specifications)
- proof engineering
- pearls (proofs or programs)
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, if the authors wish so. The use of ACM’s template with the SIGPLAN format is required. Submissions are by default not double blind. If you wish to anonymize your submission, contact the PC chair.
Iris: A Modular Foundation for Higher-Order Concurrent Separation Logic
Derek Dreyer, Max Planck Institute for Software Systems
Iris is a generic framework for higher-order concurrent separation logic, which supports the derivation of a wide variety of advanced program logics for a range of different programming languages and comes equipped with strong tactic support for proving concurrent programs correct in the Coq proof assistant (http://iris-project.org/). Although originating in 2013 from the ashes of a failed book-writing project between me and Lars Birkedal, Iris has since morphed into a serious development platform for multiple ongoing research efforts in interactive program verification. In this talk, I will give a tutorial introduction to some of the key ideas in Iris, offer some historical context about how Iris has evolved over time, and briefly describe some of the many projects that are currently using Iris to get stuff done.
This is joint work with Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Ales Bizjak, Hoang-Hai Dang, Jan-Oliver Kaiser, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Amin Timany, Zhen Zhang, and Lars Birkedal.