POPL 2024
Sun 14 - Sat 20 January 2024 London, United Kingdom

Welcome to the website of the 25th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2024).

VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas. VMCAI 2024 will be the 25th edition in the series.

VMCAI will take place during January 15-16, 2024 as a physical (in-person) event. For each accepted paper at least one author is required to register for the conference and present the paper in person.

This event also celebrates World Logic Day 2024.

Proceedings

The proceedings are available at Part I and Part II.

Access to the proceedings will be free for the period January 10, 2024 –- February 9, 2024.

Registration

Registration for VMCAI 2024 at this link.

Please note that at least one author from each accepted paper must register specifically to VMCAI.

Visa Support Letters

If you plant to also attend POPL 2024 you can receive a visa support letter from ACM by following the process outlined here.

If you are not attending POPL 2024 and you need a visa support letter, please contact the VMCAI PC-chairs Rayna Dimitrova and Ori Lahav.

Highlights

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

Mon 15 Jan

Displayed time zone: London change

09:00 - 10:30
Session 1: Openning, Keynote, SAT, SMT and Automated ReasoningVMCAI at Marconi Room
Chair(s): Rayna Dimitrova CISPA Helmholtz Center for Information Security
09:00
5m
Day opening
Opening
VMCAI

09:05
60m
Keynote
Two Projects on Human Interaction with AI
VMCAI
David Harel Weizmann Institute of Science, Israel
10:05
20m
Talk
Interpolation and Quantifiers in Ortholattices
VMCAI
Sankalp Gambhir Ecole Polytechnique Federale de Lausanne (EPFL), Simon Guilloud École Polytechnique Fédérale de Lausanne, Viktor Kunčak EPFL, Switzerland
10:30 - 11:00
10:30
30m
Coffee break
Break
Catering

11:00 - 12:30
Session 2: SAT, SMT and Automated ReasoningVMCAI at Marconi Room
Chair(s): David Monniaux Université Grenoble Alpes - CNRS - Grenoble INP - Verimag
11:00
20m
Talk
Function synthesis for maximizing model counting
VMCAI
Thomas Vigouroux VERIMAG - UGA, Marius Bozga CNRS; Université Grenoble Alpes, Cristian Ene Verimag, Grenoble, Laurent Mounier Université Grenoble Alpes
Pre-print
11:20
20m
Talk
Boosting Constrained Horn Solving by Unsat Core Learning
VMCAI
Parosh Aziz Abdulla Uppsala University, Sweden, Chencheng Liang Uppsala University, Philipp Rümmer University of Regensburg and Uppsala University
11:40
20m
Talk
On the Verification of a Subgraph Construction Algorithm
VMCAI
Lucas Böltz Univerity of Koblenz, Viorica Sofronie-Stokkermans University of Koblenz, Hannes Frey University of Koblenz
12:00
20m
Talk
Efficient Local Search for Nonlinear Real Arithmetic
VMCAI
Zhonghan Wang Institute of Software/CAS China, Bohua Zhan Institute of Software, Chinese Academy of Sciences, Bohan Li State Key Laboratory of Computer Science Institute of Software, Chinese Academy of Sciences, Beijing, China, Shaowei Cai Institute of Software at Chinese Academy of Sciences
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:30
Session 3: Security and Privacy, Model Checking and SynthesisVMCAI at Marconi Room
Chair(s): Caterina Urban Inria & École Normale Supérieure | Université PSL
14:00
20m
Talk
Automatic and Incremental Repair for Speculative Information Leaks
VMCAI
Joachim Bard CISPA Helmholtz Center for Information Security, Swen Jacobs CISPA, Yakir Vizel Technion—Israel Institute of Technology
14:20
20m
Talk
Sound Abstract Nonexploitability Analysis
VMCAI
Francesco Parolini Sorbonne Université, Antoine Miné Sorbonne Université
Pre-print
14:40
20m
Talk
Solving Two-Player Games under Progress Assumptions
VMCAI
Anne-Kathrin Schmuck MPI-SWS, K. S. Thejaswini The University of Warwick, Irmak Saglam Max Planck Institute for Software Systems (MPI-SWS), Satya Prakash Nayak Max Planck Institute for Software Systems (MPI-SWS)
Pre-print
15:00
20m
Talk
Model-Guided Synthesis for LTL over Finite Traces
VMCAI
Shengping Xiao East China Normal University, Yongkang Li East China Normal University, Xinyue Huang East China Normal University, Yicong Xu East China Normal University, Jianwen Li East China Normal University, China, Geguang Pu East China Normal University, Ofer Strichman Technion, Moshe Vardi Rice University
15:20
10m
Talk
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
VMCAI
Daniel Hausmann University of Gothenburg, Merlin Humml Friedrich-Alexander Universität Erlangen-Nürnberg, Simon Prucker Friedrich-Alexander Universität Erlangen-Nürnberg, Lutz Schröder University of Erlangen-Nuremberg, Aaron Strahlberger Friedrich-Alexander-Universität Erlangen-Nürnberg
Pre-print
15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

