ATVA 2025
Mon 27 - Fri 31 October 2025 Bengaluru, India
Dates
Tracks
Plenary
You're viewing the program in a time zone which is different from your device's time zone change time zone

Mon 27 Oct

Displayed time zone: Chennai, Kolkata, Mumbai, New Delhi change

08:30 - 09:30
08:30
60m
Registration
ATVA/APLAS Registration
Invited Talks

Tue 28 Oct

Displayed time zone: Chennai, Kolkata, Mumbai, New Delhi change

08:30 - 09:15
08:30
45m
Registration
ATVA/APLAS Registration
Invited Talks

09:15 - 09:30
09:15
15m
Day opening
Opening Remarks
Invited Talks

09:30 - 10:30
Invited Talk 1Invited Talks at Amantran
Chair(s): Alex Potanin Australian National University

(Joint APLAS-ATVA Invited Talk)

09:30
60m
Talk
15 Years of Viper: Building and Evolving a Verification Infrastructure
Invited Talks
Peter Müller ETH Zurich
10:30 - 11:00
10:30
30m
Coffee break
Coffee Break
Catering

11:00 - 12:30
AutomataATVA Papers at R102
Chair(s): Srinivas Pinisetty Indian Institute of Technology Bhubaneswar
11:00
30m
Paper
Componentwise Automata Learning for System IntegrationDistinguished Paper
ATVA Papers
Hiroya Fujinami , Masaki Waga Kyoto University, Jie An Institute of Software Chinese Academy of Sciences, Kohei Suenaga Graduate School of Informatics, Kyoto University, Nayuta Yanagisawa , Hiroki Iseri NPO ASTER Minato-ku, Tokyo, Ichiro Hasuo National Institute of Informatics, Japan
11:30
30m
Paper
Learning Event-recording Automata Passively
ATVA Papers
Anirban Majumdar , Sayan Mukherjee Univ Rennes, Inria, CNRS, IRISA, France, Jean-François Raskin Université Libre de Bruxelles
12:00
15m
Paper
TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets (tool paper)
ATVA Papers
Bruno Maria René Gonzalez TU Berlin, Germany, Peter Gjøl Jensen Aalborg University, Denmark, Jiri Srba , Stefan Schmid TU Berlin, Germany, Martin Zimmermann University of Liverpool
11:00 - 12:30
Type Systems, Safety, and VerificationAPLAS Papers at R104
Chair(s): Alex Potanin Australian National University
11:00
30m
Paper
Memory Safety: Uniqueness as Separation
APLAS Papers
Pilar Selene Linares Arévalo University of Melbourne, Arthur Azevedo de Amorim Rochester Institute of Technology, USA, Vincent Jackson University of Melbourne, Liam O'Connor Australian National University, Peter Schachte The University of Melbourne, Christine Rizkallah University of Melbourne
11:30
30m
Paper
Fair Termination for Resource-Aware Active Objects
APLAS Papers
Francesco Dagnino , Paola Giannini University of Eastern Piedmont, Violet Ka I Pun Western Norway University of Applied Sciences, Ulises Torrella Høgskulen på Vestlandet
12:00
30m
Paper
A Formal Foundation for Equational Reasoning on Probabilistic Programs
APLAS Papers
Reynald Affeldt National Institute of Advanced Industrial Science and Technology (AIST), Japan, Yoshihiro Ishiguro , Zachary Stone The MathComp-Analysis development team
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:30
Verification IATVA Papers at R102
Chair(s): Kartik Nagar IIT Madras
14:00
30m
Paper
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
ATVA Papers
Michaël Cadilhac , Vanessa Fluegel University of Antwerp, Antwerp, Belgium, Guillermo A. Perez University of Antwerp, Shrisha Rao University of Antwerp, Antwerp, Belgium
14:30
30m
Paper
Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
ATVA Papers
Linus Heck Radboud University, Tim Quatmann RWTH Aachen University, Jip Spel RWTH Aachen University, Joost-Pieter Katoen RWTH Aachen University, Sebastian Junges Radboud University
15:00
30m
Paper
Antarbhukti: Verifying Correctness of PLC Software during System Evolution
ATVA Papers
Soumyadip Bandyopadhyay ACM Member, Santonu Sarkar BITS Pilani, India
Pre-print
14:00 - 15:30
Control, Effects, and DecidabilityAPLAS Papers at R104
Chair(s): Sanjiva Prasad Indian Institute of Technology Delhi
14:00
30m
Paper
Reachability is Decidable for ATM-Typable Finitary PCF with Effect Handlers
APLAS Papers
Ryunosuke Endo Waseda University, Tachio Terauchi Waseda University
14:30
30m
Paper
Expressive Power of One-Shot Control Operators and Coroutines
APLAS Papers
Kentaro Kobayashi University of Tsukuba, Yukiyoshi Kameyama University of Tsukuba
15:00
30m
Paper
Positive Sharing and Abstract Machines
APLAS Papers
Beniamino Accattoli Inria & Ecole Polytechnique, Claudio Sacerdoti Coen University of Bologna, Jui-Hsuan Wu CNRS - ENS Lyon - Université Claude Bernard Lyon 1 - LIP - UMR 5668
15:30 - 16:00
15:30
30m
Coffee break
Coffee Break
Catering

