The single-pass streaming space complexity of CSP(Γ) is characterized up to log factors by the non-redundancy NRD_n(Γ) of the constraint language.
Proceedings of the 34th IEEE/ACM International Conference on Automated Software Engineering , pages =
7 Pith papers cite this work. Polarity classification is still indexing.
7
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
A cross-modal alignment attack achieves AUC 0.821 for single-sample black-box membership inference on VLMs such as LLaVA-1.5 by quantifying image-generated caption similarity.
Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions.
A systematic mapping study of 248 papers introduces a taxonomy of synergistic effects, inter-analysis workflows, and mapping functions to catalog patterns in combined program analysis techniques.
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
Heuristic merging of HPC traces from separate runs extends hardware counter coverage for ML-based performance prediction and analysis.
MultiMend augments buggy function context via retrieval and generates multi-hunk patches, fixing 2,227 of 5,501 bugs across six benchmarks in four languages.
citing papers explorer
-
Characterizing Streaming Decidability of CSPs via Non-Redundancy
The single-pass streaming space complexity of CSP(Γ) is characterized up to log factors by the non-redundancy NRD_n(Γ) of the constraint language.
-
Single-Sample Black-Box Membership Inference Attack against Vision-Language Models via Cross-modal Semantic Alignment
A cross-modal alignment attack achieves AUC 0.821 for single-sample black-box membership inference on VLMs such as LLaVA-1.5 by quantifying image-generated caption similarity.
-
Non-Redundancy of Low-Arity Symmetric Boolean CSPs
Symmetric Boolean CSP predicates of arity at most 5 have their non-redundancy NRD_n(R) classified as O(n^t) for small t, with all arity-4 cases and all but two arity-5 cases resolved via t-balancedness and OR-reductions.
-
Combined Program Analysis Techniques: A Systematic Mapping Study
A systematic mapping study of 248 papers introduces a taxonomy of synergistic effects, inter-analysis workflows, and mapping functions to catalog patterns in combined program analysis techniques.
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
-
Heuristic-Based Merging of HPC Traces to Extend Hardware Counter Coverage
Heuristic merging of HPC traces from separate runs extends hardware counter coverage for ML-based performance prediction and analysis.
-
MultiMend: Multilingual Program Repair with Context Augmentation and Multi-Hunk Patch Generation
MultiMend augments buggy function context via retrieval and generates multi-hunk patches, fixing 2,227 of 5,501 bugs across six benchmarks in four languages.