Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andrea Gimelli

dblp:381/5203 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2026
0009-0008-1372-7694ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021Theory of computation · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Logic in computer science · 75% Automated reasoning and model checking · 25%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Logic in computer science
formal semantics
1.012026
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification · CAV (2) 2026
Automated reasoning and model checking
neural network verification
1.012026
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification · CAV (2) 2026
Logic in computer science › formal specification
specification language
1.012026
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification · CAV (2) 2026
Logic in computer science › type theory
type systems
1.012026
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification · CAV (2) 2026

Methods — techniques the papers use, named apart from their topics

agda theorem proving · 1.0
YearPublicationVenuePosition
2026 VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification
abstract
Abstract Neural network verification is an active and rapidly maturing research area, with a growing ecosystem of solvers and tools. The VNN-LIB standard was introduced to support interoperability in this ecosystem, but Version 1.0 has several serious short-comings as a formal foundation: it lacks a precise syntax, semantics, and type system, offers limited expressivity, and relies on externally defined ONNX models whose semantics are informal and constantly evolving. The latter distinguishes VNN-LIB from established standards such as SMT-LIB, where queries are self-contained and have fixed semantics. In this paper we address these challenges by developing the theoretical foundations of VNN-LIB 2.0. Our key contribution is the introduction of the notion of a network theory , which abstractly characterises the minimal semantic interface required from a neural network model format. This abstraction enables VNN-LIB to be defined independently of any specific ONNX version while remaining compatible with evolving model representations. Building on this foundation, we present a formal syntax for a more expressive query language, a type system for it over the numeric domains provided by the network theory, and finally a formal semantics. To ensure internal consistency, the standard is mechanised in the Agda theorem prover. VNN-LIB 2.0 therefore provides robust and rigorous foundations for trustworthy neural network verification.
Ann Roy, Allen Antony, Andrea Gimelli, Matthew L. Daggitt
CAV (2)3
2024 Improving Abstract Propagation For Verification Of Neural Networks
abstract
Formal verification of neural networks is a crucial technique to increase their dependability in safety critical applications. In this paper we address some scalability challenges in our verification tool NEVER2 by proposing strategies to enhance speed and overall performances. First, we apply a precomputation technique based on symbolic bounds propagation in order to improve the network analysis by determining neuron stability a priori. Second, we combine the strengths of different levels of abstraction towards a refinement strategy. We experiment with the proposed techniques on some verification benchmarks from the annual competition of verification tools for neural networks (VNN-COMP).
Stefano Demarchi, Andrea Gimelli, Armando Tacchella
ECMS2