16:00 - 17:15
Hybrid and Dynamical SystemsATVA Papers at R102
Chair(s): Govind Rajanbabu Uppsala University
16:00
30m
Paper
Control Closure Certificates
ATVA Papers
Vishnu Murali University of Colorado Boulder, Mohammed Adib Oumer University of Colorado Boulder, Majid Zamani
16:30
30m
Paper
Deriving Liveness Properties of Hybrid Systems from Reachable Sets and Lyapunov-like Certificates
ATVA Papers
Ludovico Battista Fondazione Bruno Kessler (FBK), Stefano Tonetta tonettas@fbk.eu
17:00
15m
Paper
Evaluation, Reduction, and Approximation of Dynamical Systems and Networks with ERODE (tool paper)
ATVA Papers
Luca Cardelli Microsoft Research and University of Oxford, Giuseppe Squillace , Mirco Tribastone IMT Institute for Advanced Studies Lucca, Italy, Max Tschaikowski IMT Institute for Advanced Studies Lucca, Italy, Andrea Vandin DTU, Denmark
16:00 - 17:00
Quantum Programming and LogicAPLAS Papers at R104
Chair(s): Alex Potanin Australian National University
16:00
30m
Paper
IMALL with a Mixed-State Modality: A Logical Approach to Quantum Computation
APLAS Papers
Kinnari Dave Université Paris-Saclay, CNRS, ENS Paris-Saclay, Inria, Laboratoire Méthodes Formelles, Alejandro Díaz-Caro INRIA / LORIA & UNQ, Vladimir Zamdzhiev Inria
16:30
30m
Paper
A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
APLAS Papers
Alejandro Díaz-Caro INRIA / LORIA & UNQ, Nicolas A. Monzon Universidad de la República & Universidad Argentina de la Empresa
17:15 - 17:45
17:15
30m
Meeting
Business Meeting
Invited Talks

Wed 29 Oct

Displayed time zone: Chennai, Kolkata, Mumbai, New Delhi change

09:00 - 09:30
APLAS SRC Poster Session 1APLAS Papers at R207
09:30 - 10:30
Invited Talk 2Invited Talks at Amantran
Chair(s): Meenakshi D'Souza IIITB - International Institute of Information Technology Bangalore
09:30
60m
Talk
Network Abstractions for Modularity and Performance Verification
Invited Talks
Aarti Gupta Princeton University
10:30 - 11:00
10:30
30m
Coffee break
Coffee Break
Catering

