ConCovUp uses static analysis to ground LLM test generation and backward tracing to produce concurrent test drivers that raise average shared-memory access pair coverage from 36.6% to 68.1% on nine real-world libraries.
Duck, Umang Mathur, and Abhik Roychoudhury
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
k-sliced reorderings form a strictly increasing hierarchy converging to reads-from equivalence, supporting constant-space streaming algorithms for predictive monitoring against any regular specification at any fixed k.
NESA presents a neuro-symbolic framework that decomposes static analyses into policy-defined sub-problems solved by parsers and LLMs to enable compilation-free customizable analysis with reduced hallucinations.
A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.
FPGA emulator tests 10^13 error patterns in 20 days and diversity BP decoder matches BP+OSD logical error rates with 30-80% average speed gains and far less post-processing for QLDPC codes.
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.
citing papers explorer
-
ConCovUp: Effective Agent-Based Test Driver Generation for Concurrency Testing
ConCovUp uses static analysis to ground LLM test generation and backward tracing to produce concurrent test drivers that raise average shared-memory access pair coverage from 36.6% to 68.1% on nine real-world libraries.
-
Parametrizing Reads-From Equivalence for Predictive Monitoring
k-sliced reorderings form a strictly increasing hierarchy converging to reads-from equivalence, supporting constant-space streaming algorithms for predictive monitoring against any regular specification at any fixed k.
-
NESA: Relational Neuro-Symbolic Static Program Analysis
NESA presents a neuro-symbolic framework that decomposes static analyses into policy-defined sub-problems solved by parsers and LLMs to enable compilation-free customizable analysis with reduced hallucinations.
-
Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems
A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.
-
Diversity Methods for Improving Convergence and Accuracy of Quantum Error Correction Decoders Through Hardware Emulation
FPGA emulator tests 10^13 error patterns in 20 days and diversity BP decoder matches BP+OSD logical error rates with 30-80% average speed gains and far less post-processing for QLDPC codes.
-
Distributed Realization of Color Codes for Quantum Error Correction
A distributed (6.6.6) color code is realized by interconnecting patches via entangled pairs, with simulations showing the concatenated MWPM decoder maintains error threshold under asymmetric seam noise while tensor-network decoder shows slight reduction.
-
Managing Classical Processing Requirements for Quantum Error Correction
A two-level decoder scheduling framework reduces classical processing requirements for quantum error correction by 10-40% on fault-tolerant benchmarks by managing bursty workloads as shared resources.