paper_name stringlengths 4 421 | paper_url stringlengths 21 200 | paper_authors listlengths 0 125 | paper_abstract stringlengths 0 43.4k | paper_code stringlengths 1 139 | conf stringlengths 6 18 |
|---|---|---|---|---|---|
Computer Aided Verification - 38th International Conference, CAV 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings, Part I | https://doi.org/10.1007/978-3-032-32519-8 | [
"Eva Darulova",
"Anthony W. Lin",
"Philipp Rümmer"
] | This open access 3 volume set CAV 2026 focuses on research advances in all areas of Computer Aided Verification and much more. | # | CAV2026 |
Learning to Split: A Reinforcement-Learning-Guided Splitting Heuristic for Neural Network Verification (Invited Talk) | https://doi.org/10.1007/978-3-032-32519-8_1 | [
"Maya Swisa",
"Guy Katz"
] | Abstract Modern neural network verifiers often encode neural network verification as constraint satisfaction problems. When dealing with standard piecewise-linear activation functions, such as ReLUs, verifiers typically employ branching heuristics that break a complex constraint satisfaction problem into multiple, simp... | # | CAV2026 |
On the Complexity of Checking Soundness of Natural Reductions | https://doi.org/10.1007/978-3-032-32519-8_2 | [
"Constantin Enea",
"Azadeh Farzan",
"Dominik Klumpp"
] | Abstract The verification of reductions , representative subsets of interleavings, simplifies correctness proofs of parameterized concurrent programs. We introduce an expressive class of syntactic reductions, which we call natural reductions . Natural reductions are specified by introducing atomic blocks and global ren... | # | CAV2026 |
Deadlock Verification via Ordering-Constrained Mutex Modeling | https://doi.org/10.1007/978-3-032-32519-8_3 | [
"Pei Wang",
"Zhilei Han",
"Zhihang Sun",
"Fei He"
] | Abstract Mutexes are fundamental synchronization primitives in concurrent programming, but their improper use can lead to deadlocks. Conventional assume-based modeling abstracts mutex semantics via assumptions, simplifying safety verification but hindering deadlock verification. Although prior efforts have aimed to add... | # | CAV2026 |
Complete Local Reasoning About Parameterized Programs Over Topologies | https://doi.org/10.1007/978-3-032-32519-8_4 | [
"Ruotong Cheng",
"Azadeh Farzan"
] | Abstract This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to automatically produce a proof of correctness in the form of a universally quantified inductive invariant, where the quantification ... | # | CAV2026 |
Scalable Deductive Verification of Data-Level Parallel Programs | https://doi.org/10.1007/978-3-032-32519-8_5 | [
"Lars B. van den Haak",
"Anton Wijs",
"Marieke Huisman"
] | Abstract This paper introduces several techniques that improve the scalability of the deductive verification of data-level parallel programs working on arrays and matrices. First of all, we introduce a technique to rewrite expressions with (nested) quantifiers, so suitable triggers can be generated for these expression... | # | CAV2026 |
On the Verification Problem of Remote Direct Memory Access Programs | https://doi.org/10.1007/978-3-032-32519-8_6 | [
"Parosh Aziz Abdulla",
"Mohamed Faouzi Atig",
"Govind Rajanbabu",
"Stephan Spengler"
] | Abstract Remote Direct Memory Access (RDMA) is a technology that allows direct memory access from the memory of one computer into that of another without involving either one’s operating system. This enables high-throughput, low-latency networking, which is especially useful in massively parallel computer clusters. In ... | # | CAV2026 |
Model Checking for Flexible Network Protocols | https://doi.org/10.1007/978-3-032-32519-8_7 | [
"Andrew Johnson",
"Dennis Fetterly",
"Sean Song",
"Jonathan Zolla"
] | Abstract Operating a network is a daunting task. Operating one at a global scale, with stringent service objectives and requirements to be available during maintenance and failures, is even more so. At Google, we operate such a network. This paper details our experience applying formal methods to some of the networking... | # | CAV2026 |
The TLA+ Model Checker Apalache | https://doi.org/10.1007/978-3-032-32519-8_8 | [
"Rodrigo Otoni",
"Shon Feder",
"Jure Kukovec",
"Andrey Kupriyanov",
"Gabriela Moreira",
"Philip Offtermatt",
"Thomas Pani",
"Thanh-Hai Tran",
"Igor Konnov"
] | Abstract The TLA $$^+$$ + language has been widely used, both in academia and industry, to specify and reason about distributed systems. This paper presents Apalache , an efficient and flexible symbolic model checker for TLA $$^+$$ + . Apalache ’s engine is based on bounded model checking, with symbolic transitions bei... | # | CAV2026 |
PSF: A Generic and Extensible Framework for Protocol State Fuzzing | https://doi.org/10.1007/978-3-032-32519-8_9 | [
"Konstantinos Sagonas",
"Thanos Typaldos"
] | Abstract In recent years, protocol state fuzzing has emerged as an effective technique to analyze and test network protocol implementations, uncovering numerous security vulnerabilities, bugs, and non-conformance issues in them. This paper presents ProtocolState-Fuzzer ( PSF ), an open source, generic, modular, and ext... | # | CAV2026 |
Kofola 1.0: A Modular Approach to ømega-Regular Complementation and Inclusion Checking | https://doi.org/10.1007/978-3-032-32519-8_10 | [
"Ondrej Alexaj",
"Vojtech Havlena",
"Lukás Holík",
"Ondrej Lengál",
"Yong Li",
"Nicolas Mazzocchi"
] | Abstract We present Kofola , an efficient tool for complementation and inclusion checking of Büchi automata, two central tasks in automata-theoretic verification with applications in model checking, monitoring, and theorem proving. Kofola implements a state-of-the-art modular complementation framework that decomposes t... | # | CAV2026 |
Octopus: Practical Equivalence Checking of P4 Packet Parsers | https://doi.org/10.1007/978-3-032-32519-8_11 | [
"Jort van Leenen",
"Tobias Kappé"
] | Abstract P4 is a domain-specific language for programming protocol-independent packet processors, where packet parsers describe how incoming bit-streams are structured into headers and fields. Building on work by Doenges et al. (2022), we present Octopus , a tool that translates P4 packet parsers into automata and then... | # | CAV2026 |
Randomise Alone, Reach as a Team | https://doi.org/10.1007/978-3-032-32519-8_12 | [
"Léonard Brice",
"Thomas A. Henzinger",
"Alipasha Montaseri",
"Ali Shafiee",
"K. S. Thejaswini"
] | Abstract We study concurrent graph games where n players cooperate against an opponent to reach a set of target states. Unlike traditional settings, we study distributed randomisation: team players do not share a source of randomness, and their private random sources are hidden from the opponent and from each other. We... | # | CAV2026 |
Decoupled Planning for Multiple Omega-Regular Objectives | https://doi.org/10.1007/978-3-032-32519-8_13 | [
"Guy Avni",
"Thomas A. Henzinger",
"Kaushik Mallik",
"Suman Sadhukhan",
"K. S. Thejaswini"
] | Abstract We study the problem of generating paths on a graph that satisfy a collection of $$\omega $$ ω -regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler—oblivious to the graph and objective—dynamically compos... | # | CAV2026 |
Repairing Regex-Dependent String-Manipulation Programs | https://doi.org/10.1007/978-3-032-32519-8_14 | [
"Nariyoshi Chida",
"Tachio Terauchi"
] | Abstract We present a new Programming-by-Examples (PBE) approach to repairing regex-dependent string-manipulation programs. Our approach has the following key features: (1) the support for a wide range of functions including regex-dependent functions such as , , , list manipulation functions such as , , , and numerical... | # | CAV2026 |
Liquid Tree Automata | https://doi.org/10.1007/978-3-032-32519-8_15 | [
"Ashish Mishra",
"Suresh Jagannathan"
] | Abstract Component-based synthesis (CBS) aims to generate loop-free programs from a set of libraries whose methods are annotated with specifications and whose output must satisfy a set of logical constraints, expressed as a query. The effectiveness of a CBS algorithm critically depends on the severity of the constraint... | # | CAV2026 |
SemML 2.0: Synthesizing Controllers for LTL | https://doi.org/10.1007/978-3-032-32519-8_16 | [
"Jan Kretínský",
"Tobias Meggendorfer",
"Maximilian Prokop"
] | Abstract Synthesizing a reactive system from specifications given in linear temporal logic (LTL) is a classical problem, finding its applications in safety-critical systems design. These systems are typically represented using either Mealy machines or AIGER circuits. We present the second version of SemML , which outpe... | # | CAV2026 |
Fast Obligation Translation and Synthesis | https://doi.org/10.1007/978-3-032-32519-8_17 | [
"Alexandre Duret-Lutz",
"Giuseppe De Giacomo",
"Marcin Jurdzinski",
"Nir Piterman",
"Moshe Y. Vardi",
"Shufang Zhu"
] | Abstract Syntactic obligations are a fragment of LTL formulas that translate to deterministic weak $$\omega $$ ω -automata (DWA). We show that syntactic obligations can be very efficiently converted to minimal DWA represented using multi-terminal binary decision diagrams (MTBDDs), and that synthesis of such specificati... | # | CAV2026 |
sweap: Reactive Synthesis for Infinite-State Integer Problems | https://doi.org/10.1007/978-3-032-32519-8_18 | [
"Shaun Azzopardi",
"Luca Di Stefano",
"Nir Piterman"
] | Abstract Recent years have seen a significant increase in the interest in reactive synthesis from specifications that relate to infinite state spaces. We present , a tool for synthesis of infinite-state Linear Integer Arithmetic reactive systems. implements a CEGAR approach, relying on state-of-the-art finite-state syn... | # | CAV2026 |
A - tt IC3: Learning-Guided Adaptive Inductive Generalization for Hardware Model Checking | https://doi.org/10.1007/978-3-032-32519-8_19 | [
"Xiaofeng Zhou",
"Guangyu Hu",
"Hongce Zhang",
"Wei Zhang"
] | Abstract The IC3 algorithm represents the state-of-the-art (SOTA) hardware model checking technique, owing to its robust performance and scalability. A significant body of research has focused on enhancing the solving efficiency of the IC3 algorithm, with particular attention to the inductive generalization process—a c... | # | CAV2026 |
A Multi-width Parametric Bitvector Equivalence Solver | https://doi.org/10.1007/978-3-032-32519-8_20 | [
"Luigi Rinaldi",
"John Wickerson",
"Samuel Coward"
] | Abstract At the core of modern electronic design automation (EDA) tools is rewriting : a mechanism by which local transformations are iteratively applied to circuits to make them faster and more efficient. These rewrites are crucial for producing high-quality hardware, and they often depend on extremely delicate condit... | # | CAV2026 |
Massively Parallel Mining of Specifications for Hardware Designs | https://doi.org/10.1007/978-3-032-32519-8_21 | [
"Leiqi Ye",
"Guy Frankel",
"Jianyi Cheng",
"Elizabeth Polgreen"
] | Abstract Formal hardware verification ensures that a design satisfies its specifications, but writing these specifications requires substantial manual effort. Specification mining automates this process, and existing work has their own merits. The classic approaches rely on pre-defined templates, which have limited exp... | # | CAV2026 |
A Mechanised, Bidirectional Type System for Bit-Width Determination in SystemVerilog | https://doi.org/10.1007/978-3-032-32519-8_22 | [
"Gabriel Desfrene",
"Quentin Corradi",
"Michalis Pardalos",
"John Wickerson"
] | Abstract SystemVerilog remains one of the most widely used languages for designing and verifying digital circuits. Despite its importance, the SystemVerilog standard suffers from ambiguities, which can lead to inconsistent implementations and portability challenges. Formal methods can provide precise semantics to addre... | # | CAV2026 |
Differentially Private Runtime Monitoring | https://doi.org/10.1007/978-3-032-32519-8_23 | [
"Bernd Finkbeiner",
"Frederik Scheerer"
] | Abstract Modern stream-based monitors collect detailed statistics of the runtime behavior of the system under observation. If the system runs in a privacy-sensitive context, this poses the risk of disclosing sensitive information. Differential privacy is the state-of-the-art approach for protecting sensitive informatio... | # | CAV2026 |
HyperLasso: Bounded Model Checking of ∀+∃>+-Liveness Hyperproperties | https://doi.org/10.1007/978-3-032-32519-8_24 | [
"Alcino Cunha",
"Hugo Pacheco",
"Nuno Macedo"
] | Abstract This paper presents the first symbolic bounded model checking technique capable of verifying $$\forall ^+\exists ^+$$ ∀ + ∃ + -liveness hyperproperties (expressed in HyperLTL) over arbitrary (non-terminating) reactive systems. Previous bounded procedures for HyperLTL handled only safety hyperproperties or arbi... | # | CAV2026 |
The Simulator's Blueprint: Automata Learning from Cybersecurity Logs | https://doi.org/10.1007/978-3-032-32519-8_25 | [
"Tudor Braicu",
"Benjamin Ylvisaker",
"Nicolas Espinosa Dice",
"Yiding Chen",
"Yiyi Zhang",
"Nate Foster",
"Hossein Hojjat"
] | Abstract We show how to use passive automata learning to infer models of attacker-defender interactions in cybersecurity. By treating system event logs as words in a formal language, we can apply algorithms such as RPNI to infer compact deterministic finite automata from observed traces. We evaluate this approach throu... | # | CAV2026 |
HyperQB 2.0: A Bounded Model Checker for Hyperproperties | https://doi.org/10.1007/978-3-032-32519-8_26 | [
"Tzu-Han Hsu",
"Milad Rabizadeh",
"Kenneth Rogale",
"Fedor Filippov",
"Marco A. de Oliveira Batista",
"Borzoo Bonakdarpour"
] | Abstract We introduce the tool $$^{\textsf {\small 2.0}}$$ 2 . 0 , the first highly efficient push-button bounded model checker (BMC) for hyperproperties. HyperQB takes as input a model in NuSMV or Verilog and a formula expressed in the temporal logics HyperLTL or A-HLTL. The core decision procedures to implement BMC a... | # | CAV2026 |
Computer Aided Verification - 38th International Conference, CAV 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings, Part II | https://doi.org/10.1007/978-3-032-32526-6 | [
"Eva Darulova",
"Anthony W. Lin",
"Philipp Rümmer"
] | This open access 3 volume set CAV 2026 focuses on research advances in all areas of Computer Aided Verification and much more. | # | CAV2026 |
Improving Stability of SMT Solvers via Context-Driven Normalization | https://doi.org/10.1007/978-3-032-32526-6_1 | [
"Xiang Zhang",
"Mengyu Zhao",
"Shaohuang Chen",
"Jian Zhang",
"Shaowei Cai"
] | Abstract Satisfiability Modulo Theories (SMT) solvers are widely used in formal verification. In program analysis, users often encounter queries that differ only by simple syntactic mutations and are logically equivalent. These mutations typically include assertion reordering, symbol renaming, anti-symmetric relation i... | # | CAV2026 |
Satisfiability Modulo Extensional Constant Arrays | https://doi.org/10.1007/978-3-032-32526-6_2 | [
"Mathias Preiner",
"Aina Niemetz",
"Clark W. Barrett"
] | Abstract Reasoning about array data structures is a key requirement for many applications in hardware and software verification, especially in combination with machine integers. The Satisfiability Modulo Theories (SMT) theory of extensional arrays provides array read and write operators and allows extensionality over a... | # | CAV2026 |
String Solving with Stabilization and Transducers | https://doi.org/10.1007/978-3-032-32526-6_3 | [
"David Chocholatý",
"Vojtech Havlena",
"Lukás Holík",
"Juraj Síc",
"Michal Sedý"
] | Abstract We generalize an efficient automata-based approach to string solving, the stabilization-based method behind the solver Z3-Noodler , to support relational constraints represented by finite-state transducers (useful for modeling constraints, etc.). We focus on efficient handling of length constraints by reducing... | # | CAV2026 |
Lagrangian-Based Duality for Quantified SMT Algorithms | https://doi.org/10.1007/978-3-032-32526-6_4 | [
"Ivana Bocevska",
"Takeshi Tsukada",
"Hiroshi Unno",
"Oded Padon",
"Sharon Shoham"
] | Abstract Lagrangian-based duality, traditionally applied in optimization, has recently been generalized to serve as the basis for a unifying framework for primal-dual search algorithms in the context of program verification and automated reasoning. In this paper, we analyze Quantified Satisfiability Modulo Theories (QS... | # | CAV2026 |
Mallob: Scalable Automated Reasoning on Demand | https://doi.org/10.1007/978-3-032-32526-6_5 | [
"Dominik Schreiber",
"Niccolò Rigi-Luperti",
"Peter Sanders"
] | Abstract This tool paper presents the latest (2026) version of Mallob – a distributed platform for automated reasoning on demand. Mallob features a world-leading distributed SAT solving engine, which is the first of its kind that supports proof checking, incremental SAT queries, and flexible (re-)scheduling of computat... | # | CAV2026 |
Modular Reasoning About Object Relations | https://doi.org/10.1007/978-3-032-32526-6_6 | [
"Micha Greutmann",
"Marco Eilers",
"Peter Müller"
] | Abstract In imperative and object-oriented languages, programmers often define relations such as equality or orderings between instances of structs or classes. These object relations must satisfy well-known algebraic properties, such as reflexivity, transitivity, etc. Violations may cause standard library components, s... | # | CAV2026 |
Formally Verified Linear-Time Invertible Lexing | https://doi.org/10.1007/978-3-032-32526-6_7 | [
"Samuel Chassot",
"Viktor Kuncak"
] | Abstract We present ZipLex , a verified framework for invertible linear-time lexical analysis following the longest match (maximal munch) semantics. Unlike past verified lexers that focus only on satisfying the semantics of regular expressions and the longest match property, ZipLex also guarantees that lexing and print... | # | CAV2026 |
Automating Bitvector and Finite Field Equivalence Proofs in Lean | https://doi.org/10.1007/978-3-032-32526-6_8 | [
"Elizaveta Pertseva",
"Valentin Robert",
"Clark W. Barrett",
"James Parker"
] | Abstract Efforts to verify Zero-Knowledge Proof circuit encodings have highlighted the challenge of proving the correctness of quantifier-free statements that make use of both bitvector and finite field operations. Existing verification workflows are either manual or rely on SMT solvers, which scale poorly on some clas... | # | CAV2026 |
The Cooperating Proof Calculus: Comprehensive Proofs for an SMT Solver | https://doi.org/10.1007/978-3-032-32526-6_9 | [
"Andrew Reynolds",
"Hans-Jörg Schurr",
"Haniel Barbosa",
"Ofec Israel",
"Jibiana Jakpor",
"Hanna Lachnitt",
"Abdalrhman Mohamed",
"Aina Niemetz",
"Mathias Preiner",
"Yoni Zohar",
"Robert B. Jones",
"Clark W. Barrett",
"Cesare Tinelli"
] | Abstract We present the Cooperating Proof Calculus (CPC), an evolving set of proof rules encompassing all inferences used in the mainstream theories of the SMT solver cvc5. CPC consists of 585 proof rules, which are formalized in 8025 lines of definitions in the logical framework Eunoia. Eunoia proofs are independently... | # | CAV2026 |
Burrow: A Proof Framework for Weak Memory | https://doi.org/10.1007/978-3-032-32526-6_10 | [
"Dennis Sprokholt",
"Soham Chakraborty"
] | Abstract Burrow is a proof framework for weak memory mapping proofs. Those mappings appear as optimizations and translations between languages inside compilers and binary translators. However, their mechanized proofs, when defined over formal axiomatic weak memory semantics, are often large and complex. In this paper, ... | # | CAV2026 |
Velvet: A Foundational Multi-modal Verifier for Imperative Programs in Lean | https://doi.org/10.1007/978-3-032-32526-6_11 | [
"Vladimir Gladshtein",
"Vitaly Kurin",
"Yueyang Feng",
"Dipesh Kafle",
"George Pîrlea",
"Qiyuan Zhao",
"Ilya Sergey"
] | Abstract We present —a Dafny-style verifier for imperative programs embedded in the Lean proof assistant. Like Dafny, supports reasoning about effectful programs featuring mutable state, loops, and non-determinism. Unlike Dafny, seamlessly combines automated SMT-based proofs with the interactive proof mode of the Lean ... | # | CAV2026 |
Automatic Heap-Memory Diagrams for Separation-Logic Proofs | https://doi.org/10.1007/978-3-032-32526-6_12 | [
"Yawen Guan",
"Shardul Chiplunkar",
"Clément Pit-Claudel"
] | Abstract Separation-logic proofs of heap-manipulating programs require careful accounting of objects and pointers in memory. On paper, these proofs are often accompanied by heap-memory diagrams that help authors and readers track the evolution of the program’s abstract state. However, users of interactive theorem prove... | # | CAV2026 |
An L# Based Algorithm for Active Learning of Minimal Separating Automata | https://doi.org/10.1007/978-3-032-32526-6_13 | [
"Jasper Laumen",
"Leonne Snel",
"Frits W. Vaandrager"
] | Abstract A DFA separates two disjoint languages $$L_1$$ L 1 and $$L_2$$ L 2 if it accepts every word in $$L_1$$ L 1 and rejects every word in $$L_2$$ L 2 . Algorithms for active learning of small separating DFAs have many applications, e.g. for learning network invariants, learning contextual assumptions in composition... | # | CAV2026 |
Upper Bound for the Determinization of Emerson-Lei Automata: A One-Fin Approach | https://doi.org/10.1007/978-3-032-32526-6_14 | [
"Runzhe Ma",
"Cong Tian",
"Wensheng Wang",
"Zhenhua Duan"
] | Abstract Emerson-Lei automata, which allow arbitrary Boolean combinations of $$\texttt{Fin}$$ Fin and $$\texttt{Inf}$$ Inf acceptance conditions, provide a unifying framework for $$\omega $$ ω -automata but pose significant challenges for determinization. The previous best algorithm relies on a transformation that intr... | # | CAV2026 |
SMT-Based Active Learning of Weighted Automata | https://doi.org/10.1007/978-3-032-32526-6_15 | [
"Tiago Ferreira",
"Kevin Batz",
"Alexandra Silva"
] | Abstract We present an SMT-based active learning algorithm for nondeterministic weighted automata (WFAs) as a practical and robust alternative to Hankel/ $$\textsf{L}^\star $$ L ⋆ -style methods. Our algorithm is parametric in a given semiring and, if it terminates, guaranteed to produce minimal WFAs. We prove partial ... | # | CAV2026 |
Compositional Verification of Timed Automata via Violation Assumptions | https://doi.org/10.1007/978-3-032-32526-6_16 | [
"Mehran Moeini Jam",
"Hamed Kalantari",
"Ehsan Khamespanah",
"Marjan Sirjani",
"Ali Movaghar"
] | Abstract In many verification tasks, system models do not correspond to the focused and idealized models that appear in research literature. In practice, models usually contain components and execution paths that are irrelevant to the property being verified or have only a limited effect on it. Compositional verificati... | # | CAV2026 |
Weighted Soundness for Workflow Nets | https://doi.org/10.1007/978-3-032-32526-6_17 | [
"Piotr Hofman",
"Krzysztof Makuracki",
"Filip Mazowiecki"
] | Abstract Workflow nets are a variant of Petri nets used for modelling business processes. Central decision problems are soundness problems, one popular variant called generalised soundness. These problems intuitively ask whether initiated processes can be finalised. We introduce weighted soundness, which strengthens th... | # | CAV2026 |
Synthesizing POMDP Policies: Sampling Meets Model-Checking via Learning | https://doi.org/10.1007/978-3-032-32526-6_18 | [
"Debraj Chakraborty",
"Anirban Majumdar",
"Prince Mathew",
"Sayan Mukherjee",
"Jean-François Raskin"
] | Abstract Partially Observable Markov Decision Processes (POMDPs) are the standard framework for decision-making under uncertainty. While sampling-based methods scale well, they lack formal correctness guarantees, making them unsuitable for safety-critical applications. Conversely, formal synthesis techniques provide co... | # | CAV2026 |
TACO: A Toolsuite for the Verification of Threshold Automata | https://doi.org/10.1007/978-3-032-32526-6_19 | [
"Paul Eichler",
"Tom Baumeister",
"Mouhammad Sakr",
"Mahboubeh Kalateh Dowlati",
"Marcus Völp",
"Swen Jacobs"
] | Abstract We present Taco , a toolsuite for the development and automatic verification of fault-tolerant and threshold-based distributed algorithms. Our toolsuite implements three approaches for model checking threshold automata in different decidable fragments known from the literature and two semi-decision procedures ... | # | CAV2026 |
Extending QuAK with Nested Quantitative Automata | https://doi.org/10.1007/978-3-032-32526-6_20 | [
"Thomas A. Henzinger",
"Nicolas Mazzocchi",
"N. Ege Saraç",
"Harun Yilmaz"
] | Abstract Quantitative automata (QAs) extend finite-state automata on infinite words with weighted transitions to specify quantitative system properties. However, their finite weight sets rule out properties like average response time, where response times can be arbitrarily large. Nested quantitative automata (NQAs) ov... | # | CAV2026 |
VNN-LIB 2.0: Rigorous Foundations for Neural Network Verification | https://doi.org/10.1007/978-3-032-32526-6_21 | [
"Ann Roy",
"Allen Antony",
"Andrea Gimelli",
"Matthew L. Daggitt"
] | 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, sem... | # | CAV2026 |
QAV-FT: Quadratic Approximation-Based Neural Network Verification via Fourier Series and Taylor Truncation | https://doi.org/10.1007/978-3-032-32526-6_22 | [
"Han Wang",
"Xuyang Ding",
"Ying Xie",
"Yakun Sheng"
] | Abstract Formal verification is paramount for neural networks in safety-critical domains yet remains constrained by the trade-off between precision and scalability, especially with modern high frequency activation functions. However, the inherent NP-hardness of the problem forces a fundamental trade-off between scalabi... | # | CAV2026 |
The Rocq-NN-Roll Prover: Soundly Verifying Hyperproperties of Neural Networks in Rocq | https://doi.org/10.1007/978-3-032-32526-6_23 | [
"Andrei Aleksandrov",
"Malte Jackisch",
"Kim Völlinger"
] | Abstract Research on neural network verification has traditionally emphasized scalability. However, recent invalidations of formally verified results of neural networks highlight soundness as an equally important goal. Pursuing inherent soundness, we present Rocq-NN-Roll , the first formally verified prover for rationa... | # | CAV2026 |
ATKVerifier: Adaptive Top-K Constraints for Tighter Verification of Semantic Segmentation Networks | https://doi.org/10.1007/978-3-032-32526-6_24 | [
"Yuehao Liu",
"Cong Tian",
"Yansong Dong",
"Liang Zhao",
"Chao Huang",
"Wensheng Wang"
] | Abstract Formal verification of Semantic Segmentation Networks is challenging due to high-dimensional output spaces and cumulative over-approximation errors in deep architectures. Existing verification methods based on specific Star-set reachability suffer from either exponential state explosion (exact splitting) or ex... | # | CAV2026 |
Precise Verification of Transformers Through ReLU-Catalyzed Abstraction Refinement | https://doi.org/10.1007/978-3-032-32526-6_25 | [
"Hengjie Liu",
"Zhenya Zhang",
"Jianjun Zhao"
] | Abstract Formal verification of transformers has become increasingly important due to their widespread deployment in safety-critical applications. Compared to classic neural networks, the inferences of transformers involve highly complex computations, such as dot products in self-attention layers, rendering their verif... | # | CAV2026 |
Quantifying Sensitivity for Tree Ensembles: A Symbolic and Compositional Approach | https://doi.org/10.1007/978-3-032-32526-6_26 | [
"Ajinkya Naik",
"Chaitanya Garg",
"S. Akshay",
"Ashutosh Gupta",
"Kuldeep S. Meel"
] | Abstract Decision tree ensembles (DTE) are a popular model for a wide range of AI classification tasks, used in multiple safety critical domains, and hence verifying properties on these models has been an active topic of study over the last decade. One such verification question is the problem of sensitivity, which ask... | # | CAV2026 |
Shields to Guarantee Probabilistic Safety in MDPs | https://doi.org/10.1007/978-3-032-32526-6_27 | [
"Linus Heck",
"Filip Macák",
"Roman Andriushchenko",
"Milan Ceska",
"Sebastian Junges"
] | Abstract Shielding is a prominent model-based technique to ensure safety of autonomous agents. Classical shielding aims to ensure that nothing bad ever happens and comes with strong guarantees about safety and maximal permissiveness. However, shielding systems for probabilistic safety, where something bad is allowed to... | # | CAV2026 |
A Neurosymbolic Approach to Natural Language Formalization and Verification | https://doi.org/10.1007/978-3-032-32526-6_28 | [
"Chenyang An",
"Sam Bayless",
"Stefano Buliani",
"Darion Cassel",
"Byron Cook",
"Duncan Clough",
"Rémi Delmas",
"Nafi Diallo",
"Ferhat Erata",
"Nick Feng",
"Dimitra Giannakopoulou",
"Aman Goel",
"Aditya Gokhale",
"Joe Hendrix",
"Victor Heorhiadi",
"Marc Hudak",
"Dejan Jovanovic",
"... | Abstract Large Language Models perform well at natural language interpretation and reasoning, but their lack of formal correctness guarantees limits their adoption in regulated industries like finance and healthcare that operate under strict policies. To address this limitation, we launched Automated Reasoning checks (... | # | CAV2026 |
Computer Aided Verification - 38th International Conference, CAV 2026, Lisbon, Portugal, July 26-29, 2026, Proceedings, Part III | https://doi.org/10.1007/978-3-032-32537-2 | [
"Eva Darulova",
"Anthony W. Lin",
"Philipp Rümmer"
] | This open access 3 volume set CAV 2026 focuses on research advances in all areas of Computer Aided Verification and much more. | # | CAV2026 |
Liveness Proofs for Hardware Model Checking | https://doi.org/10.1007/978-3-032-32537-2_1 | [
"Nils Froleyks",
"Emily Yu",
"Bart Bogaerts",
"Armin Biere",
"Keijo Heljanko"
] | Abstract We introduce a generic certificate format for verifying liveness properties in hardware model checking. The format relies purely on propositional predicates and does not involve explicit counters. Our certificates can be efficiently validated using a fixed number of SAT checks. The proposed format is compatibl... | # | CAV2026 |
Transition Invariants Revisited: Termination Witnesses and Their Validation | https://doi.org/10.1007/978-3-032-32537-2_2 | [
"Dirk Beyer",
"Marek Jankola",
"Marian Lingsch Rosenfeld"
] | Abstract Whenever automatic software verifiers determine that a program fulfills or violates its specification, they are expected to produce also a witness that justifies the verdict. This allows a third party to independently validate the verdict and the arguments from which it was derived, increasing trust in the res... | # | CAV2026 |
KoAT: Automatic Complexity and Termination Analysis of Integer Programs | https://doi.org/10.1007/978-3-032-32537-2_3 | [
"Nils Lommen",
"Éléanore Meyer",
"Jürgen Giesl"
] | Abstract is a tool to automatically infer complexity bounds and prove termination of (possibly recursive) integer programs. To this end, implements an alternating modular inference of upper runtime and size bounds for program parts. In particular, uses a portfolio of different techniques to analyze subprograms. The pow... | # | CAV2026 |
Sound and Precise Symbolic Automata Model for Stateful Software Systems | https://doi.org/10.1007/978-3-032-32537-2_4 | [
"Xinlong Wu",
"Ruiyu Zhou",
"Peisen Yao",
"Qingkai Shi"
] | Abstract Verifying stateful software systems remains challenging due to complex control structures and intricate state interactions, often necessitating pre-existing behavioral models. We introduce , an abstract interpreter that automatically derives sound and precise symbolic finite automata models. In tests on real-w... | # | CAV2026 |
Automated Amortised Analysis of Skew Heaps and Leftist Heaps | https://doi.org/10.1007/978-3-032-32537-2_5 | [
"Armin Walch",
"Georg Moser",
"Berry Schoenmakers",
"Florian Zuleger"
] | Abstract We study the fully automated amortised analysis of purely functional data structures like skew heaps , as well as weight - and rank-biased leftist heaps. For that we generalise earlier works on automated amortised resource analysis by developing a type inference based approach with a generic type system. This ... | # | CAV2026 |
Polynomial Invariant Generation for Floating-Point Programs | https://doi.org/10.1007/978-3-032-32537-2_6 | [
"Xuran Cai",
"Liqian Chen",
"Hongfei Fu"
] | Abstract In numeric-intensive computations, it is well known that the execution of floating-point programs is imprecise as floating-point arithmetic incurs round-off errors. Although round-off errors are small for a single floating-point operation, the aggregation of such errors may be dramatic and cause catastrophic p... | # | CAV2026 |
Parallel Abstract Interpretation for Polynomial Programs with Range Bound Assertions | https://doi.org/10.1007/978-3-032-32537-2_7 | [
"S. Akshay",
"Supratik Chakraborty",
"Soroush Farokhnia",
"Amir Goharshady",
"Harshit Jitendra Motwani",
"Dorde Zikelic"
] | Abstract We present a parallel abstract interpretation technique for polynomial programs with assertions presented as unions of range bound constraints. We use the powerset domain of hyper-rectangles to over-approximate sets of reachable states. Our key technical contributions include novel abstract transformers and re... | # | CAV2026 |
Incremental Inference for Probabilistic Datalog | https://doi.org/10.1007/978-3-032-32537-2_8 | [
"Xuyang Li",
"Weiyi Chen",
"Isil Dillig",
"Jingbo Wang"
] | Abstract Several extensions of Datalog perform probabilistic inference by allowing users to annotate input facts and rules with probabilities. While extremely useful in many domains (e.g., quantitative program analysis), existing systems typically do not support incremental inference , meaning that even small changes t... | # | CAV2026 |
Automatic Detection of Reference Counting Bugs in Linux Kernel Drivers | https://doi.org/10.1007/978-3-032-32537-2_9 | [
"Joe Hattori",
"Naoki Kobayashi",
"Ken Sakayori"
] | Abstract Reference counting bugs in Linux kernel drivers can lead to severe resource mismanagement and security vulnerabilities. We introduce DrvHorn , a novel automated tool to detect these bugs by reducing reference counting verification to an assertion checking problem leveraging the Linux driver interface. Through ... | # | CAV2026 |
Consistency-Based Software Diagnosis: Accuracy, Scalability, and Limitations | https://doi.org/10.1007/978-3-032-32537-2_10 | [
"Sarah Sallinger",
"Lukas Graussam",
"Georg Weissenbacher",
"Florian Zuleger",
"Alexey Ignatiev"
] | Abstract Consistency-based diagnosis is a formal approach to software fault localization that explains failing executions by identifying program components whose modification would restore correctness. Tools such as BugAssist and (more recently) CFaults instantiate this idea using logical encodings and bounded model ch... | # | CAV2026 |
Show Me The Money: An Exercise in Proof-Driven Software Understanding | https://doi.org/10.1007/978-3-032-32537-2_11 | [
"Joseph Tafese",
"Karthik Nukala",
"Hassen Saïdi",
"Natarajan Shankar",
"Arie Gurfinkel",
"Giuliano Losa"
] | Abstract We present a case study on proof-driven software understanding of mature, security-critical infrastructure. While formal methods are traditionally applied during the design phase, we present our experience applying formal reasoning onto a mature industrial C++ codebase. We focus on a formal analysis of the cor... | # | CAV2026 |
SvLibChecker: A Light-Weight Tool for Software Model Checking | https://doi.org/10.1007/978-3-032-32537-2_12 | [
"Dirk Beyer",
"Marian Lingsch Rosenfeld"
] | Abstract SvLibChecker is a small tool for software model checking. Its goal is to provide a light-weight framework that makes it easy to implement and explore algorithms for software verification. The input to SvLibChecker is an SV-LIB program. SV-LIB is an intermediate language that relieves the developers from dealin... | # | CAV2026 |
PyCHC: A Framework for Certified Horn Solving and CHC-Based Design | https://doi.org/10.1007/978-3-032-32537-2_13 | [
"Anna Becchi",
"Martin Blicha",
"Rodrigo Otoni",
"Natasha Sharygina"
] | Abstract We present PyCHC , a solver-agnostic framework aimed at systems of constrained Horn clauses (CHC). PyCHC provides intuitive Python APIs to create and manipulate CHC systems programmatically, and solve them using different backend solvers. Furthermore, PyCHC offers a certification pipeline to validate the corre... | # | CAV2026 |
How Many Quantum Circuit Identities Are Needed to Generate All Others? | https://doi.org/10.1007/978-3-032-32537-2_14 | [
"Yuantian Ding",
"Nengkun Yu",
"Xiaokang Qiu"
] | Abstract Quantum circuit optimizers use rewrite rules from circuit equivalences, yet prior work has identified thousands of such identities, creating substantial challenges for their storage, management, and effective application. For many widely used unitary gate sets, including Clifford+T, this apparent complexity is... | # | CAV2026 |
A Practical Specification Language for Automatic Quantum Program Verification | https://doi.org/10.1007/978-3-032-32537-2_15 | [
"Wei-Lun Tsai",
"Yu-Fang Chen",
"Ondrej Lengál"
] | Abstract Hoare-style verification provides a principled foundation for reasoning about the correctness of quantum programs, but existing approaches do not allow fully automatic verification. While automata-based verification scales well when specifications are given directly as automata, prior frameworks incur exponent... | # | CAV2026 |
Formal Verification of Quantum Ancilla Safety | https://doi.org/10.1007/978-3-032-32537-2_16 | [
"Jiqi Li",
"Jingyi Mei",
"Wang Fang",
"Ji Guan"
] | Abstract Ensuring ancilla safety is a critical correctness requirement for quantum compilation, since ancilla qubits are routinely introduced to implement complex operations with fewer gates and reduced depth. However, formally verifying this property is computationally hard due to state-space explosion in the number o... | # | CAV2026 |
Model Checking Matrix Product States Against Linear Chain Logic | https://doi.org/10.1007/978-3-032-32537-2_17 | [
"Ming Xu",
"Yihao Chen",
"Ji Guan"
] | Abstract Matrix product states (MPS) are a standard tensor-network representation for ground states of one-dimensional quantum many-body systems, and they underpin widely used simulation tools such as DMRG. However, while quantum model checking has been developed mainly for quantum programs and communication protocols ... | # | CAV2026 |
Analysis and Verification of Quantum Communication Protocols in UPPAAL | https://doi.org/10.1007/978-3-032-32537-2_18 | [
"René Bødker Christensen",
"Nikolaj Rossander Kristensen",
"Kim Guldstrand Larsen",
"Marius Mikucionis",
"Jirí Srba",
"Loke Walsted"
] | Abstract We introduce a formal modeling methodology to analyze quantum communication protocols in the tool Uppaal . Our approach encodes quantum states, operations, and measurements into Uppaal timed automata with data extensions and external function calls, enabling both exhaustive verification in the ideal (noiseless... | # | CAV2026 |
Quokka#: Quantum Computing with #SAT | https://doi.org/10.1007/978-3-032-32537-2_19 | [
"Jingyi Mei",
"Dekel Zak",
"Muhammad Osama",
"Tim Coopmans",
"Alfons Laarman"
] | Abstract We present , a versatile, open-source Python library for quantum circuit analysis. reduces various simulation, verification, and synthesis tasks to weighted model counting (#SAT). It supports universal quantum circuits and a wide variety of gates. provides multiple encodings based on different algebraic bases ... | # | CAV2026 |
Over-Approximation of Weakly-Hard Constraints for Control Systems Verification | https://doi.org/10.1007/978-3-032-32537-2_20 | [
"Rieke de Maeyer",
"Holger Hermanns",
"Martina Maggio"
] | Abstract A hard real-time system cannot miss any deadline. A weakly-hard real-time system, on the contrary, is designed to tolerate a specific number of deadline misses. For instance, the $$\texttt {{\textbf {AnyMiss}}}\,(2, 300)$$ AnyMiss ( 2 , 300 ) weakly-hard constraint stipulates that in every window of 300 consec... | # | CAV2026 |
Spatiotemporal Robustness of Temporal Logic Tasks Using Multi-Objective Reasoning | https://doi.org/10.1007/978-3-032-32537-2_21 | [
"Oliver Schön",
"Lars Lindemann"
] | Abstract The reliability of autonomous systems depends on their robustness, i.e., their ability to meet their objectives under uncertainty. In this paper, we study spatiotemporal robustness of temporal logic specifications evaluated over discrete-time signals. Existing work has proposed robust semantics that capture no... | # | CAV2026 |
Best-Effort Safety Control of Multi-mode Systems | https://doi.org/10.1007/978-3-032-32537-2_22 | [
"Massimo Benerecetti",
"Marco Faella",
"Fabio Mogavero"
] | Abstract We consider the problem of controlling a multi-mode system with respect to a safety goal in the Filippov sliding-mode semantics. When the goal can be enforced, we present a symbolic algorithm that enhances the previously known solution. When the goal cannot be enforced, we compare different natural best-effort... | # | CAV2026 |
Perception with Guarantees: Certified Pose Estimation via Reachability Analysis | https://doi.org/10.1007/978-3-032-32537-2_23 | [
"Tobias Ladner",
"Yasser Shoukry",
"Matthias Althoff"
] | Abstract Agents in cyber-physical systems are increasingly entrusted with safety-critical tasks. Ensuring the safety of these agents often requires localizing their pose for subsequent actions. Pose estimates can, e.g., be obtained from various combinations of lidar sensors, cameras, and external services such as GPS. ... | # | CAV2026 |
Tensor Probabilistic Model Checking of Finite-Horizon Markov Chains | https://doi.org/10.1007/978-3-032-32537-2_24 | [
"Jianlin Li",
"Nick Guo",
"Peter Ye",
"Yizhou Zhang"
] | Abstract We reexamine the problem of verifying Markov chains with respect to step-bounded reachability probabilities. Prevailing approaches rely on encoding the state-transition matrix using either explicit or symbolic representations. While these approaches are effective for sparse transition dynamics, they scale less... | # | CAV2026 |
Fast Computation of Conditional Probabilities in MDPs and Markov Chain Families | https://doi.org/10.1007/978-3-032-32537-2_25 | [
"Milan Ceska",
"Sebastian Junges",
"Luko van der Maas",
"Filip Macák",
"Tim Quatmann"
] | Abstract Computing optimal conditional reachability probabilities in Markov decision processes (MDPs) is tractable by a reduction to reachability probabilities. Yet, this reduction yields cyclic, challenging MDPs that are often notoriously hard to solve. We present an alternative, practically efficient method to comput... | # | CAV2026 |
Ensuring Safety in Automotive Machine Learning Inference: From Pre-validated Static Kernels to Machine Learning Graph Compilation | https://doi.org/10.1007/978-3-032-32537-2_26 | [
"Jelena Frtunikj",
"Alex Latz",
"Ajit Mistry",
"Matthew Propp",
"Vasu Singh",
"Suresh Talapaneni",
"Amanda Tang",
"Damien Zufferey"
] | Abstract Machine Learning (ML) inference is shifting from using pre-developed static, CUDA C++, GPU kernel libraries to using MLIR-based graph compilers that perform advanced optimizations and generate custom kernels. This paradigm shift reimagines how we achieve ML inference in safety-critical domains such as automoti... | # | CAV2026 |
Caesar: A Deductive Verifier for Probabilistic Programs | https://doi.org/10.1007/978-3-032-32537-2_27 | [
"Philipp Schröer",
"Kevin Batz",
"Umut Yigit Dural",
"Darion Haase",
"Benjamin Lucien Kaminski",
"Joost-Pieter Katoen",
"Christoph Matheja"
] | Abstract is a deductive verifier for probabilistic programs. At its core lies , a quantitative intermediate verification language based on the real-valued logic . allows users to express a probabilistic program, its specifications, and proof rules in a programming-language style, so that new proof rules can be easily i... | # | CAV2026 |
ULTIMATE: A Tool for the Verification and Synthesis of Stochastic World Models | https://doi.org/10.1007/978-3-032-32537-2_28 | [
"Radu Calinescu",
"Micah Bassett",
"Brendan Devlin-Hill",
"Simos Gerasimou",
"Sinem Getir Yaman",
"Kavan Fatehi",
"Gricel Vázquez"
] | Abstract We present a tool for the compositional verification and correct-by-construction synthesis of stochastic world models —heterogeneous networks of interdependent stochastic models including discrete and continuous-time Markov chains, Markov decision processes (MDPs), partially observable MDPs, and stochastic mul... | # | CAV2026 |
Special Section on Integrated Sensing and Communication Transceivers: Addressing Clutter, Interference, and Reconfigurability | https://doi.org/10.1109/JPROC.2026.3700246 | [
"Moeness G. Amin"
] | # | PROCIEEE2026 | |
Digital Phased Arrays: A Round Peg in a Square Hole | https://doi.org/10.1109/JPROC.2026.3672706 | [
"Benjamin R. Epstein"
] | Today’s state-of-the-art radio and microwave frequency phased arrays reflect an evolution in the steering of radio wave energy “beams” in a manner similar to the directing of radio energy to and from dish antennas. Phased arrays gained traction during WWII because of their ability to electronically steer transmitted an... | # | PROCIEEE2026 |
Next-Generation MIMO Transceivers for Integrated Sensing and Communications: Unique Security Vulnerabilities and Solutions | https://doi.org/10.1109/JPROC.2026.3697798 | [
"Kawon Han",
"Christos Masouros",
"Taneli Riihonen",
"Moeness G. Amin"
] | Integrated sensing and communications (ISAC), which are recognized as a key enabler for sixth generation (6G), have brought new opportunities for intelligent, sustainable, and connected wireless networks. Multiple-input–multiple-output (MIMO) transceiver technology lies at the core of this paradigm, providing the degre... | # | PROCIEEE2026 |
Clutter-Aware Integrated Sensing and Communication: Models, Methods, and Future Directions | https://doi.org/10.1109/JPROC.2026.3675476 | [
"Rang Liu",
"Peishi Li",
"Ming Li",
"A. Lee Swindlehurst"
] | Integrated sensing and communication (ISAC) can substantially improve spectral, hardware, and energy efficiency by unifying radar sensing and data communications. In wideband and scattering-rich environments, clutter often dominates weak target reflections and becomes a fundamental bottleneck for reliable sensing. Prac... | # | PROCIEEE2026 |
Reconfigurable Integrated Sensing and Communications (RISAC): Sparse MIMO and Hybrid Beamforming in Far and Near Fields | https://doi.org/10.1109/JPROC.2026.3670886 | [
"Xiangrong Wang",
"Fulvio Gini",
"Kaiquan Cai"
] | This article provides a comprehensive investigation into reconfigurable integrated sensing and communications (RISAC), an emerging paradigm designed to maximize the performance–cost tradeoff by exploiting the inherent spatial sparsity of multiple-input multiple-output (MIMO) arrays. Deviating from conventional static I... | # | PROCIEEE2026 |
RIS-Enabled Integrated Sensing and Communications: From Theory to Practice | https://doi.org/10.1109/JPROC.2026.3678371 | [
"J. Andrew Zhang",
"Kai Wu",
"Marco Di Renzo",
"Tie Jun Cui"
] | Reconfigurable intelligent surface (RIS)-assisted integrated sensing and communication (ISAC) is emerging as a key enabler for sixth-generation (6G) wireless systems, unifying communication, sensing, and control within a reconfigurable electromagnetic (EM) environment. This article presents a comprehensive review that ... | # | PROCIEEE2026 |
How We Got "Our" System of Units | https://doi.org/10.1109/JPROC.2026.3702728 | [
"Harold Kirkham"
] | # | PROCIEEE2026 | |
Special Issue on Earth Remote Sensing and Data Processing | https://doi.org/10.1109/JPROC.2026.3700784 | [
"Leung Tsang",
"Joel T. Johnson",
"Jiancheng Shi",
"Irena Hajnsek",
"Jeff Dozier"
] | # | PROCIEEE2026 | |
Spaceborne Synthetic Aperture Radar: Future Technologies and Mission Concepts | https://doi.org/10.1109/JPROC.2025.3621586 | [
"Alberto Moreira",
"Gerhard Krieger",
"Michelangelo Villano",
"Marwan Younis",
"Pau Prats-Iraola",
"Manfred Zink"
] | This article provides an overview of the state-of-the-art and future developments in spaceborne synthetic aperture radar (SAR). Today, we are experiencing a golden age of spaceborne SAR, with the number of satellites in orbit increasing rapidly. This article presents novel technologies and mission concepts associated w... | # | PROCIEEE2026 |
BIOMASS: ESA's P-Band SAR Mission | https://doi.org/10.1109/JPROC.2026.3687416 | [
"Klaus Scipal",
"Clément Albinet",
"Michele Caccia",
"Adriano Carbone",
"Nuno Carvalhais",
"Jérôme Chave",
"Jørgen Dall",
"Michael Fehringer",
"Antonio Leanza",
"Thuy Le Toan",
"Maktar Malik",
"Antonio Novelli",
"Philippe Paillou",
"Kostas Papathanassiou",
"Janice Patterson",
"Muriel P... | Utilizing a P-band synthetic aperture radar (SAR), the objective of BIOMASS is to deliver estimates of above-ground forest biomass, forest height (FH), and forest disturbance (FD), with unprecedented accuracy.The mission's primary scientific goal is to quantify the distribution and changes in forest biomass, thereby re... | # | PROCIEEE2026 |
High Revisit-Rate Tropical Cyclone Observations From the NASA TROPICS Satellite Constellation Mission | https://doi.org/10.1109/JPROC.2025.3582502 | [
"William J. Blackwell",
"Scott A. Braun",
"George R. Alvey",
"Robert Atlas",
"Ralf Bennartz",
"Jessica Braun",
"Kerri L. Cahoy",
"Ruiyao Chen",
"Galina Chirokova",
"Brittany Dahl",
"James Darlow",
"Mark DeMaria",
"Michael DiLiberto",
"Jason P. Dunion",
"Patrick Duran",
"Thomas J. Green... | New satellite constellations to provide high-resolution atmospheric observations from microwave (MW) sounders operating in low-Earth orbit are now coming online and are providing operationally useful data. The first of these missions, the NASA Time-Resolved Observations of Precipitation structure and storm Intensity wi... | # | PROCIEEE2026 |
Wideband Radiometry From P to S Band for Monitoring Polar Regions | https://doi.org/10.1109/JPROC.2026.3653571 | [
"Giovanni Macelloni",
"Kenneth C. Jezek",
"Marco Brogioni",
"Joel T. Johnson",
"Marion Leduc-Leballeur",
"Ghislain Picard",
"Ange Haddjeri",
"Lars Kaleschke",
"Jacqueline Boutin",
"Jean-Luc Vergely",
"Nicolas Kolodziejczyk",
"Laurent Bertino",
"Emmanuel P. Dinnat",
"Rasmus T. Tonboe",
"A... | This article reviews existing and planned contributions of spaceborne microwave radiometry from P to S band to new measurements of key geophysical variables with a particular focus on the polar regions. It summarizes the current state of spaceborne microwave radiometry to measure ice sheet thermal states, sea ice thick... | # | PROCIEEE2026 |
The In-Orbit Performance of Chinese First FengYun Rainfall Mission FY-3G | https://doi.org/10.1109/JPROC.2025.3605964 | [
"Peng Zhang",
"Jian Shang",
"Lin Chen",
"Shuze Jia",
"Honggang Yin",
"Shengli Wu",
"Wenqiang Lu",
"Hanlie Xu",
"Haofei Wang",
"Yixuan Shou",
"Guangzhen Cao",
"Sijie Chen",
"Manyun Lin",
"Aijun Zhu",
"Songyan Gu",
"Xiangang Zhao"
] | In April 2023, China launched its first precipitation measurement satellite, FengYun-3G (FY-3G), to accurately measure the spatial and vertical structures of precipitation in the middle and lower latitudes of Earth. Equipped with advanced instruments, including a dual-frequency precipitation radar (DPR), a microwave ra... | # | PROCIEEE2026 |
Spaceborne GNSS-R Bistatic Radar Remote Sensing, CYGNSS, and Future Missions | https://doi.org/10.1109/JPROC.2025.3583997 | [
"Christopher Ruf",
"Scott Gleason"
] | Global Navigation Satellite System Reflectometry (GNSS-R) is a relatively new type of radar developed for remote sensing of the Earth surface. It uses GNSS navigation signals such as those transmitted by the Global Positioning System (GPS) constellation of satellites as the radar transmitter. The radar receiver measure... | # | PROCIEEE2026 |
SDGSAT-1: A Professional Scientific Satellite for Monitoring SDG Indicators | https://doi.org/10.1109/JPROC.2025.3649854 | [
"Huadong Guo",
"Changyong Dou",
"Dong Liang",
"Nijun Jiang",
"Bihong Fu",
"Chengshan Han",
"Fansheng Chen",
"Peng Huang",
"Juanjuan Jing",
"Yu Zhang",
"Bo Cheng",
"Xiaoxue Feng",
"Yunwei Tang",
"Yonghong Hu",
"Lin Yan",
"Hao Zhang"
] | The implementation of the United Nations (UN) 2030 Agenda for Sustainable Development (2030 Agenda), with its 17 sustainable development goals (SDGs), faces challenges such as insufficient data, limited research methodologies, and uneven progress across regions. Earth observation (EO), particularly scientific satellite... | # | PROCIEEE2026 |
End of preview. Expand in Data Studio
PaperVault Dataset · 论文元数据库
🔎 项目简介 · Overview
PaperVault 是一份持续自动更新的统一论文元数据库，覆盖自然语言处理、计算机视觉、机器学习、数据挖掘、数据库、语音、系统、网络、安全、理论计算机科学、人机交互、计算机图形学与多媒体等方向的顶级会议与期刊。PaperVault is a continuously-updated, unified metadata database of papers from top-tier conferences and journals across NLP, Computer Vision, Machine Learning, Data Mining, Databases, Speech, Systems, Networking, Security, Theory, HCI, Graphics, and Multimedia.
🌐 源仓库 / Source: github.com/youngfish42/PaperVault — Web UI、REST API、采集流水线、Issues / PRs 全部在那里 · Web UI, REST API, crawling pipelines and issues/PRs all live there.
🆕 最近更新 · Recent Update
- 📅 最近更新 · Last updated: 2026-08-01 (Asia/Shanghai)
- 📊 数据库规模 · Database size: 649,720 篇论文 / 120 个刊物系列 / 542,595 篇含摘要 / 41,941 篇含开源代码（649,720 papers / 120 venue series / 542,595 with abstract / 41,941 with code）
📈 数据看板 · Statistics at a Glance
下列 4 张统计图与 cache.jsonl.gz 同源同步，反映本数据集的最新状态。The four charts below are generated from the same cache.jsonl.gz and always reflect the latest state of this dataset.
📦 数据集内容 · What's in this dataset
| 路径 Path | 子集 Subset | 格式 Format | 说明 Description |
|---|---|---|---|
cache/cache.jsonl.gz |
papers（默认 / default） |
gzip-compressed JSON Lines (UTF-8) | 每行一篇论文 · One paper per line; one JSON object per line |
cache/abstract_backfill_progress.jsonl.gz |
abstract_backfill_progress |
gzip-compressed JSON Lines (UTF-8) | 摘要回填流水线的进度/断点记录，不是论文元数据；仅供工作流恢复使用 · Append-only progress log of the abstract-backfill pipeline (not paper records); used by the workflow to resume between runs |
Hugging Face 会自动为 cache.jsonl.gz 生成 Parquet 视图，也可直接用 datasets.load_dataset(...) 读取，无需手动解压。Hugging Face also exposes an auto-generated Parquet view, so datasets.load_dataset(...) works out of the box.
💡 Dataset Viewer 与
datasets.load_dataset("youngfish42/PaperVault")默认展示/加载的都是papers子集（即cache/cache.jsonl.gz）。如需查看回填进度，请在 Viewer 顶部下拉框切换到abstract_backfill_progress，或调用load_dataset("youngfish42/PaperVault", name="abstract_backfill_progress")。The Dataset Viewer anddatasets.load_dataset("youngfish42/PaperVault")both default to thepaperssubset (cache/cache.jsonl.gz). To inspect backfill progress, switch the Viewer's subset dropdown toabstract_backfill_progressor callload_dataset("youngfish42/PaperVault", name="abstract_backfill_progress").
📐 字段 Schema
| Field 字段 | Type 类型 | Notes 说明 |
|---|---|---|
paper_name |
string | 论文标题（已归一化）· Normalised paper title |
paper_authors |
list[string] | 作者列表，按原始顺序 · Author names in order |
paper_url |
string | 论文在原始平台的链接（PDF 或落地页）· Canonical URL on the venue's site (PDF or landing page) |
paper_abstract |
string | 摘要；未回填时为空字符串 · Abstract; may be empty when not yet backfilled |
paper_code |
string | 从摘要中抽取出的 GitHub 仓库 URL；"#" 是「未发现代码链接」的占位符 · GitHub repository URL extracted from the abstract; "#" is the sentinel for "no code link discovered" |
conf |
string | 会议+年份标识，如 ACL2024、NIPS2023、CVPR2025；去掉末尾四位数字即可得到会议系列。注意 NeurIPS Proceedings 沿用历史命名 NIPS{year}。Venue + year identifier (e.g. ACL2024, NIPS2023, CVPR2025). Strip the trailing 4-digit year to recover the venue series. Note that NeurIPS Proceedings entries use the historical name NIPS{year}. |
缺失字段请按空字符串处理。Treat missing fields as empty strings.
⬇️ 获取方式 · How to download
下面三种方式任选其一即可，无需克隆 GitHub 仓库。Pick any one of the three options below — no GitHub clone is required.
方式 A · Option A — huggingface_hub（推荐 / recommended）
from huggingface_hub import hf_hub_download
import gzip, json
path = hf_hub_download(
repo_id="youngfish42/PaperVault",
filename="cache/cache.jsonl.gz",
repo_type="dataset",
)
with gzip.open(path, "rt", encoding="utf-8") as f:
for line in f:
record = json.loads(line)
# 在这里处理一条记录 · do something with the record
方式 B · Option B — datasets
from datasets import load_dataset
ds = load_dataset("youngfish42/PaperVault")
print(ds[next(iter(ds))][0])
数据集只有一个默认 split（非 ML 训练集），不要传
split="train"。Single default split — do not passsplit="train".
方式 C · Option C — huggingface-cli / 直接 HTTPS · Plain HTTPS
huggingface-cli download youngfish42/PaperVault \
cache/cache.jsonl.gz --repo-type dataset --local-dir ./data
💡 文件压缩后约 120 MB（会随数据持续增长），解压后是 GB 级 JSONL 流，请按行流式读取，不要整体载入内存。The file is ~120 MB compressed (and growing) and decompresses to a multi-GB JSONL stream. Stream it line-by-line rather than loading the whole thing into memory.
🔁 更新节奏 · Update cadence
数据集由三个 GitHub Actions 工作流负责重建并推送到本 Hub 仓库 / The dataset is rebuilt and pushed to this Hub repo by three GitHub Actions workflows：
| 工作流 Workflow | 触发节奏 Schedule | 推送的内容 What it pushes |
|---|---|---|
collect_papers |
每月 15 号 16:00 UTC + 手动触发 · 15th of every month at 16:00 UTC + workflow_dispatch |
增量抓取新发现的会议/年份组合 · Incremental crawl of newly-discovered conference/year combinations |
backfill_abstracts |
每月 1 号 00:00 UTC + 手动触发 · 1st of every month at 00:00 UTC + workflow_dispatch |
为已有论文回填 paper_abstract · Adds paper_abstract for papers that were collected without one |
update_readme |
仅手动触发 (workflow_dispatch) · Manual only (workflow_dispatch) |
默认仅刷新 README 与统计；当输入参数 mode=force 时执行全量重建 · Refreshes the README and statistics by default; performs a full rebuild only when invoked with mode=force |
每次推送都使用 Hugging Face 的 parent_commit 乐观锁机制，避免并发覆盖。Each push uses Hugging Face's parent_commit optimistic-lock mechanism to avoid silently overwriting concurrent updates.
🔗 关联仓库 · Related repository
如果你需要完整的搜索 Web UI（智能搜索 + Web of Science 风格的高级查询 DSL）、REST API（/api/v1/*）、抓取 / 合并 / 摘要回填流水线源码、收录会议范围、统计仪表盘、项目截图或贡献指南，请前往 GitHub 项目仓库。If you are looking for the full search Web UI (smart search + Web-of-Science-style advanced query DSL), the REST API (/api/v1/*), the crawling / merging / abstract-backfill pipelines source code, conference coverage, statistics dashboards, screenshots or contribution guidelines, please visit the GitHub repository.
👉 github.com/youngfish42/PaperVault
📜 许可证 · License
代码以 GPL-3.0 发布；每条论文记录的著作权仍属于原作者 / 出版方，本数据集仅重新分发公开可获取的元数据与链接。Code is released under GPL-3.0; individual paper records remain the IP of their authors/publishers — this dataset only redistributes publicly available bibliographic metadata and links.
- Downloads last month
- 1,393