10:30 - 11:00
APLAS SRC Poster Session 2APLAS Papers at R207
11:00 - 12:30
GamesATVA Papers at R102
Chair(s): Sayan Mukherjee Univ Rennes, Inria, CNRS, IRISA, France
11:00
30m
Paper
Energy Games with Weight Uncertainty
ATVA Papers
Orna Kupferman Hebrew University, Naama Shamash Halevy The Hebrew University
11:30
30m
Paper
Quantitative Strategy Templates
ATVA Papers
Ashwani Anand Max Planck Institute for Software Systems, Satya Prakash Nayak Max Planck Institute for Software Systems (MPI-SWS), Ritam Raha University of Antwerp, Antwerp, Belgium, Irmak Saglam Max Planck Institute for Software Systems (MPI-SWS), Anne-Kathrin Schmuck Max Planck Institute for Software Systems
12:00
30m
Paper
Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games
ATVA Papers
Kittiphon Phalakarn National Institute of Informatics, Yun Chen Tsai National Institute of Informatics, Japan, Ichiro Hasuo National Institute of Informatics, Japan
11:00 - 12:30
Program Analysis, Specifications, and Decision ProceduresAPLAS Papers at R104
Chair(s): PRITAM MANOHAR GHARAT Microsoft Research India
11:00
30m
Paper
Checking Consistency of Event-driven Traces
APLAS Papers
Parosh Aziz Abdulla Uppsala University; Mälardalen University, Mohamed Faouzi Atig Uppsala University, Sweden, Samuel Grahn Uppsala University, Govind Rajanbabu Uppsala University, Ramanathan S. Thinniyam Uppsala University
11:30
30m
Paper
Specification Inference modulo Oracles for Database-backed Web Applications
APLAS Papers
12:00
30m
Paper
Decision Procedures for A Theory of String Sequences
APLAS Papers
Denghang Hu Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences, Taolue Chen Birkbeck, University of London, Philipp Ruemmer University of Regensburg and Uppsala University, Fu Song Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences; Nanjing Institute of Software Technology, Zhilin Wu Institute of Software at Chinese Academy of Sciences; University of Chinese Academy of Sciences
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

13:00 - 14:00
APLAS SRC 1APLAS Papers at R104
14:00 - 15:30
Monitoring and Runtime VerificationATVA Papers at R102
Chair(s): Ichiro Hasuo National Institute of Informatics, Japan
14:00
30m
Paper
Efficient Dynamic Shielding for Parametric Safety Specifications
ATVA Papers
Davide Corsi University of California, Irvine, Kaushik Mallik IST Austria, Austria, Andoni Rodríguez IMDEA Software Institute, Spain, César Sánchez IMDEA Software Institute
14:30
30m
Paper
Learning Verified Monitors for Hidden Markov Models
ATVA Papers
Luko van der Maas Radboud University Nijmegen, Netherlands, Sebastian Junges Radboud University
15:00
30m
Paper
Prompt Runtime Enforcement
ATVA Papers
Ayush Anand Indian Institute of Technology Bhubaneswar, Loïc Germerie Guizouarn University of Rennes, France / Inria, France / CNRS, France / IRISA, France, Thierry Jéron INRIA, Sayan Mukherjee Univ Rennes, Inria, CNRS, IRISA, France, Srinivas Pinisetty Indian Institute of Technology Bhubaneswar, Ocan Sankur University of Rennes, France / Inria, France / CNRS, France / IRISA, France
14:00 - 15:00
AI and Compiler Optimisation for PerformanceAPLAS Papers at R104
Chair(s): Meenakshi D'Souza IIITB - International Institute of Information Technology Bangalore
14:00
30m
Paper
ELTC: An End-to-End Large Language Model-Based Tensor Compilation Optimization Framework
APLAS Papers
wenbo ma Tiangong University, qingzeng song Tiangong University, yongjiang xue Tiangong University, Fei Qiao Tsinghua University, mingze sun Tiangong University
14:30
30m
Paper
Performance Optimization of HPC Workloads in Cloud Using AI-Driven Algorithms
APLAS Papers
15:00 - 15:30
APLAS SRC 2APLAS Papers at R104
15:30 - 16:00
15:30
30m
Coffee break
Coffee Break
Catering

16:00 - 19:00
16:00
3h
Break
Excursion
Catering

Thu 30 Oct

Displayed time zone: Chennai, Kolkata, Mumbai, New Delhi change

