‹Programming› 2019
Mon 1 - Thu 4 April 2019 Genoa, Italy

The aim of the VPT 2019 workshop is to bring together researchers working in the fields of Program Verification and Program Transformation. There is a great potential for beneficial interactions between these two fields because: On one hand, methods and tools developed in the field of Program Transformation such as partial evaluation, fold/unfold transformations, and supercompilation, have all been applied with success for the verification of infinite state and parameterized systems. On the other hand, model checking, abstract interpretation, SAT and SMT solving and automated theorem proving have been used to enhance program transformation techniques. Moreover, the formal certification of program transformation tools, such as automated refactoring tools and compilers, has recently attracted considerable interest, posed major challenges. The workshop will provide a forum where researchers from these fields may interact and foster new developments.

Tue 2 Apr

vpt-2019-papers
08:55 - 10:30: VPT 2019 - Session 1 at Verdi
vpt-2019-papers08:55 - 09:00
Day opening
Alexei LisitsaUniversity of Liverpool , Andrei NemytykhProgram Systems Institute of RAS, Russia
vpt-2019-papers09:00 - 10:00
Talk
vpt-2019-papers10:00 - 10:30
Talk
John P. GallagherRoskilde University
vpt-2019-papers
11:00 - 12:30: VPT 2019 - Session 2 at Verdi
vpt-2019-papers11:00 - 12:00
Talk
Giorgio DelzannoDIBRIS, University of Genova
vpt-2019-papers12:00 - 12:30
Talk
Emanuele De AngelisUniversity of Chieti-Pescara, Fabio FioravantiUniversity of Chieti-Pescara, Alberto PettorossiUniversity of Rome Tor Vergata, Italy, Maurizio ProiettiCNR-IASI
vpt-2019-papers
14:00 - 15:30: VPT 2019 - Session 3 at Verdi
vpt-2019-papers14:00 - 15:00
Talk
Roberto GiacobazziUniversity of Verona and IMDEA Software Institute
vpt-2019-papers15:00 - 15:30
Talk
Vincenzo ArceriUniversity of Verona, Italy, Isabella MastroeniUniversity of Verona, Italy
vpt-2019-papers
16:00 - 17:10: VPT 2019 - Session 4 at Verdi
vpt-2019-papers16:00 - 16:20
Talk
Isaac Oscar Gariano, Marco ServettoVictoria University Wellington, New Zealand, Alex PotaninVictoria University of Wellington, Hrshikesh AroraVictoria University of Wellington, New Zealand
vpt-2019-papers16:20 - 16:40
Talk
vpt-2019-papers16:40 - 17:00
Talk
Nikolay ShilovInnopolis University
vpt-2019-papers17:00 - 17:10
Day closing
Alexei LisitsaUniversity of Liverpool , Andrei NemytykhProgram Systems Institute of RAS, Russia

Preliminary Programme

 08:55-09:00

  Welcome

 09:00-10:00

    Massimo Bartoletti (University of Cagliari, Italy). Modelling and verifying Bitcoin contracts. Massimo_Bartoletti_VPT-2019_abstract.pdf  (Invited talk)

 10:00-10:30

    John P. Gallagher. Polyvariant Program Specialisation with Property-Based Abstraction. (preprint VPT2019_paper_5.pdf , )

 10:30-11:00

  Coffee Break

 11:00-12:00

    Giorgio Delzanno (DIBRIS, Università di Genova, Italy) Validation of Internet of Things Frameworks. Giorgio_Delzanno_VPT-2019_abstract.pdf  (Invited talk)

 12:00-12:30

    Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti. Lemma Generation for Horn Clause Satisfiability: A Preliminary Study. (preprint VPT2019_paper_9.pdf , )

 12:30-14:00

  Lunch

 14:00-15:00

    Roberto Giacobazzi (Università di Verona, Italy) Hacking program analysis: a systematic approach to code protection. Roberto_Giacobazzi_VPT-2019_abstract.pdf  (Invited talk)

 15:00-15:30

    Vincenzo Arceri, Isabella Mastroeni. Static Program Analysis for String Manipulation Languages. (preprint VPT2019_paper_2.pdf , )

 15:30-16:00

  Coffee Break

 16:00-16:20

    Isaac Oscar Gariano, Marco Servetto, Alex Potanin, Hrshikesh Arora. Iteratively Composing Statically Verified Traits. (preprint VPT2019_extended_abstract_preprint_8.pdf , )

 16:20-16:40

    Antonina Nepeivoda. Verifying String Replacing Procedures by Supercompilation. (preprint VPT2019_extended_abstract_preprint_3.pdf , )

 16:40-17:00

    Nikolay V. Shilov. Study of Recursion Elimination for a Class of Semi-interpreted Recursive Program Schemata.

 17:00-17:10

  Closing