16:00 - 17:30
Session 4: Infinite State Systems, Runtime VerificationVMCAI at Marconi Room
Chair(s): Helmut Seidl Technische Universität München
16:00
20m
Talk
Project and Conquer: Fast Quantifier Elimination for Checking Petri Nets Reachability
VMCAI
Nicolas Amat LAAS-CNRS, Silvano DAL ZILIO LAAS-CNRS, Didier Le Botlan LAAS-CNRS, INSA-Toulouse
Pre-print
16:20
20m
Talk
Parameterized Verification of Disjunctive Timed NetworksRecorded
VMCAI
Étienne André Université Sorbonne Paris Nord; LIPN; CNRS, Paul Eichler CISPA - Helmholtz Center for Information Security, Swen Jacobs CISPA, Shyam Karra CISPA
16:40
20m
Talk
Resilience and Home-Space for WSTS
VMCAI
Alain Finkel ENS Paris Saclay, Mathieu Hilaire ENS Paris Saclay
17:00
20m
Talk
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic
VMCAI
Ritam Raha University of Antwerp, Antwerp, Belgium, Rajarshi Roy Max Planck Institute for Software Systems, Kaiserslautern, Germany, Nathanaël Fijalkow CNRS, LaBRI, and Alan Turing Institute, Daniel Neider Technical University of Dortmund, Germany, Guillermo A. Perez University of Antwerp
Pre-print
17:20
10m
Talk
TP-DejaVu: Combining Operational and Declarative Runtime Verification
VMCAI
Klaus Havelund NASA/Caltech Jet Propulsion Laboratory, Panagiotis Katsaros Aristotle University of Thessaloniki, Moran Omer Bar Ilan University, Israel, Doron Peled Bar Ilan University, Anastasios Temperekidis Aristotle University of Thessaloniki

Tue 16 Jan

Displayed time zone: London change

09:00 - 10:30
Session 5: keynote, Program and System VerificationVMCAI at Marconi Room
Chair(s): Ori Lahav Tel Aviv University
09:00
60m
Keynote
Automating Relational Verification of Infinite-State Programs
VMCAI
Hiroshi Unno University of Tsukuba
10:00
20m
Talk
Deductive Verification of Parameterized Embedded Systems modeled in SystemC
VMCAI
Philip Tasche University of Twente, Raúl E. Monti University of Twente, Stefanie Eva Drerup University of Münster, Pauline Blohm Uni Münster, Paula Herber University of Munster, Germany, Marieke Huisman University of Twente
10:20
10m
Talk
Automatically Enforcing Rust Trait Properties
VMCAI
Twain Byrnes Carnegie Mellon University, Yoshiki Takashima Carnegie Mellon University, Limin Jia Carnegie Mellon University
10:30 - 11:00
10:30 - 11:00
10:30
30m
Coffee break
Break
Catering