09:30 - 10:30
Invited Talk 3Invited Talks at Amantran
Chair(s): Deepak D'Souza Indian Institute of Science
09:30
60m
Talk
LLMs meet Program Synthesis
Invited Talks
Rahul Sharma Microsoft Research
10:30 - 11:00
10:30
30m
Coffee break
Coffee Break
Catering

11:00 - 12:30
LearningATVA Papers at R102
Chair(s): Kittiphon Phalakarn National Institute of Informatics
11:00
30m
Paper
Inductive Generalization in Reinforcement Learning from Specifications
ATVA Papers
Vignesh Subramanian Georgia Institute of Technology, Rohit Kushwah , Subhajit Roy IIT Kanpur, Suguman Bansal Georgia Institute of Technology, USA
11:30
30m
Paper
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
ATVA Papers
Aniruddha Joshi UC Berkeley, Supratik Chakraborty IIT Bombay, S. Akshay , Shetal Shah IIT Bombay, India, Hazem Torfah Chalmers University of Technology, Sanjit Seshia UC Berkeley
12:00
30m
Paper
Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification
ATVA Papers
Yuke Liao CNRS@CREATE, Singapore, Blaise Genest IPAL - CNRS - CNRS@CREATE, Kuldeep S. Meel National University of Singapore, Shaan Aryaman NYU
12:30 - 14:00
12:30
90m
Lunch
Lunch
Catering

14:00 - 15:00
Verification IIATVA Papers at R102
Chair(s): Ahmed Bouajjani IRIF, Université Paris Diderot
14:00
30m
Paper
Towards Unified Probabilistic Verification and Validation of Vision based Autonomy
ATVA Papers
Jordan Peper University of Florida, USA, Yan Miao University of Illinois Urbana-Champaign, Sayan Mitra University of Illinois at Urbana-Champaign, Ivan Ruchkin University of Florida
14:30
15m
Paper
PolyQEnt: A Polynomial Quantified Entailment Solver (tool paper)Distinguished Tool Paper
ATVA Papers
Krishnendu Chatterjee IST Austria, Amir Kafshdar Goharshady University of Oxford, Ehsan Kafshdar Goharshady , Mehrdad Karrabi , Milad Saadat Sharif University of Technology, Iran, Maximilian Seeliger Vienna University of Technology, Austria, Đorđe Žikelić Singapore Management University, Singapore
14:45
15m
Paper
Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing (tool paper)
ATVA Papers
Sebastiaan Brand , Alfons Laarman Leiden University
16:00 - 16:30
16:00
30m
Coffee break
Coffee Break
Catering

Accepted Papers

Title
Antarbhukti: Verifying Correctness of PLC Software during System Evolution
ATVA Papers
Pre-print
Componentwise Automata Learning for System IntegrationDistinguished Paper
ATVA Papers
Control Closure Certificates
ATVA Papers
Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
ATVA Papers
Deriving Liveness Properties of Hybrid Systems from Reachable Sets and Lyapunov-like Certificates
ATVA Papers
Efficient Dynamic Shielding for Parametric Safety Specifications
ATVA Papers
Energy Games with Weight Uncertainty
ATVA Papers
Evaluation, Reduction, and Approximation of Dynamical Systems and Networks with ERODE (tool paper)
ATVA Papers
Generalized Parameter Lifting: Finer Abstractions for Parametric Markov Chains
ATVA Papers
Inductive Generalization in Reinforcement Learning from Specifications
ATVA Papers
Learning Event-recording Automata Passively
ATVA Papers
Learning Verified Monitors for Hidden Markov Models
ATVA Papers
Locally Pareto-Optimal Interpretations for Black-Box Machine Learning Models
ATVA Papers
PolyQEnt: A Polynomial Quantified Entailment Solver (tool paper)Distinguished Tool Paper
ATVA Papers
Prompt Runtime Enforcement
ATVA Papers
Q-Sylvan: A Parallel Decision Diagram Package for Quantum Computing (tool paper)
ATVA Papers
Quantitative Strategy Templates
ATVA Papers
Solution-aware vs global ReLU selection: partial MILP strikes back for DNN verification
ATVA Papers
TAPAAL HyperLTL: A Tool for Checking Hyperproperties of Petri Nets (tool paper)
ATVA Papers
Towards Unified Probabilistic Verification and Validation of Vision based Autonomy
ATVA Papers
Widest Path Games and Maximality Inheritance in Bounded Value Iteration for Stochastic Games
ATVA Papers

