[TYPES/announce] 26th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI 2025)

[Ashutosh Trivedi]

*******************************************************************************
                                CALL FOR PAPERS
   26th International Conference on Verification, Model Checking, and Abstract
                                Interpretation
                                 VMCAI 2025
                             January 20-21, 2025
          https://urldefense.com/v3/__https://conf.researchr.org/home/VMCAI-2025__;!!IBzWLUs!Qg1h6hzjXagfBnHEy5Rq3viBppszaoTy7Cp7Dgf8HWLTOihxcQa0h5_sVWAbBlF_JEqxju_Zq3ngs2uTphm5wfQtwagJ6KNPtZjWIMv2zU4LQw$ 
*******************************************************************************

**Please note deadline extension for VMCAI 2025 below.**

[VMCAI 2025 Conference Website](https://urldefense.com/v3/__https://conf.researchr.org/home/VMCAI-2025__;!!IBzWLUs!Qg1h6hzjXagfBnHEy5Rq3viBppszaoTy7Cp7Dgf8HWLTOihxcQa0h5_sVWAbBlF_JEqxju_Zq3ngs2uTphm5wfQtwagJ6KNPtZjWIMv2zU4LQw$ )

**VMCAI 2025** is the 26th International Conference on Verification, Model Checking, and Abstract Interpretation. The conference will be held during January 20-21, 2025. 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)

- **October 1, 2024 AOE**: Paper submission deadline (extended).
- **November 8, 2024**: Notification
- **November 22, 2024**: 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. Note: submissions will open on August 26th.

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. Submissions should not be anonymized for the purposes of review. 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.)

--
Ashutosh Trivedi
Associate Professor
Department of Computer Science
University of Colorado Boulder
Boulder, Colorado 80309

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://LISTS.SEAS.UPENN.EDU/pipermail/types-announce/attachments/20240917/78b2b15c/attachment-0001.htm>