11:00 - 12:30
Session 6: Abstract InterpretationVMCAI at Marconi Room
Chair(s): Xavier Rival Inria; ENS; CNRS; PSL University
11:00
20m
Talk
Formal Runtime Error Detection During Development in the Automotive Industry
VMCAI
Jesko Hecking-Harbusch Bosch Research, Jochen Quante Bosch Research, Maximilian Schlund Bosch Research
Pre-print
11:20
20m
Talk
Abstract Interpretation-Based Feature Importance for Support Vector Machines
VMCAI
Abhinandan Pal University of Birmingham, Francesco Ranzato University of Padova, Caterina Urban Inria & École Normale Supérieure | Université PSL, Marco Zanella University of Padova, Italy
11:40
20m
Talk
Generation of Violation Witnesses by Under-Approximating Abstract Interpretation
VMCAI
Marco Milanese Sorbonne University, Antoine Miné Sorbonne Université
Pre-print
12:00
20m
Talk
Correctness Witness Validation by Abstract Interpretation
VMCAI
Simmo Saan University of Tartu, Estonia, Michael Schwarz Technische Universität München, Julian Erhard Technical University of Munich, Helmut Seidl Technische Universität München, Sarah Tilscher Technische Universität München, Vesal Vojdani University of Tartu
DOI Pre-print
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:30
Session 7: Probabilistic and Quantum Programs, Neural NetworksVMCAI at Marconi Room
Chair(s): Andreas Podelski University of Freiburg
14:00
20m
Talk
Guaranteed inference for probabilistic programs: a parallelisable, small-step operational approach
VMCAI
Michele Boreale Università di Firenze, Luisa Collodi University of Florence
14:20
20m
Talk
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
VMCAI
Yuxin Deng East China Normal University, Huiling Wu East China Normal University, Ming Xu East China Normal University
14:40
20m
Talk
Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Training
VMCAI
Jiaxu Tian East China Normal University, Dapeng Zhi East China Normal University, Si Liu ETH Zurich, Peixin Wang University of Oxford, Guy Katz Hebrew University, Min Zhang East China Normal University
15:00
20m
Talk
Verification of Neural Networks’ Local Differential Classification Privacy
VMCAI
Roie Reshef Technion, Anan Kabaha Technion, Israel Institute of Technology, Olga Seleznova Technion, Dana Drachsler Cohen Technion
15:20
10m
Talk
AGNES: Abstraction-guided Framework for Deep Neural Networks Security
VMCAI
15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

15:30 - 16:00
15:30
30m
Coffee break
Break
Catering

16:00 - 17:30
Session 8: Concurrency, Program and System Verification, ClosingVMCAI at Marconi Room
Chair(s): Viktor Kunčak EPFL, Switzerland
16:00
20m
Talk
Petrification: Software Model Checking for Programs with Dynamic Thread Management
VMCAI
Matthias Heizmann University of Freiburg, Germany, Dominik Klumpp University of Freiburg, Lars Nitzke University of Freiburg, Frank Schüssele University of Freiburg
Pre-print
16:20
20m
Talk
A Fully Verified Persistency Library
VMCAI
Stefan Bodenmüller University of Augsburg, John Derrick , Brijesh Dongol University of Surrey, Gerhard Schellhorn Universitaet Augsburg, Heike Wehrheim University of Oldenburg
16:40
20m
Talk
A Navigation Logic for Recursive Programs with Dynamic Thread Creation
VMCAI
Roman Lakenbrink University of Münster, Markus Müller-Olm University of Münster, Christoph Ohrem University of Münster, Jens Oliver Gutsfeld Westfälische Wilhelm-Universität Münster (WWU), Germany
Pre-print
17:00
20m
Talk
Borrowable Fractional Ownership Types for Verification
VMCAI
Takashi Nakayama The University of Tokyo, Yusuke Matsushita The University of Tokyo, Ken Sakayori University of Tokyo, Ryosuke Sato University of Tokyo, Naoki Kobayashi University of Tokyo
Pre-print
17:20
10m
Day closing
Closing (+ best paper award announcement)
VMCAI

Accepted Papers