Artifact Evaluation

The purpose of an artifact is to support the claims made in the paper and allow other researchers to check the data sets, obtain the results, check their validity, and potentially also reuse the benchmarks and the implemented tools in their own research. In case of tool papers, the purpose additionally is to provide a working version of your tool that is easy to obtain and use.

Author Instructions

ATVA 2025 will include two separate rounds of artifact evaluation:

  • Tool Papers : Artifact evaluation is mandatory and the artifact must be submitted shortly by the submission of the paper (by May 2 AoE). The submitted artifact must obtain at least the functional badge; if it does not, the paper will be rejected. The reviews of the artifact will be available to the reviewers of the paper and can affect its acceptance.

  • Research papers : Artifact evaluation is voluntary and the authors will be invited to submit an artifact only after their paper is accepted. If the authors decide to submit an artifact, they must submit it by July 8 AoE. The reviews of the artifact and the obtained badges will not influence the acceptance of the paper.

Important Dates

For Tool Papers:
Artifact submission: May 2, 2025 (AoE)
Smoke test reviews: May 9, 2025 (AoE)
Submission of revised artifacts (for issues identified during the smoke test): May 11, 2025 (AoE)
Author notification: July 4, 2025 (AoE)
For Accepted Regular Papers (optional artifact submission):
Artifact submission: July 8, 2025 (AoE)
Author notification: July 27, 2025 (AoE)

Evaluation Criteria

The reviewers will read the paper and evaluate the submitted artifact. The evaluation criteria are based on the ACM guidelines. According to the guidelines, each artifact can obtain three badges:

  • Functional - The artifact can be executed without major problems, and its content is relevant to the paper. It supports ideally all claims made in the paper, and it can be used to reproduce ideally all of the experimental results. Moreover, the artifact contains instructions for setting the artifact up, running the experiments, and processing their results, which other researchers can follow.

  • Available - The artifact has been uploaded to a publicly available archival repository (e.g., Zenodo, figshare), is available under DOI, and all its dependencies are either included in the artifact or also available (e.g., the dependencies are not downloaded from GitHub during setup). We strongly encourage aiming for the available badge unless you have a strong reason for not doing so, as it supports reproducible research.

  • Reusable - The artifact is functional and its quality significantly exceeds minimal functionality. In particular, the tools are documented and can be used outside of the artifact. The users should be able to run the tools on other inputs and reuse them for their own applications and research.

Evaluation Process

An evaluation of a single artifact consists of two phases: a smoke test phase and a full-review phase.

  • Smoke test phase: In the smoke test phase, the reviewers will run a quick check of your artifact. During the smoke test, the reviewers only check whether the artifact works on a technical level (i.e., the archive contains all dependencies, the scripts can be executed without errors and generate an expected output). The reviewers will not check for logical errors of the implemented tool/scripts and whether the artifact is consistent with the paper. Your artifact should contain instructions that describe how to run the smoke test and what are the expected outputs. If any technical issues are identified during the smoke test, you will have a chance to submit a fixed version of the artifact.

  • Full review phase: In the full-review phase, the reviewers will evaluate the artifact in its entirety and check whether the obtained results are consistent with the claims of the paper.

Submission

Artifacts are submitted to the ATVA 2025 Artifact Evaluation track via EasyChair:

ArtifactSubmissionLink

The submission consists of

  • An abstract containing:
    • A short description of the artifact and its relationship to the paper
    • Any special requirements for the evaluation (large number of CPU cores, specific GPU, etc), if applicable, and
    • Text that explains why you believe that your artifact satisfies the criteria of reusable badge, if you are aiming for it.
  • Publicly available URL from which the artifact can be downloaded (a single ZIP file, see below).
  • SHA256 checksum of the ZIP file.
  • A PDF of your submitted paper.

