Skip to content
Open access

Simulation to Silicon: A Unified Concurrency Abstraction for Portable Verification Testbenches

2026 · IEEE Access · Vol 14, pp. 117209-117230 · 0 citations · 21 references

TL;DR

This paper presents a lightweight, platform-independent concurrency abstraction that enables a single verification testbench source code to be executed consistently across SystemVerilog simulation and C/C++-based emulation environments, and demonstrates transaction-level functional equivalence across simulation and emulation platforms.

Abstract

Transaction-level System-on-Chip (SoC) verification testbenches increasingly need to operate across heterogeneous execution platforms, including event-driven SystemVerilog simulation and thread-based emulation or virtual prototyping environments. However, concurrency in verification environments is typically expressed using platform-specific mechanisms, such as fork–join constructs in simulations or operating-system threads in emulation, often leading to duplicated testbench implementations and refactoring when transitioning between platforms. This paper presents a lightweight, platform-independent concurrency abstraction that enables a single verification testbench source code to be executed consistently across SystemVerilog simulation and C/C++-based emulation environments. The approach elevates concurrency to an explicit, user-visible abstraction with well-defined semantics and decouples the verification intent from platform-specific scheduling mechanisms. A unified concurrency interface is realized through runtime polymorphism, binding to SystemVerilog processes via the Direct Programming Interface (DPI) in simulation and to POSIX threads in emulation. The framework is evaluated across multiple interface environments, including Universal Serial Bus (USB), Advanced eXtensible Interface (AXI), Mobile Industry Processor Interface Display Serial Interface 2 (MIPI DSI-2), and Universal Asynchronous Receiver-Transmitter (UART) transactors. The experimental results demonstrate transaction-level functional equivalence across simulation and emulation platforms, substantial reductions in testbench code duplication, particularly in highly concurrent environments, and low runtime overhead, with abstraction mechanism cost remaining under 1% for most evaluated protocols and reaching 3.6% in the most synchronization-intensive workload (AXI). These results show that a portable concurrency abstraction can significantly improve verification productivity while preserving correctness and incurring low runtime overhead.

Read PDF

Similar papers

Conference Jul 2026

Runtime Verification of Interleaved Concurrent Systems with Shared-Variable Communication

The paper introduces a comprehensive framework for parallel runtime verification designed to monitor concurrent systems that utilise shared-variable communication mechanisms operating under interleaved concurrency model. The proposed framework validates system behaviour during execution to confirm adherence to correctn...

Nayef H. Alshammari · 0 citations
Conference Jul 2026

Performance and Security Tradeoffs in Microservices Communication: Evaluating Reactive and Virtual-Thread Architectures Under Security-Enabled Systems

Ensuring robust security without compromising performance remains a persistent challenge in microservices architectures. Reactive, non-blocking frameworks are often recommended for high-concurrency workloads, yet the introduction of virtual threads in the Java platform (Project Loom) raises a question of whether reacti...

Kamal Azizov · 0 citations

Synchronized Transitions Based on Event Streaming ⋆

This work introduces a cross-platform, rendezvous-based synchronization concept that preserves formal firing semantics by coordinating cross-partition interactions and provides a practical, formally rigorous basis for analyzing increasingly complex coloured Petri net models beyond the limits of single-machine simulatio...

Laif-Oke Clasen, Justus Middendorf, L. Grimme et al. · 0 citations
Preprint Aug 2026

Multi-Mode Debugging for FRP-Based Embedded Systems

This paper presents a multi-mode debugging framework for Emfrp-based embedded applications that supports debugging at the level of Emfrp abstractions while also allowing inspection of platform-specific C/C++ I/O code.

Yugo Otani, Sosuke Moriguchi, Takuo Watanabe · 0 citations
Jul 2026

BTOR2-Based C Program Verification via Hardware Model Checking

C2Btor, a method for encoding verification tasks into BTOR2 models that allows C program verification to benefit from advances in hardware model-checking backends, expanding the available capability for counterexample search, inductive safety proving, and word-level transition-system reasoning.

Xinyu Zhang, Runxuan Fang, Ziqun Bao et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.