FSE-AIware Tool Competition 2026 - Agentic Based Python Dependency Resolution

Conference Paper (2026)
Author(s)

Antony Bartlett (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Cynthia C.S. Liem (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Annibale Panichella (TU Delft - Electrical Engineering, Mathematics and Computer Science)

Research Group
Pattern Recognition and Bioinformatics
DOI related publication
https://doi.org/10.1145/3803437.3808243 Final published version
More Info
expand_more
Publication Year
2026
Language
English
Research Group
Pattern Recognition and Bioinformatics
Pages (from-to)
1430-1433
Publisher
ACM
ISBN (electronic)
9798400726361
Event
ACM International Conference on the Foundations of Software Engineering, FSE 2026 (2026-07-05 - 2026-07-09), Montreal, Canada
Downloads counter
17
Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Abstract

This is the inaugural edition of the FSE-AIware Tool Competition for Agentic Based Python Dependency Resolution. The aim of this competition is to provide a platform for researchers and practitioners to build, test and validate their agentic tools for Python dependency resolution. The platform provides an existing state-of-the-art agentic tool and a validation framework to evaluate the performance of the tools. In this first edition, the competition includes two tools from different teams. All tools were validated on a newly generated dataset of Python projects with various dependency complexity. We compare all tools against the baseline tool and provide insights into the performance of the tools and the challenges of Python Dependency Resolution. This paper provides an overview of the competition, detailing its context, framework, participating tools, evaluation methodology, and key findings.