Title
Abstract Interpretation-Based Feature Importance for Support Vector Machines
VMCAI
A Fully Verified Persistency Library
VMCAI
AGNES: Abstraction-guided Framework for Deep Neural Networks Security
VMCAI
A Navigation Logic for Recursive Programs with Dynamic Thread Creation
VMCAI
Pre-print
Automatically Enforcing Rust Trait Properties
VMCAI
Automatic and Incremental Repair for Speculative Information Leaks
VMCAI
Boosting Constrained Horn Solving by Unsat Core Learning
VMCAI
Borrowable Fractional Ownership Types for Verification
VMCAI
Pre-print
Correctness Witness Validation by Abstract Interpretation
VMCAI
DOI Pre-print
Deductive Verification of Parameterized Embedded Systems modeled in SystemC
VMCAI
Efficient Local Search for Nonlinear Real Arithmetic
VMCAI
Formal Runtime Error Detection During Development in the Automotive Industry
VMCAI
Pre-print
Function synthesis for maximizing model counting
VMCAI
Pre-print
Generation of Violation Witnesses by Under-Approximating Abstract Interpretation
VMCAI
Pre-print
Generic Model Checking for Modal Fixpoint Logics in COOL-MC
VMCAI
Pre-print
Guaranteed inference for probabilistic programs: a parallelisable, small-step operational approach
VMCAI
Interpolation and Quantifiers in Ortholattices
VMCAI
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs
VMCAI
Model-Guided Synthesis for LTL over Finite Traces
VMCAI
On the Verification of a Subgraph Construction Algorithm
VMCAI
Parameterized Verification of Disjunctive Timed NetworksRecorded
VMCAI
Petrification: Software Model Checking for Programs with Dynamic Thread Management
VMCAI
Pre-print
Project and Conquer: Fast Quantifier Elimination for Checking Petri Nets Reachability
VMCAI
Pre-print
Resilience and Home-Space for WSTS
VMCAI
Solving Two-Player Games under Progress Assumptions
VMCAI
Pre-print
Sound Abstract Nonexploitability Analysis
VMCAI
Pre-print
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic
VMCAI
Pre-print
Taming Reachability Analysis of DNN-Controlled Systems via Abstraction-Based Training
VMCAI
TP-DejaVu: Combining Operational and Declarative Runtime Verification
VMCAI
Verification of Neural Networks’ Local Differential Classification Privacy
VMCAI

Call for Papers

VMCAI 2024 is the 25th International Conference on Verification, Model Checking, and Abstract Interpretation. The conference will be held during January 15-16, 2024. VMCAI provides a forum for researchers from the communities of Verification, Model Checking, and Abstract Interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods that combine these and related areas.

Scope

The program will consist of refereed research papers as well as invited lectures and tutorials. Research contributions can report new results as well as experimental evaluations and comparisons of existing techniques.

Topics include, but are not limited to:

  • Program Verification
  • Model Checking
  • Abstract Interpretation
  • Abstract Domains
  • Program Synthesis
  • Static Analysis
  • Type Systems
  • Deductive Methods
  • Program Logics
  • First-Order Theories
  • Decision Procedures
  • Interpolation
  • Horn Clause Solving
  • Program Certification
  • Separation Logic
  • Probabilistic Programming and Analysis
  • Error Diagnosis
  • Detection of Bugs and Security Vulnerabilities
  • Program Transformations
  • Hybrid and Cyber-physical Systems
  • Concurrent and distributed Systems
  • Analysis of numerical properties
  • Analysis of smart contracts
  • Analysis of neural networks
  • Case Studies on all of the above topics

Submissions can address any programming paradigm, including concurrent, constraint, functional, imperative, logic, and object-oriented programming.

Important Dates AoE (UTC-12)

September 7th (extended) August 31st: Paper submission

October 11th, 2023: Notification

November 2nd, 2023: Camera-ready version due

Submissions

Submissions are required to follow Springer’s LNCS format. The page limit depends on the paper’s category (see below). In each category, additional material beyond the page limit may be placed in a clearly marked appendix, to be read at the discretion of the reviewers and to be omitted in the final version. Formatting style files and further guidelines for formatting can be found at the Springer website. Submission is via EasyChair.

All accepted papers will be published in Springer’s Lecture Notes in Computer Science series. The corresponding author of each paper will need to complete and sign a License-to-Publish form to be submitted together with the camera-ready version.

Submissions will undergo a single-blind review process. There will be three categories of papers: regular papers, tool papers and case studies. Papers in each category have a different page limit and will be evaluated differently.

Regular papers clearly identify and justify an advance to the field of verification, abstract interpretation, or model checking. Where applicable, they are supported by experimental validation. Regular papers are restricted to 20 pages in LNCS format, not counting references.

Tool papers present a new tool, a new tool component, or novel extensions to an existing tool. They should provide a short description of the theoretical foundations with relevant citations, and emphasize the design and implementation concerns, including software architecture and core data structures. A regular tool paper should give a clear account of the tool’s functionality, discuss the tool’s practical capabilities with reference to the type and size of problems it can handle, describe experience with realistic case studies, and where applicable, provide a rigorous experimental evaluation. Papers that present extensions to existing tools should clearly focus on the improvements or extensions with respect to previously published versions of the tool, preferably substantiated by data on enhancements in terms of resources and capabilities. Authors are strongly encouraged to make their tools publicly available and submit an artifact. Tool papers are restricted to 12 pages in LNCS format, not counting references.