Please put your artifact’s URL at the end of the abstract field of the EasyChair submission webpage, when you submit your artifact.

For the URL, we recommend using an archival repository such as Zenodo. Firstly, this will ensure that the artifact will be available when the reviewers want to download it. Secondly, it will automatically grant you the available badge. If you use any other custom service (e.g., a website of your institution), you are responsible for its availability throughout the evaluation period.

The SHA256 checksum can be obtained by the following commands:

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

Artifact Guidelines

The submitted artifact must be packaged as a single ZIP file that contains:

LICENSE : The file that allows the reviewers to evaluate the artifact. In particular, it must allow the reviewers to use, execute, and modify the contents of the artifact.

README : The file that describes the contents of the artifact. If the artifact contains executable code, the README should contain the instructions on how to install the artifact and use it (see below). The actual content of the artifact.

Executables : If your artifact contains executable files, you cannot expect that the reviewers and the other researchers will be executing it on their actual computers. Therefore, we require that the submitted artifact either works in the provided virtual machine based on Ubuntu 22.04 (hereafter the VM), or contains a Docker image in which the artifact can be executed together with a Dockerfile that can be used to build the image.

Dockerfile or VM : To achieve better reusability, submit both the Dockerfile and the generated Docker image, if your artifact is based on Docker.

If it is based on the VM, do not submit the modified VM, submit the files that are necessary for setting the provided VM up.

Namely, the artifact should contain

  1. Files that the users copy to the VM.

  2. Instructions that describe how to install all the dependencies into the VM and how to set it up.

This ensures that all dependencies and setup are well documented in the artifact.

Example Template for Docker-based Artifact

We encourage authors to submit Docker-based artifacts. If you need an example for a Docker-based artifact, you can follow the example here made by ATVA 2024.

Virtual Machine

If a Docker-based artifact is not possible, we also provide a VM image, based on Ubuntu 22.04 LTS, that can be downloaded from Zenodo. This VM will be used by reviewers as evaluation environment. Please make sure that your submitted artifact is self-contained and includes all required dependencies to run within the VM. Ideally, the artifact is exercisable in the VM without internet connection.

README file

The README file should contain the following information:

  • Description of the content of the artifact.

    What is the purpose of the artifact? What claims of the paper it replicates? What is the structure of the artifact?

  • Installation instructions.

    What should be copied to the VM? What commands should be executed in the VM to install all the dependencies? What commands should be executed to build the Docker image and run the Docker container?

  • Instructions for the smoke test.

    What commands should the reviewers run? What are the expected outputs? What is the expected time needed to obtain the results?

  • Instructions for the full evaluation.

    What commands should be executed to replicate the results of the paper? What are the expected results? Which part of the output correspond to which parts of the paper? What is the expected time needed to obtain the results?

Some additional guidelines that will help you to make the artifact more user-friendly and reusable for the future researchers:

  • Do not expect any technical expertise from the users.

  • Keep the usage simple through easy-to-use-scripts.

  • Make the output of the scripts easy to interpret. If you can, format the output as a table or generate a plot (ideally in a similar format as in the paper).

  • Do not assume particular path in the VM to which the artifact was copied. If you do assume specific paths, write it in the README.

  • If you do not have to, do not assume internet connection. If you have any external dependencies (e.g., Ubuntu packages), include them in the artifact. This can be achieved by including the file package.deb in the artifact and running sudo dpkg -i package.deb during the installation. If there are objective reasons why the internet connection is preferred or necessary (e.g., the benchmark set is too large, some dependencies cannot be included in the artifact due to their license restrictions), explain this in the README.

  • State resource requirements and/or the environment in which you successfully tested the artifact.

  • If the execution of your artifact takes a significant amount of time (more than four hours), provide a smaller version of the experiments that can be executed in one hour. You can either use only a representative subset of the benchmarks and/or use a shorter timeouts. It both cases, also provide log files from your complete evaluation that you used in the paper and also include scripts to run the complete set of experiments for reviewers who have sufficient amount of time.

