{"total":14,"items":[{"citing_arxiv_id":"2606.26979","ref_index":18,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"How Much Static Structure Do Code Agents Need? A Study of Deterministic Anchoring","primary_cat":"cs.SE","submitted_at":"2026-06-25T12:50:01+00:00","verdict":"CONDITIONAL","verdict_confidence":"MODERATE","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Lightweight call and inheritance topology injected as comments improves function localization by 2.2pp, shortens trajectories, and halves run-to-run variance in LLM code agents, with benefits depending on repository scale.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.23277","ref_index":49,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"GIF: Locally Sound Geometric Information Flow Control for LLMs","primary_cat":"cs.AI","submitted_at":"2026-06-22T12:54:04+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"GIF introduces a Jacobian-based upper bound on input-output mutual information in LLMs with formal Lean proof and strong empirical recall on injection and leakage benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.20310","ref_index":55,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Combined Program Analysis Techniques: A Systematic Mapping Study","primary_cat":"cs.SE","submitted_at":"2026-05-19T16:44:58+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"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.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"Gotlieb. Infeasible path generalization in dynamic symbolic execution.Information and Software Technology, 58:403-418, 2015. Publisher: Elsevier B.V. [54] A. Dhar, R. Purandare, M. Dhawan, and S. Rangaswamy. CLOTHO: Saving programs from malformed strings and incorrect string-handling. pages 555-566. Association for Computing Machinery, Inc, 2015. [55] A. Dimovski. Quantitative Program Sketching using Lifted Static Analysis. volume 13241 LNCS, pages 102-122. Springer Science and Business Media Deutschland GmbH, 2022. [56] A. Dimovski and A. Legay. Computing program reliability using forward-backward precondition analysis and model counting. volume 12076 LNCS, pages 182-202. Springer, 2020. [57] D."},{"citing_arxiv_id":"2605.17914","ref_index":7,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Guiding LLM-based Loop Invariant Synthesis via Feedback on Local Reasoning Errors","primary_cat":"cs.PL","submitted_at":"2026-05-18T06:23:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"LORIS detects local reasoning errors in LLM-generated proofs for loop invariants by translating natural-language steps to first-order logic implications and using invalid implications to refine the invariants, achieving 93.1% success on 460 C programs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.13929","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Linear-Time T-Gate Optimization via Random Abstraction","primary_cat":"cs.PL","submitted_at":"2026-05-13T15:54:13+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A randomized linear-time phase-folding algorithm using constant-width bitstring abstraction optimizes T-count in quantum circuits orders of magnitude faster than prior tools while achieving comparable reductions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.12694","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Agentic Interpretation: Lattice-Structured Evidence for LLM-Based Program Analysis","primary_cat":"cs.SE","submitted_at":"2026-05-12T19:46:24+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Agentic interpretation uses lattices to track LLM judgments on decomposed program claims during analysis.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.13290","ref_index":11,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Presynthesis: Towards Scaling Up Program Synthesis with Finer-Grained Abstract Semantics","primary_cat":"cs.PL","submitted_at":"2026-04-14T20:52:39+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Presynthesis constructs a tree automaton and oracle offline to allow efficient use of fine-grained abstract semantics for pruning in search-based program synthesis.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2604.07626","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Token-Sensitive Enclosure Semantics for Measurement-Bearing Expressions","primary_cat":"cs.LO","submitted_at":"2026-04-08T21:58:01+00:00","verdict":"ACCEPT","verdict_confidence":"HIGH","novelty_score":8.0,"formal_verification":"full","one_line_summary":"Introduces token-sensitive enclosure semantics where each measurement carries an interval and an observation token, defining warranted enclosures as sets of consistent values, with proofs that token-erased summaries cannot recover correct rewrite classes, all mechanized in Lean 4.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2601.20370","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"A Program Logic for Abstract (Hyper)Properties","primary_cat":"cs.LO","submitted_at":"2026-01-28T08:33:39+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":8.0,"formal_verification":"none","one_line_summary":"APPL is a sound, relatively complete abstract program logic that subsumes Hoare, incorrectness, and hyperproperty logics via lattice semantics and a non-idempotent monoidal operator for nondeterminism.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2511.20782","ref_index":9,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Optimism in Equality Saturation","primary_cat":"cs.PL","submitted_at":"2025-11-25T19:19:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"A new abstract interpretation algorithm enables sound optimistic analysis of e-graphs during equality saturation, unifying it with non-destructive rewriting and improving precision on cyclic SSA programs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2507.13635","ref_index":14,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum Circuits","primary_cat":"quant-ph","submitted_at":"2025-07-18T03:48:36+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"SAQR-QC is a new logic for scalable approximate quantitative reasoning about quantum circuits via local qubit operations and controlled precision loss, demonstrated on GHZ circuits and quantum phase estimation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2507.11827","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Evolving Abstract Transformers for Gradient-Guided, Adaptable Abstract Interpretation","primary_cat":"cs.PL","submitted_at":"2025-07-16T01:05:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Presents Evolving Abstract Transformers with UPOSE and AGG algorithms to create adaptable, domain-agnostic sound transformers for polyhedral abstract domains in program analysis.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2501.15303","ref_index":31,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Guarded Negation Transitive Closure Logic","primary_cat":"cs.LO","submitted_at":"2025-01-25T19:00:51+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2401.05753","ref_index":15,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"BEC: Bit-Level Static Analysis for Reliability against Soft Errors","primary_cat":"cs.SE","submitted_at":"2024-01-11T09:03:47+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"BEC is a bit-level static analysis implemented in LLVM that classifies register bit corruptions to prune up to 30% of fault-injection campaigns and reduce program vulnerability by up to 13% via bit-aware instruction scheduling on RISC-V.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}