Case studies are expected to describe the use of verification, model checking, and abstract interpretation techniques in new application domains or industrial settings. Papers in this category do not necessarily need to present original research results but are expected to contain novel applications of formal methods techniques as well as an evaluation of these techniques in the chosen application domain. Such papers are encouraged to discuss the unique challenges of transferring research ideas to a real-world setting and reflect on any lessons learned from this technology transfer experience. Case study papers are restricted to 20 pages in LNCS format, not counting references. (Shorter case study papers are also welcome.)

Call for Artifacts

VMCAI 2024 makes available the option to submit an artifact along with a paper. Artifacts are any additional material that substantiates the claims made in the paper, and ideally makes them fully replicable. For some papers, these artifacts are as important as the paper itself because they provide crucial evidence for the quality of the results. The goal of artifact evaluation is twofold. On the one hand, we want to encourage authors to provide more substantial evidence to their papers and to reward authors who create artifacts. On the other hand, we want to simplify the independent replication of results presented in the paper and to ease future comparison with existing approaches. Artifacts of interest include (but are not limited to):

  • Software, Tools, or Frameworks
  • Data sets
  • Test suites
  • Machine checkable proofs
  • Any combination of them
  • Any other artifact described in the paper

Artifact submission is optional. However, we highly encourage all authors to also submit an artifact. A successfully evaluated artifact can increase your chance of being accepted since the evaluation result of your artifact is taken into account during paper reviewing.

Artifact evaluation is singly blind, artifacts do not need to be anonymous.

Badges

We award three types of badges, following the ACM guidelines:

  • Available for artifacts that are publically available under a DOI.
  • Functional for artifacts that are successfully evaluated by the artifact evaluation committee.
  • Reusable for functional artifacts that exceed in quality and additionally provide careful documentation to allow for future repurposing.

Important Dates AoE (UTC-12)

The artifact evaluation will be done in parallel with the evaluation of the submitted paper. The artifact submission deadline is 1 week after the paper submission.

What When (updated)
Artifact submission opens August 15 August 28, 2023
Artifact submission deadline September 7 September 14, 2023
Artifact test phase notification      September 27 September 30, 2023
Artifact clarification period September 27 – October 1 September 30 – October 4, 2023
Artifact notification October 24, 2023


All artifacts are evaluated by the artifact evaluation committee. Each artifact will be reviewed by at least two committee members. Reviewers will read the paper and explore the artifact to evaluate how well the artifact supports the claims and results of the paper. The evaluation is based on the following questions.

  • Is the artifact consistent with the paper and the claims made by the paper?
  • Are the results of the paper replicable through the artifact?
  • Is the artifact complete, i.e., how many of the results of the paper are replicable?
  • Is the artifact well-documented?
  • Is the artifact easy to use?

The artifact evaluation is performed in the following two phases.

  • In the test phase, reviewers check if the artifact is functional, i.e., they look for setup problems (e.g., corrupted, missing files, crashes on simple examples, etc.). If any problems are detected, the authors are informed of the outcome and asked for clarification. The authors will get 3 days to respond to the reviews in case problems are encountered.
  • In the assessment phase, reviewers will try to reproduce any experiments or activities and evaluate the artifact wrt. the questions detailed above.

Artifact Submission

Submission page: https://easychair.org/conferences/?conf=vmcai2024ae

An artifact submission consist of:

  • the title “[artifactNN] XX” where XX is the title of your paper and NN is its submission number,
  • an abstract that summarizes the artifact and explains its relation to the paper,
  • a URL (preferably a DOI) from which a .zip or .tar.gz archive file containing the artifact can be downloaded,
  • the SHA256 checksum of the archive file, and
  • a .pdf file of the submitted paper.

The URL must be a Zenodo, Figshare, Google Drive, Dropbox, Github, Bitbucket, or (public) Gitlab URL, to help protect the anonymity of the reviewers.

You can generate the checksum using the following command-line tools:

  • Linux: sha256sum <file>
  • Windows: CertUtil -hashfile <file> SHA256
  • MacOS: shasum -a 256 <file>

Submission Contents

