Verification of Configurable SRA Systems

2026-05-20

AI Summary

This work addresses the challenge of verifying correctness across all valid instances of configurable Software-Defined Radio Access (SRA) systems composed of asynchronous processes coordinated by domain-specific sched日晚间. Traditional approaches struggle to verify such systems holistically due to their parameterized and infinite nature. To overcome this, the paper proposes a contract-based deductive verification framework that integrates compositional proof rules, automated method summarization for scheduler invocations, and simplification of configuration-space constraints. The approach handles quantified reasoning within an object-oriented first-order logic setting and leverages Dafny as its verification backend. This is the first method capable of delivering a unified correctness proof for an infinite family of SRA instances, thereby breaking the scalability barrier in verifying parameterized asynchronous systems. Experimental results on industrial case studies demonstrate the framework’s effectiveness in enabling efficient, automated reasoning about complex parameterized behaviors.

Abstract

Many digital systems are designed as collections of asynchronous processes orchestrated by a domain-specific scheduler. The verification of such scheduler-restricted asynchronous systems (SRA) is challenging due to process-process and process-scheduler interactions. In this paper, we tackle the problem of verifying configurable SRA. A configurable SRA describes an unbounded family of possible SRA, each resulting from an instantiation satisfying given configuration constraints; our goal is proving at once that every legal instantiation of a configurable SRA is correct. We propose a contract-based, deductive verification approach that combines (i) compositional proof rules that abstract the scheduler to prove top-level invariant properties, (ii) automatic summarizations of the methods invoked by the scheduler, (iii) simplification with respect to the nature of the space of configurations. The approach is grounded in (object-oriented) first order logic, requires reasoning over quantified statements, and leverages the Dafny software verifier as a backend. An experimental evaluation on industrial case studies demonstrates that the framework scales effectively and enables practical reasoning about complex parameterized behaviors.

Problem

• configurable SRA
• verification
• scheduler-restricted asynchronous systems
• parameterized verification
• correctness

Innovation

• configurable SRA
• contract-based verification
• compositional proof rules
• automatic summarization
• quantified reasoning