Call for Papers

The Seventh International Workshop on Verification and Program Transformation (VPT 2019) aims to bring together researchers working in the areas of Program Verification and Program Transformation.

The previous workshops in this series were:

  • VPT 2013, Saint Petersburg, Russia

  • VPT 2014, Vienna, Austria

  • VPT 2015, London, UK

  • VPT 2016, Eindhoven, The Netherlands

  • VPT 2017, Uppsala, Sweden

  • MARS/VPT 2018 Thessaloniki, Greece

The workshop solicits research, position, application, and system description papers with a special emphasis on case studies, demonstrating viability of the interactions between the research fields of program transformation and program verification in a broad sense. Also papers in related areas, such as program testing and program synthesis are welcomed. Topics of interest include, but are not limited to:

  • Verification by Program Transformation

  • Verification Techniques in Program Transformation and Synthesis

  • Verification and Certification of Programs Transformations

  • Program Analysis and Transformation

  • Program Testing and Transformation

  • Verifiable Computing and Program Transformation

  • Case studies

Important Dates

December 30th, 2018: Abstract submission deadline (optional)

January 8th, 2019: Paper submission deadline

February 15th, 2019: Acceptance notification

March 7th, 2019: Camera ready version (for the pre-proceedings)

April 2nd, 2019: Workshop

Submission Guidelines

Authors should submit an electronic copy of the paper in PDF, formatted in the Electronic Proceedings in Theoretical Computer Science LaTeX Style (http://style.eptcs.org/), via the Easychair submission website for VPT 2019.

Papers must describe original work that has not been published, or currently submitted, to a journal, conference, or workshop with refereed proceedings. Also papers that already appeared in unpublished or informally published workshop proceedings may be submitted. Each submission must include on its first page the paper title; authors and their affiliations; contact author’s email; abstract; and three to four keywords that will be used to assist the PC in selecting appropriate reviewers for the paper. Page numbers should appear on the manuscript to help the reviewers in writing their report.

Submissions should not exceed 15 pages including references but excluding well-marked appendices not intended for publication. Reviewers are not required to read the appendices, and thus papers should be intelligible without them.

Proceedings

We hope to publish the post-proceedings in the Electronic Proceedings in Theoretical Computer (EPTCS) series (http://about.eptcs.org/), as was done for previous editions of VPT. If the workshop will attract sufficiently many high quality papers, a special issue of a journal on the topic of the workshop will be considered. The special issue will be open to high quality papers accepted for presentation in previous editions of the workshop.

Program Committee:

  • Amir Ben-Amram, Academic Colledge of Tel-Aviv-Yaffo, Israel

  • Grigory Fedyukovich, Princeton University, USA

  • John Gallagher, Roskilde University, Denmark, and IMDEA Software Institute, Spain

  • Geoff W. Hamilton, Dublin City University, Republic of Ireland

  • Oleg Kiselyov, Tohoku University, Japan

  • Alexei Lisitsa, The University of Liverpool, UK (co-chair)

  • Andrei P. Nemytykh, Program Systems Institute of RAS, Russia (co-chair)

  • Alberto Pettorossi, Università di Roma Tor Vergata, Italy

  • Maurizio Proietti, IASI-CNR, Rome, Italy

  • Andrey Rybalchenko, Microsoft Research, Cambridge, UK

  • Kostis Sagonas, Uppsala University, Sweden

  • Peter Sestoft, The IT University of Copenhagen, Denmark

Organisers:

  • Alexei Lisitsa (The University of Liverpool, UK)

  • Andrei P. Nemytykh (Program Systems Institute of RAS, Russia)

Contacts

Alexei Lisitsa, a.lisitsa@csc.liv.ac.uk

Andrei P. Nemytykh, nemytykh@math.botik.ru

Web: http://refal.botik.ru/vpt/vpt2019/