Your artifact archive file must contain the following:

  1. The main artifact, i.e., data, software, libraries, scripts, etc. required to replicate the results of your paper.

    • We recommend you provide easy to use scripts for the user to reproduce the results.
    • The review will be singly blind. Please make sure that you do not (accidentally) learn the identify of the reviewers (e.g., through analytics, logging).
  2. A LICENSE file. Your license needs to allow the artifact evaluation chairs to download and distribute the artifact to the artifact evaluation committee members and the artifact evaluation committee members must be allowed to evaluate the artifact, e.g., use, execute, and modify the artifact for the purpose of artifact evaluation.

  3. A README.pdf that introduces the artifact to the user and guides the user through the replication of your results. Ideally, it should consist of the following parts:

    1. A Getting Started Guide detailing how to set up the artifact and prepare it for replicating the results from the paper. We would appreciate it if you supported the reviewers not only for the main review phase but also for the testing phase. To this end, it would be helpful to provide instructions that allow installation and rudimentary testing (i.e., in such a way that technical difficulties would pop up) in as little time as possible.

    2. Step-by-Step Instructions for replicating the results from the paper.

      • Please document which claims or results of the paper can be replicated with the artifact and how (e.g., which experiment must be performed). Please also explain which claims and results cannot be replicated and why.
      • Describe in detail how to replicate the results in the paper, especially describe the steps that need to be performed to replicate the results in the paper. To simplify the reviewing process, we recommend to provide evaluation scripts (where applicable).
      • Precisely state the resource requirements (RAM, number of cores, CPU frequency, etc.), which you used to test your artifact.
      • For tasks that require a large amount of resources (hardware or time), we recommend to provide a possibility to replicate a subset of the results with reasonably modest resource and time limits, e.g., within 8 hours on a reasonable personal computer. In this case, please also include a script to replicate only a subset of the results.

Artifact Packaging Guidelines

The preferred way to package your artifact is a Docker image. This is to ensure that your artifact can be run on both traditional x86 (e.g. AMD and Intel processors) and newer arm (e.g. Apple Silicon) platforms. To ensure that your artifact performs similarly on x86 and arm, we recommend you submit one of the following:

  • a Docker build script (i.e. a Dockerfile) if building the Docker image runs in reasonable time, or
  • pre-compiled Docker images for x86 and arm platforms.

Beware: if you provide only an x86 image then Docker will emulate it on arm platforms, and vice versa. Emulation will significantly impair performance.

Docker Images

Below is a quick start guide for producing Docker images provided you have an adequate Dockerfile to generate you artifact. Please refer to the official Docker documentation, in particular the one for cross-compilation for further details and troubleshooting.

To create and export a Docker image native to your platform, you can do:

  docker build . -t <artifact-name>:latest
  docker save -o <artifact-name>_<your_arch>.tar <artifact-name>:latest

For cross-compilation, Docker version 19.03 or newer provides buildx on most platforms. First, create a new cross-compile builder:

docker buildx create --name mybuilder --driver docker-container --bootstrap
docker buildx use mybuilder

Then, cross-compile and export a Docker image:

  docker buildx build --platform linux/<other_arch> -t <artifact-name>:latest --load .
  docker save -o <artifact-name>_<other_arch>.tar <artifact-name>:latest

We recommend that you compress the resulting Docker images to reduce the overall size of you artifact. Please use a compression that is compatible with Docker load, i.e., please use either gz or xz.

Virtual Machines

We discourage to package artifacts as virtual machine images as they are tricky if not impossible to run under MacOS running on Apple Silicon. However, should you be unable to use Docker, we will accept virtual machines compatible with VirtualBox. Please indicate the use of a virtual machine image and the platform it is intended for in the abstract of your submission.

Publication of Artifacts

The artifact evaluation committee uses the submitted artifact only for the artifact evaluation. It may not publicize the artifact or any parts of it during or after completing evaluation. Artifacts and all associated data will be deleted at the end of the evaluation process. We encourage the authors of artifacts to make their artifacts also permanently available, e.g., on Zenodo or figshare, and refer to them in their papers via a DOI. All artifacts for which a DOI exists that is known to the artifact evaluation committee are granted the availability badge.

Sponsorship

VMCAI is welcoming diamond, silver and bronze sponsors.

The receiver of the best paper award at VMCAI 2024 is the paper “Correctness Witness Validation by Abstract Interpretation”. Congratulations to the authors Simmo Saan, Michael Schwarz, Julian Erhard, Helmut Seidl, Sarah Tilscher, and Vesal Vojdani!

The prize for the award is generously sponsored by Springer.

Questions? Use the VMCAI contact form.