Artifact Evaluation Co-Chairs

If you have any questions or the situation of your artifact is nonstandard (e.g., requires special hardware, proprietary software, etc.), feel free to contact the Artifact Evaluation Committee chairs:

Call for Papers

ATVA 2025 is the 23rd in a series of Symposia aimed at bringing together academics, industrial researchers and practitioners in the area of theoretical and practical aspects of automated analysis, synthesis, and verification of hardware and software systems. ATVA solicits high quality submissions in the following suggestive list of topics:

  • Formalisms for modeling hardware, software and embedded systems
  • Specification and verification of finite-state, infinite-state and parameterized systems
  • Program analysis and software verification
  • Analysis and verification of hardware circuits, systems-on-chip and embedded systems
  • Analysis of real-time, hybrid, priced, weighted and probabilistic systems
  • Deductive, algorithmic, compositional, and abstraction/refinement techniques for analysis and verification
  • Analytical techniques for safety, security, and dependability
  • Testing and runtime analysis based on verification technology
  • Analysis and verification of parallel and concurrent systems
  • Verification in industrial practice
  • Synthesis for hardware and software systems
  • Applications and case studies of verification
  • Automated tool support for verification
  • Testing and verification of neural networks
  • Testing and verification of autonomous systems

IMPORTANT DATES

  • Abstract + Paper submission deadline: April 25, 2025 (AoE)
  • Author response period: June 17 – 20, 2025 (AoE)
  • Paper notification: July 4, 2025 (AoE)
  • Camera-ready deadline: August 7, 2025 (AoE)
  • Tutorials and Workshops: October 27, 2025
  • Conference: October 28 – October 30, 2025

SUBMISSIONS

ATVA welcomes submissions in the following two categories:

  • Regular research papers (18 pages, excluding references, must be anonymized)
  • Tool papers (10 pages, excluding references, not anonymized)

Submissions in both categories must be in Springer’s LNCS format. Formatting style files and further guidelines for formatting can be found at the Springer website https://www.springer.com/gp/computer-science/lncs. Adding line numbers (LaTeX package lineno) is highly recommended. Submissions authored or co-authored by members of the program committee are allowed and encouraged.

An artifact evaluation will be undertaken, which will be optional for regular papers and mandatory for tool papers.

Papers must be submitted through EasyChair: https://easychair.org/conferences/?conf=atva2025 Accepted papers in both categories will be published in Springer’s Lecture Notes in Computer Science series. A few outstanding papers will be selected for a distinguished paper award. At least one author of each accepted paper is expected to register and present the paper at the conference.

Regular papers

Regular papers should not exceed 18 pages in Springer’s LNCS format, not counting references and appendices. Additional material may be placed in an appendix, to be read at the discretion of the reviewers, and to be omitted in the final version.

Regular papers at ATVA 2025 will follow a full double-blind review process, which means that author names and affiliations must be omitted from the submission. Additionally, if a submission refers to prior work done by the authors, the reference should be made in the third person. These are firm submission requirements, and any regular paper that does not conform to these requirements will be rejected without review.

Authors of accepted regular papers will be invited (but are not required) to submit a relevant artifact for evaluation by the artifact evaluation committee. The submission deadline for this artifact evaluation will be soon after the paper acceptance notification.

Independent of the artifact evaluation process, research paper authors are encouraged to include a URL to a repository in their original submission, if such a repository is available and is pertinent to the paper. This repository could contain code, datasets, results, etc. This would be for the consideration of the PC reviewers of the submission, at their discretion. If such a URL is included in the submission, the contents of the repository should adhere to the guidelines of a double blind review process.

Tool papers

Tool papers should not exceed 10 pages in Springer’s LNCS format, not counting references. Tool papers will follow a single-blind review process. They do NOT need to be anonymized.

Each tool paper submission must be followed by a separate artifact submission via EasyChair. Please see the Artifact Evaluation track instructions in the conference web site for more information. Papers describing tools that have already been presented (in any conference) will be accepted only if significant and clear enhancements to the tool are reported and implemented.