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.
Maximal sound predictive race detection with control flow abstraction
5 Pith papers cite this work, alongside 47 external citations. Polarity classification is still indexing.
5
Pith papers citing it
47
external citations · external index
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 5roles
background 1polarities
background 1representative citing papers
CCS extended with priorities and clocks yields coherence, a property that supports compositional encoding of synchronous determinate languages like Esterel.
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.
Presents Evolving Abstract Transformers with UPOSE and AGG algorithms to create adaptable, domain-agnostic sound transformers for polyhedral abstract domains in program analysis.
Introduces the TRW partial order for sound deadlock prediction and a weakened variant for completeness, both efficiently computable and agreeing on benchmarks.
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.
-
Determinacy with Priorities up to Clocks
CCS extended with priorities and clocks yields coherence, a property that supports compositional encoding of synchronous determinate languages like Esterel.
-
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.
-
Evolving Abstract Transformers for Gradient-Guided, Adaptable Abstract Interpretation
Presents Evolving Abstract Transformers with UPOSE and AGG algorithms to create adaptable, domain-agnostic sound transformers for polyhedral abstract domains in program analysis.
-
Partial Orders for Precise and Efficient Dynamic Deadlock Prediction
Introduces the TRW partial order for sound deadlock prediction and a weakened variant for completeness, both efficiently computable and agreeing on benchmarks.