Tootfinder

A Denotational Semantics for Quantum Loops
Nicola Assolini, Alessandra Di Pierro
https://arxiv.org/abs/2506.23320 https://arxiv.org/p…

A Denotational Semantics for Quantum Loops
Programming a quantum computer, i.e., implementing quantum algorithms on a quantum processor-based copmputer architecture, is a task that can be addressed (just as for classical computers) at different levels of abstraction. This paper proposes a denotational semantics for high-level quantum programming constructs, focusing on the conceptual meaning of quantum-controlled branching and iteration. We introduce a denotational domain where a mathematical meaning of a quantum control flow with loops…

Infinite Traces by Finality: a Sheaf-Theoretic Approach
Marco Peressotti
https://arxiv.org/abs/2507.22536 https://arxiv.org/pdf/2507.22536

Infinite Traces by Finality: a Sheaf-Theoretic Approach
Kleisli categories have long been recognised as a setting for modelling the linear behaviour of various types of systems. However, the final coalgebra in such settings does not, in general, correspond to a fixed notion of linear semantics. While there are well-understood conditions under which final coalgebras capture finite trace semantics, a general account of infinite trace semantics via finality has remained elusive. In this work, we present a sheaf-theoretic framework for infinite trace se…

On the Consistency of Peano Arithmetic in a Proof-theoretic Semantics for Classical Logic
Alexander V. Gheorghiu
https://arxiv.org/abs/2506.22326 https://

On the Consistency of Peano Arithmetic in a Proof-theoretic Semantics for Classical Logic
We give a proof of the consistency of Peano Arithmetic (PA) within a novel semantic framework for classical logic due to Sandqvist. The argument proceeds by constructing an object $\mathfrak{A}$ -- the arithmetic base -- which supports all axioms of PA and can be shown to not support $\bot$, relative to a well-foundedness assumption equivalent to $ε_0$-induction. This framework belongs to the paradigm of proof-theoretic semantics, that unlike model-theoretic approaches, offers a finitistically…

Dare I admit that I don't really understand what std::move() does? Of course I dare. #CPlusPlus
Reading the "Move: What it is, and how to use it" section on https://herbsutter.com/2020/02/17/move

Move, simply
C++ “move” semantics are simple, and unchanged since C++11. But they are still widely misunderstood, sometimes because of unclear teaching and sometimes because of a desire to view move…

One of our final topics in the #ISE2025 lecture were Knowledge Graph Embeddings. How to vectorise KG structures while preserving their inherent semantics?
#AI #KGE

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
Stefan Koch, Peter Sanders, Marvin Williams
https://arxiv.org/abs/2507.22764 https://arxiv.org/pdf/2507.…

BlockFIFO & MultiFIFO: Scalable Relaxed Queues
FIFO queues are a fundamental data structure used in a wide range of applications. Concurrent FIFO queues allow multiple execution threads to access the queue simultaneously. Maintaining strict FIFO semantics in concurrent queues leads to low throughput due to high contention at the head and tail of the queue. By relaxing the FIFO semantics to allow some reordering of elements, it becomes possible to achieve much higher scalability. This work presents two orthogonal designs for relaxed concurre…

Semantics-Aware Human Motion Generation from Audio Instructions
Zi-An Wang, Shihao Zou, Shiyao Yu, Mingyuan Zhang, Chao Dong
https://arxiv.org/abs/2505.23465

Semantics-Aware Human Motion Generation from Audio Instructions
Recent advances in interactive technologies have highlighted the prominence of audio signals for semantic encoding. This paper explores a new task, where audio signals are used as conditioning inputs to generate motions that align with the semantics of the audio. Unlike text-based interactions, audio provides a more natural and intuitive communication method. However, existing methods typically focus on matching motions with music or speech rhythms, which often results in a weak connection betw…

Resource-Efficient Adaptation of Large Language Models for Text Embeddings via Prompt Engineering and Contrastive Fine-tuning
Benedikt Roth, Stephan Rappensperger, Tianming Qiu, Hamza Imamovi\'c, Julian W\"ormann, Hao Shen
https://arxiv.org/abs/2507.22729

Resource-Efficient Adaptation of Large Language Models for Text Embeddings via Prompt Engineering and Contrastive Fine-tuning
Large Language Models (LLMs) have become a cornerstone in Natural Language Processing (NLP), achieving impressive performance in text generation. Their token-level representations capture rich, human-aligned semantics. However, pooling these vectors into a text embedding discards crucial information. Nevertheless, many non-generative downstream tasks, such as clustering, classification, or retrieval, still depend on accurate and controllable sentence- or document-level embeddings. We explore se…

Automated Feedback on Student-Generated UML and ER Diagrams Using Large Language Models
Sebastian G\"urtl, Gloria Schimetta, David Kerschbaumer, Michael Liut, Alexander Steinmaurer
https://arxiv.org/abs/2507.23470

Automated Feedback on Student-Generated UML and ER Diagrams Using Large Language Models
UML and ER diagrams are foundational in computer science education but come with challenges for learners due to the need for abstract thinking, contextual understanding, and mastery of both syntax and semantics. These complexities are difficult to address through traditional teaching methods, which often struggle to provide scalable, personalized feedback, especially in large classes. We introduce DUET (Diagrammatic UML & ER Tutor), a prototype of an LLM-based tool, which converts a reference d…

CircuitProbe: Dissecting Spatiotemporal Visual Semantics with Circuit Tracing
Yiming Zhang, Chengzhang Yu, Zhuokai Zhao, Kun Wang, Qiankun Li, Zihan Chen, Yang Liu, Zenghui Ding, Yining Sun
https://arxiv.org/abs/2507.19420

CircuitProbe: Dissecting Spatiotemporal Visual Semantics with Circuit Tracing
The processing mechanisms underlying language and image understanding in large vision-language models (LVLMs) have been extensively studied. However, the internal reasoning mechanisms of LVLMs for spatiotemporal understanding remain poorly understood. In this work, we introduce a systematic, circuit-based framework designed to investigate how spatiotemporal visual semantics are represented and processed within these LVLMs. Specifically, our framework comprises three circuits: visual auditing ci…

UnMix-NeRF: Spectral Unmixing Meets Neural Radiance Fields
Fabian Perez, Sara Rojas, Carlos Hinojosa, Hoover Rueda-Chac\'on, Bernard Ghanem
https://arxiv.org/abs/2506.21884

UnMix-NeRF: Spectral Unmixing Meets Neural Radiance Fields
Neural Radiance Field (NeRF)-based segmentation methods focus on object semantics and rely solely on RGB data, lacking intrinsic material properties. This limitation restricts accurate material perception, which is crucial for robotics, augmented reality, simulation, and other applications. We introduce UnMix-NeRF, a framework that integrates spectral unmixing into NeRF, enabling joint hyperspectral novel view synthesis and unsupervised material segmentation. Our method models spectral reflecta…

This https://arxiv.org/abs/2503.04779 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Can LLMs Reason About Program Semantics? A Comprehensive Evaluation of LLMs on Formal Specification Inference
Large Language Models (LLMs) are increasingly being used to automate programming tasks. Yet, LLMs' capabilities in reasoning about program semantics are still inadequately studied, leaving significant potential for further exploration. This paper introduces FormalBench, a comprehensive benchmark designed to evaluate LLMs' reasoning abilities on program semantics, particularly via the task of synthesizing formal program specifications to assist verifying program correctness. This task requires b…

GestureHYDRA: Semantic Co-speech Gesture Synthesis via Hybrid Modality Diffusion Transformer and Cascaded-Synchronized Retrieval-Augmented Generation
Quanwei Yang, Luying Huang, Kaisiyuan Wang, Jiazhi Guan, Shengyi He, Fengguo Li, Hang Zhou, Lingyun Yu, Yingying Li, Haocheng Feng, Hongtao Xie
https://arxiv.org/abs/2507.22731

GestureHYDRA: Semantic Co-speech Gesture Synthesis via Hybrid Modality Diffusion Transformer and Cascaded-Synchronized Retrieval-Augmented Generation
While increasing attention has been paid to co-speech gesture synthesis, most previous works neglect to investigate hand gestures with explicit and essential semantics. In this paper, we study co-speech gesture generation with an emphasis on specific hand gesture activation, which can deliver more instructional information than common body movements. To achieve this, we first build a high-quality dataset of 3D human body movements including a set of semantically explicit hand gestures that are …

PSALM-V: Automating Symbolic Planning in Interactive Visual Environments with Large Language Models
Wang Bill Zhu, Miaosen Chai, Ishika Singh, Robin Jia, Jesse Thomason
https://arxiv.org/abs/2506.20097

PSALM-V: Automating Symbolic Planning in Interactive Visual Environments with Large Language Models
We propose PSALM-V, the first autonomous neuro-symbolic learning system able to induce symbolic action semantics (i.e., pre- and post-conditions) in visual environments through interaction. PSALM-V bootstraps reliable symbolic planning without expert action definitions, using LLMs to generate heuristic plans and candidate symbolic semantics. Previous work has explored using large language models to generate action semantics for Planning Domain Definition Language (PDDL)-based symbolic planners.…

Recursive Difference Categories and Topos-Theoretic Universality
Andreu Ballus Santacana
https://arxiv.org/abs/2505.22931 https://arx…

Recursive Difference Categories and Topos-Theoretic Universality
We introduce a radically minimal categorical foundation for logic, semantics, and computation, built from a single generative axiom of recursive difference. From the null mnema M0 and iterated labeled extensions by D, we form the free category M and its sheaf topos Sh(M). We prove: Modal completeness: Lawvere-Tierney topologies on Sh(M) classify all standard modal logics (K, T, S4, S5) purely via submonoids of the free monoid D*. Fixed-point expressivity: The internal mu-calculus over infin…

Why not? Developing ABox Abduction beyond Repairs
Anselm Haak, Patrick Koopmann, Yasir Mahmood, Anni-Yasmin Turhan
https://arxiv.org/abs/2507.21955 https://

Why not? Developing ABox Abduction beyond Repairs
Abduction is the task of computing a sufficient extension of a knowledge base (KB) that entails a conclusion not entailed by the original KB. It serves to compute explanations, or hypotheses, for such missing entailments. While this task has been intensively investigated for perfect data and under classical semantics, less is known about abduction when erroneous data results in inconsistent KBs. In this paper we define a suitable notion of abduction under repair semantics, and propose a set of …

This https://arxiv.org/abs/2501.13114 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Continuous Algebra: Algebraic Semantics for Continuous Propositional Logic
We have introduced continuous algebra as the algebraic semantics for Continuous Propositional Logic (CPL). A Continuous algebra is an MV-algebra together with an unary operator $κ$, analogous to the unary connective $\dfrac{1}{2}$ in CPL. We establish structural results, including the subdirect representation theorem. We also introduce $\ell u^*$-groups, which are lattice ordered groups with strong unit $u$, denoted by $\ell u$-groups, with a partial operator $^*$ that mimics the behavior of $…

SurgPIS: Surgical-instrument-level Instances and Part-level Semantics for Weakly-supervised Part-aware Instance Segmentation
Meng Wei, Charlie Budd, Oluwatosin Alabi, Miaojing Shi, Tom Vercauteren
https://arxiv.org/abs/2507.19592

SurgPIS: Surgical-instrument-level Instances and Part-level Semantics for Weakly-supervised Part-aware Instance Segmentation
Consistent surgical instrument segmentation is critical for automation in robot-assisted surgery. Yet, existing methods only treat instrument-level instance segmentation (IIS) or part-level semantic segmentation (PSS) separately, without interaction between these tasks. In this work, we formulate a surgical tool segmentation as a unified part-aware instance segmentation (PIS) problem and introduce SurgPIS, the first PIS model for surgical instruments. Our method adopts a transformer-based mask …

AI-Driven Generation of Data Contracts in Modern Data Engineering Systems
Harshraj Bhoite
https://arxiv.org/abs/2507.21056 https://arxiv.org/pdf/2507.21056…

AI-Driven Generation of Data Contracts in Modern Data Engineering Systems
Data contracts formalize agreements between data producers and consumers regarding schema, semantics, and quality expectations. As data pipelines grow in complexity, manual authoring and maintenance of contracts becomes error-prone and labor-intensive. We present an AI-driven framework for automatic data contract generation using large language models (LLMs). Our system leverages parameter-efficient fine-tuning methods, including LoRA and PEFT, to adapt LLMs to structured data domains. The mode…

On the Role of Age and Semantics of Information in Remote Estimation of Markov Sources
Jiping Luo, Nikolaos Pappas
https://arxiv.org/abs/2507.18514 https://

On the Role of Age and Semantics of Information in Remote Estimation of Markov Sources
This paper investigates the semantics-aware remote estimation of a finite-state Markov chain. We employ the maximum a posteriori (MAP) estimator and aim to devise a transmission policy to optimize estimation performance subject to a transmission frequency constraint. We leverage two metrics, namely the Age of Consecutive Error (AoCE) and the Age of Information (AoI), to quantify, respectively, the significance of estimation error at the transmitter and the predictability of outdated information…

This https://arxiv.org/abs/2502.18200 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_ees…

Zero-Shot Semantic Communication with Multimodal Foundation Models
Most existing semantic communication (SemCom) systems use deep joint source-channel coding (DeepJSCC) to encode task-specific semantics in a goal-oriented manner. However, their reliance on predefined tasks and datasets significantly limits their flexibility and generalizability in practical deployments. Multi-modal foundation models provide a promising solution by generating universal semantic tokens. Inspired by this, we introduce SemCLIP, a zero-shot SemCom framework leveraging the contrasti…

Right a few days before I'll be talking about patterns in DRAM init at #GPN23, #Binarly are posting on their type inference tooling:

Type Inference for Decompiled Code: From Hidden Semantics to Structured Insights
Learn how Binarly enhances decompiled code by recovering meaningful type info—boosting binary analysis, triage, and reverse engineering accuracy.

Beyond Syntax: Action Semantics Learning for App Agents
Bohan Tang, Dezhao Luo, Jingxuan Chen, Shaogang Gong, Jianye Hao, Jun Wang, Kun Shao
https://arxiv.org/abs/2506.17697

Beyond Syntax: Action Semantics Learning for App Agents
The advent of Large Language Models (LLMs) enables the rise of App agents that interpret user intent and operate smartphone Apps through actions such as clicking and scrolling. While prompt-based solutions with closed LLM APIs show promising ability, they incur heavy compute costs and external API dependency. Fine-tuning smaller open-source LLMs solves these limitations. However, current fine-tuning methods use a syntax learning paradigm that forces agents to reproduce exactly the ground truth …

Bridging Compositional and Distributional Semantics: A Survey on Latent Semantic Geometry via AutoEncoder
Yingji Zhang, Danilo S. Carvalho, Andr\'e Freitas
https://arxiv.org/abs/2506.20083

Bridging Compositional and Distributional Semantics: A Survey on Latent Semantic Geometry via AutoEncoder
Integrating compositional and symbolic properties into current distributional semantic spaces can enhance the interpretability, controllability, compositionality, and generalisation capabilities of Transformer-based auto-regressive language models (LMs). In this survey, we offer a novel perspective on latent space geometry through the lens of compositional semantics, a direction we refer to as \textit{semantic representation learning}. This direction enables a bridge between symbolic and distri…

The Boolean Compactness Theorem for $\mathrm{L}_{\infty\infty}$
Juan M Santiago Su\'arez, Matteo Viale
https://arxiv.org/abs/2507.21005 https://arxiv.o…

The Boolean Compactness Theorem for $\mathrm{L}_{\infty\infty}$
We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch from Tarski semantics to Boolean valued semantics. On the way to prove it, we also show that the latter is a (the?) natural semantics both for $\mathrm{L}_{\infty\infty}$ and for $\mathrm{L}_{\inftyω}$.

SemAgent: A Semantics Aware Program Repair Agent
Anvith Pabba, Alex Mathai, Anindya Chakraborty, Baishakhi Ray
https://arxiv.org/abs/2506.16650 https://

SemAgent: A Semantics Aware Program Repair Agent
Large Language Models (LLMs) have shown impressive capabilities in downstream software engineering tasks such as Automated Program Repair (APR). In particular, there has been a lot of research on repository-level issue-resolution benchmarks such as SWE-Bench. Although there has been significant progress on this topic, we notice that in the process of solving such issues, existing agentic systems tend to hyper-localize on immediately suspicious lines of code and fix them in isolation, without a …

Replaced article(s) found for cs.IR. https://arxiv.org/list/cs.IR/new
[1/1]:
- Information Retrieval in long documents: Word clustering approach for improving Semantics
Paul Mbathe Mekontchou, Armel Fotsoh, Bernabe Batchakui, Eddy Ella

An instance of FreeCHR with refined operational semantics
Sascha Rechenberger, Thom Fr\"uhwirth
https://arxiv.org/abs/2505.22155 https://

An instance of FreeCHR with refined operational semantics
Constraint Handling Rules (CHR) is a rule-based programming language which is typically embedded into a general-purpose language. There exists a plethora of implementations of CHR for numerous host languages. However, the existing implementations often reinvent the way to embed CHR, which impedes maintenance and weakens assertions of correctness. To formalize and thereby unify the embedding of CHR into arbitrary host languages, we introduced the framework FreeCHR and proved it to be a valid rep…

StoryGem: Voronoi treemap Approach for Semantics-Preserving Text Visualization
Naoya Oda, Yosuke Onoue
https://arxiv.org/abs/2506.18793 https://

StoryGem: Voronoi treemap Approach for Semantics-Preserving Text Visualization
Word cloud use is a popular text visualization technique that scales font sizes based on word frequencies within a defined spatial layout. However, traditional word clouds disregard semantic relationships between words, arranging them without considering their meanings. Semantic word clouds improved on this by positioning related words in proximity; however, still struggled with efficient space use and representing frequencies through font size variations, which can be misleading because of wor…

Rethinking Dataset Discovery with DataScout
Rachel Lin, Bhavya Chopra, Wenjing Lin, Shreya Shankar, Madelon Hulsebos, Aditya G. Parameswaran
https://arxiv.org/abs/2507.18971 htt…

Rethinking Dataset Discovery with DataScout
Dataset Search -- the process of finding appropriate datasets for a given task -- remains a critical yet under-explored challenge in data science workflows. Assessing dataset suitability for a task (e.g., training a classification model) is a multi-pronged affair that involves understanding: data characteristics (e.g. granularity, attributes, size), semantics (e.g., data semantics, creation goals), and relevance to the task at hand. Present-day dataset search interfaces are restrictive -- users…

SemGes: Semantics-aware Co-Speech Gesture Generation using Semantic Coherence and Relevance Learning
Lanmiao Liu, Esam Ghaleb, Asl{\i} \"Ozy\"urek, Zerrin Yumak
https://arxiv.org/abs/2507.19359

SemGes: Semantics-aware Co-Speech Gesture Generation using Semantic Coherence and Relevance Learning
Creating a virtual avatar with semantically coherent gestures that are aligned with speech is a challenging task. Existing gesture generation research mainly focused on generating rhythmic beat gestures, neglecting the semantic context of the gestures. In this paper, we propose a novel approach for semantic grounding in co-speech gesture generation that integrates semantic information at both fine-grained and global levels. Our approach starts with learning the motion prior through a vector-qua…

EVOKS (Editor for Vocabularies to Know Semantics) "allows you to:
- create a #SKOS vocabulary from scratch
- import SKOS vocabularies in RDF/XML or Turtle format
- edit SKOS vocabularies without using its textual representation
- work collaborativley
- publish the vocabulary with a single click in the vocabulary browser

Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning
Xiaofeng Pan, Jing Chen, Haitong Zhang, Menglin Xing, Jiayi Wei, Xuefeng Mu, Zhongqian Xie
https://arxiv.org/abs/2505.23298

Bridging the Gap Between Semantic and User Preference Spaces for Multi-modal Music Representation Learning
Recent works of music representation learning mainly focus on learning acoustic music representations with unlabeled audios or further attempt to acquire multi-modal music representations with scarce annotated audio-text pairs. They either ignore the language semantics or rely on labeled audio datasets that are difficult and expensive to create. Moreover, merely modeling semantic space usually fails to achieve satisfactory performance on music recommendation tasks since the user preference spac…

Graph-R1: Towards Agentic GraphRAG Framework via End-to-end Reinforcement Learning
Haoran Luo, Haihong E, Guanting Chen, Qika Lin, Yikai Guo, Fangzhi Xu, Zemin Kuang, Meina Song, Xiaobao Wu, Yifan Zhu, Luu Anh Tuan
https://arxiv.org/abs/2507.21892

Graph-R1: Towards Agentic GraphRAG Framework via End-to-end Reinforcement Learning
Retrieval-Augmented Generation (RAG) mitigates hallucination in LLMs by incorporating external knowledge, but relies on chunk-based retrieval that lacks structural semantics. GraphRAG methods improve RAG by modeling knowledge as entity-relation graphs, but still face challenges in high construction cost, fixed one-time retrieval, and reliance on long-context reasoning and prompt design. To address these challenges, we propose Graph-R1, an agentic GraphRAG framework via end-to-end reinforcement …

The Power of Negation in Higher-Order Datalog
Angelos Charalambidis, Babis Kostopoulos, Christos Nomikos, Panos Rondogiannis
https://arxiv.org/abs/2507.20251 https://

The Power of Negation in Higher-Order Datalog
We investigate the expressive power of Higher-Order Datalog$^\neg$ under both the well-founded and the stable model semantics, establishing tight connections with complexity classes. We prove that under the well-founded semantics, for all $k\geq 1$, $(k+1)$-Order Datalog$^\neg$ captures k-EXP, a result that holds without explicit ordering of the input database. The proof of this fact can be performed either by using the powerful existential predicate variables of the language or by using partia…

A Formalization of the Yul Language and Some Verified Yul Code Transformations
Alessandro Coglio (Kestrel Institute), Eric McCarthy (Kestrel Institute)
https://arxiv.org/abs/2507.19012

A Formalization of the Yul Language and Some Verified Yul Code Transformations
Yul is an intermediate language used in the compilation of the Solidity programming language for Ethereum smart contracts. The compiler applies customizable sequences of transformations to Yul code. To help ensure the correctness of these transformations and their sequencing, we used the ACL2 theorem prover to develop a formalization of the syntax and semantics of Yul, proofs relating static and dynamic semantics, a formalization of some Yul code transformations, and correctness proofs for thes…

Last week, we continued our #ISE2025 lecture on distributional semantics with the introduction of neural language models (NLMs) and compared them to traditional statistical n-gram models.
Benefits of NLMs:
- Capturing Long-Range Dependencies
- Computational and Statistical Tractability
- Improved Generalisation
- Higher Accuracy
@…

from my link log —
Making sense of atomic acquire-release semantics.
https://davekilian.com/acquire-release.html
saved 2025-06-08 ht…

Spatial Language Likelihood Grounding Network for Bayesian Fusion of Human-Robot Observations
Supawich Sitdhipol, Waritwong Sukprasongdee, Ekapol Chuangsuwanich, Rina Tse
https://arxiv.org/abs/2507.19947

Spatial Language Likelihood Grounding Network for Bayesian Fusion of Human-Robot Observations
Fusing information from human observations can help robots overcome sensing limitations in collaborative tasks. However, an uncertainty-aware fusion framework requires a grounded likelihood representing the uncertainty of human inputs. This paper presents a Feature Pyramid Likelihood Grounding Network (FP-LGN) that grounds spatial language by learning relevant map image features and their relationships with spatial relation semantics. The model is trained as a probability estimator to capture a…

Fun educational psychology experiment idea if anyone wants to run it by an IRB and get a paper published:
Get an entire compsci 1 class to take the RAADS-R. Then measure how easily/quickly they understood call/return stack semantics when the concept was first introduced (based on quiz/homework score, self reported "this makes sense" level, or something else).
And scatter plot the two against each other. Do you get two neat clusters?

Ov3R: Open-Vocabulary Semantic 3D Reconstruction from RGB Videos
Ziren Gong, Xiaohan Li, Fabio Tosi, Jiawei Han, Stefano Mattoccia, Jianfei Cai, Matteo Poggi
https://arxiv.org/abs/2507.22052

Ov3R: Open-Vocabulary Semantic 3D Reconstruction from RGB Videos
We present Ov3R, a novel framework for open-vocabulary semantic 3D reconstruction from RGB video streams, designed to advance Spatial AI. The system features two key components: CLIP3R, a CLIP-informed 3D reconstruction module that predicts dense point maps from overlapping clips while embedding object-level semantics; and 2D-3D OVS, a 2D-3D open-vocabulary semantic module that lifts 2D features into 3D by learning fused descriptors integrating spatial, geometric, and semantic cues. Unlike prio…

ChartMark: A Structured Grammar for Chart Annotation
Yiyu Chen, Yifan Wu, Shuyu Shen, Yupeng Xie, Leixian Shen, Hui Xiong, Yuyu Luo
https://arxiv.org/abs/2507.21810 https://

ChartMark: A Structured Grammar for Chart Annotation
Chart annotations enhance visualization accessibility but suffer from fragmented, non-standardized representations that limit cross-platform reuse. We propose ChartMark, a structured grammar that separates annotation semantics from visualization implementations. ChartMark features a hierarchical framework mapping onto annotation dimensions (e.g., task, chart context), supporting both abstract intents and precise visual details. Our toolkit demonstrates converting ChartMark specifications into V…

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
Pietro Galliani
https://arxiv.org/abs/2506.15367 https://arx…

Strongly First Order Disjunctive Embedded Dependencies in Team Semantics
First Order Team Semantics is a generalization of Tarskian Semantics in which formulas are satisfied with respect to sets of assignments. In Team Semantics, it is possible to extend First Order Logic via new types of atoms that describe dependencies between variables; some of these extensions are strictly more expressive than First Order Logic, while others are reducible to it. Many of the atoms studied in Team Semantics are inspired by Database Theory and belong in particular to the class of…

Integrating Belief Domains into Probabilistic Logic Programs
Damiano Azzolini, Fabrizio Riguzzi, Theresa Swift
https://arxiv.org/abs/2507.17291 https://arx…

Integrating Belief Domains into Probabilistic Logic Programs
Probabilistic Logic Programming (PLP) under the Distribution Semantics is a leading approach to practical reasoning under uncertainty. An advantage of the Distribution Semantics is its suitability for implementation as a Prolog or Python library, available through two well-maintained implementations, namely ProbLog and cplint/PITA. However, current formulations of the Distribution Semantics use point-probabilities, making it difficult to express epistemic uncertainty, such as arises from, for e…

NIRS: An Ontology for Non-Invasive Respiratory Support in Acute Care
Md Fantacher Islam, Jarrod Mosier, Vignesh Subbian
https://arxiv.org/abs/2507.19992 https://

NIRS: An Ontology for Non-Invasive Respiratory Support in Acute Care
Objective: Develop a Non Invasive Respiratory Support (NIRS) ontology to support knowledge representation in acute care settings. Materials and Methods: We developed the NIRS ontology using Web Ontology Language (OWL) semantics and Protege to organize clinical concepts and relationships. To enable rule-based clinical reasoning beyond hierarchical structures, we added Semantic Web Rule Language (SWRL) rules. We evaluated logical reasoning by adding 17 hypothetical patient clinical scenarios. W…

Optimizing Tree-structure Indexes for CXL-based Heterogeneous Memory with SINLK
Haoru Zhao, Mingkai Dong, Fangnuo Wu, Haibo Chen
https://arxiv.org/abs/2507.18559 https://…

Optimizing Tree-structure Indexes for CXL-based Heterogeneous Memory with SINLK
On heterogeneous memory (HM) where fast memory (i.e., CPU-attached DRAM) and slow memory (e.g., remote NUMA memory, RDMA-connected memory, Persistent Memory (PM)) coexist, optimizing the placement of tree-structure indexes (e.g., B+tree) is crucial to achieving high performance while enjoying memory expansion. Nowadays, CXL-based heterogeneous memory (CXL-HM) is emerging due to its high efficiency and memory semantics. Prior tree-structure index placement schemes for HM cannot effectively boost…

Replaced article(s) found for cs.GT. https://arxiv.org/list/cs.GT/new
[1/1]:
- TSO Games -- On the decidability of safety games under the total store order semantics (extended ...
Stephan Spengler, Sanchari Sil

Properties for Paths in Graph Databases
Fernando Orejas, Elvira Pino, Renzo Angles, E. Pasarella, Nikos Milonakis
https://arxiv.org/abs/2507.19329 https://…

Properties for Paths in Graph Databases
This paper presents a formalism for defining properties of paths in graph databases, which can be used to restrict the number of solutions to navigational queries. In particular, our formalism allows us to define quantitative properties such as length or accumulated cost, which can be used as query filters. Furthermore, it enables the identification and removal of paths that may be considered ill-formed. The new formalism is defined in terms of an operational semantics for the query language …

So you need to get the version of Intel #MKL.
You can't really take it out of the pkg-config files, because not every distro mkl version combo supplies these files. On top of that, without pointing fingers, certain distribution installs pkg-config files with "debian" in the version field.
Well, there's INTEL_MKL_VERSION you can get via the C preprocessor, right? Except that its semantics depend… on mkl version. Given that mkl is released as "<major>.<update>.<patch>", versions prior to 2025.0.0 constructed the version number from <major> <minor> <update> (where <minor> seems to be always 0, and <patch> was not included), and 2025.0.0 forward use the more logical <major> <update> <patch>.
Well, yeah, it's kinda doable. You parse the major first, and parse the rest depending on whether it's >= 2025 or not. For versions prior to 2025, you get it truncated to update. It works, but still kinda funny.
#WTF

Benchmarking Multimodal Understanding and Complex Reasoning for ESG Tasks
Lei Zhang, Xin Zhou, Chaoyue He, Di Wang, Yi Wu, Hong Xu, Wei Liu, Chunyan Miao
https://arxiv.org/abs/2507.18932

Benchmarking Multimodal Understanding and Complex Reasoning for ESG Tasks
Environmental, Social, and Governance (ESG) reports are essential for evaluating sustainability practices, ensuring regulatory compliance, and promoting financial transparency. However, these documents are often lengthy, structurally diverse, and multimodal, comprising dense text, structured tables, complex figures, and layout-dependent semantics. Existing AI systems often struggle to perform reliable document-level reasoning in such settings, and no dedicated benchmark currently exists in ESG …

Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
Pascal Kettmann, Jesse Heyninck, Hannes Strass
https://arxiv.org/abs/2507.11961

Approximation Fixpoint Theory as a Unifying Framework for Fuzzy Logic Programming Semantics (Extended Version)
Fuzzy logic programming is an established approach for reasoning under uncertainty. Several semantics from classical, two-valued logic programming have been generalized to the case of fuzzy logic programs. In this paper, we show that two of the most prominent classical semantics, namely the stable model and the well-founded semantics, can be reconstructed within the general framework of approximation fixpoint theory (AFT). This not only widens the scope of AFT from two- to many-valued logics, b…

Beyond Formal Semantics for Capabilities and Skills: Model Context Protocol in Manufacturing
Luis Miguel Vieira da Silva, Aljosha K\"ocher, Felix Gehlhoff
https://arxiv.org/abs/2506.11180

Beyond Formal Semantics for Capabilities and Skills: Model Context Protocol in Manufacturing
Explicit modeling of capabilities and skills -- whether based on ontologies, Asset Administration Shells, or other technologies -- requires considerable manual effort and often results in representations that are not easily accessible to Large Language Models (LLMs). In this work-in-progress paper, we present an alternative approach based on the recently introduced Model Context Protocol (MCP). MCP allows systems to expose functionality through a standardized interface that is directly consumab…

Formal Verification for JavaScript Regular Expressions: a Proven Semantics and its Applications
Aur\`ele Barri\`ere, Victor Deng, Cl\'ement Pit-Claudel
https://arxiv.org/abs/2507.13091

Formal Verification for JavaScript Regular Expressions: a Proven Semantics and its Applications
We present the first mechanized, succinct, practical, complete, and proven-faithful semantics for a modern regular expression language with backtracking semantics. We ensure its faithfulness by proving it equivalent to a preexisting line-by-line embedding of the official ECMAScript specification of JavaScript regular expressions. We demonstrate its practicality by presenting two real-world applications. First, a new notion of contextual equivalence for modern regular expressions, which we use t…

The complexity of deciding characteristic formulae modulo nested simulation
Luca Aceto, Antonis Achilleos, Aggeliki Chalki, Anna Ingolfsdottir
https://arxiv.org/abs/2505.22277

The complexity of deciding characteristic formulae modulo nested simulation
This paper studies the complexity of determining whether a formula in the modal logics characterizing the nested-simulation semantics is characteristic for some process, which is equivalent to determining whether the formula is satisfiable and prime. The main results are that the problem of determining whether a formula is prime in the modal logic characterizing the 2-nested-simulation preorder is CoNP-complete and is PSPACE-complete in the case of the n-nested-simulation preorder, when n>= 3. …

Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search
Seunghun Lee, Jihong Park, Jinho Choi, Hyuncheol Park
https://arxiv.org/abs/2506.19451

Low-Complexity Semantic Packet Aggregation for Token Communication via Lookahead Search
Tokens are fundamental processing units of generative AI (GenAI) and large language models (LLMs), and token communication (TC) is essential for enabling remote AI-generate content (AIGC) and wireless LLM applications. Unlike traditional bits, each of which is independently treated, the semantics of each token depends on its surrounding context tokens. This inter-token dependency makes TC vulnerable to outage channels, where the loss of a single token can significantly distort the original mess…

Maximal Matching Matters: Preventing Representation Collapse for Robust Cross-Modal Retrieval
Hani Alomari, Anushka Sivakumar, Andrew Zhang, Chris Thomas
https://arxiv.org/abs/2506.21538

Maximal Matching Matters: Preventing Representation Collapse for Robust Cross-Modal Retrieval
Cross-modal image-text retrieval is challenging because of the diverse possible associations between content from different modalities. Traditional methods learn a single-vector embedding to represent semantics of each sample, but struggle to capture nuanced and diverse relationships that can exist across modalities. Set-based approaches, which represent each sample with multiple embeddings, offer a promising alternative, as they can capture richer and more diverse relationships. In this paper,…

A Model-Independent Theory of Probabilistic Testing
Weijun Chen, Yuxi Fu, Huan Long, Hao Wu
https://arxiv.org/abs/2507.19886 https://arxiv.org/pdf/2507.198…

A Model-Independent Theory of Probabilistic Testing
Probabilistic concurrent systems are foundational models for modern mobile computing. In this paper, a general model-independent approach to probabilistic testing is proposed. With the help of a new distribution-based semantics for probabilistic models and a probabilistic testing framework with respect to process predicates, the model-independent characterization and the external characterization for testing equivalences are studied. The latter characterization can be viewed as the generalizati…

Base-extension Semantics for Intuitionistic Modal Logics
Yll Buzoku, David. J. Pym
https://arxiv.org/abs/2507.06834 https://arxiv.org…

Base-extension Semantics for Intuitionistic Modal Logics
The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by proof-theoretic semantics, which is a logical realization of inferentialism, in which the meaning of constructs is understood through their use. The key idea in proof-theoretic semantics is that of a base of atomic rules, all of which refer only to propositional atoms …

Towards Domain Specification of Embedding Models in Medicine
Mohammad Khodadad, Ali Shiraee, Mahdi Astaraki, Hamidreza Mahyar
https://arxiv.org/abs/2507.19407 https://

Towards Domain Specification of Embedding Models in Medicine
Medical text embedding models are foundational to a wide array of healthcare applications, ranging from clinical decision support and biomedical information retrieval to medical question answering, yet they remain hampered by two critical shortcomings. First, most models are trained on a narrow slice of medical and biological data, beside not being up to date in terms of methodology, making them ill suited to capture the diversity of terminology and semantics encountered in practice. Second, ex…

MyGO: Make your Goals Obvious, Avoiding Semantic Confusion in Prostate Cancer Lesion Region Segmentation
Zhengcheng Lin (City University of Macau), Zuobin Ying (City University of Macau), Zhenyu Li (Shandong University), Zhenyu Liu (Chinese Academy of Sciences), Jian Lu (Peking University), Weiping Ding (Nantong University)
https://

MyGO: Make your Goals Obvious, Avoiding Semantic Confusion in Prostate Cancer Lesion Region Segmentation
Early diagnosis and accurate identification of lesion location and progression in prostate cancer (PCa) are critical for assisting clinicians in formulating effective treatment strategies. However, due to the high semantic homogeneity between lesion and non-lesion areas, existing medical image segmentation methods often struggle to accurately comprehend lesion semantics, resulting in the problem of semantic confusion. To address this challenge, we propose a novel Pixel Anchor Module, which guid…

ReSem3D: Refinable 3D Spatial Constraints via Fine-Grained Semantic Grounding for Generalizable Robotic Manipulation
Chenyu Su, Weiwei Shang, Chen Qian, Fei Zhang, Shuang Cong
https://arxiv.org/abs/2507.18262

ReSem3D: Refinable 3D Spatial Constraints via Fine-Grained Semantic Grounding for Generalizable Robotic Manipulation
Semantics-driven 3D spatial constraints align highlevel semantic representations with low-level action spaces, facilitating the unification of task understanding and execution in robotic manipulation. The synergistic reasoning of Multimodal Large Language Models (MLLMs) and Vision Foundation Models (VFMs) enables cross-modal 3D spatial constraint construction. Nevertheless, existing methods have three key limitations: (1) coarse semantic granularity in constraint modeling, (2) lack of real-time…

In the #ISE2025 lecture today we were introducing our students to the concept of distributional semantics as the foundation of modern large language models. Historically, Wittgenstein was one of the important figures in the Philosophy of Language stating thet "The meaning of a word is its use in the language."

Verification of the Release-Acquire Semantics
Parosh Abdulla, Elli Anastasiadi, Mohamed Faouzi Atig, Samuel Grahn
https://arxiv.org/abs/2506.08238 https://…

Verification of the Release-Acquire Semantics
The Release-Acquire (RA) semantics and its variants are some of the most fundamental models of concurrent semantics for architectures, programming languages, and distributed systems. Several steps have been taken in the direction of testing such semantics, where one is interested in whether a single program execution is consistent with a memory model. The more general verification problem, i.e., checking whether all allowed program runs are consistent with a memory model, has still not been stu…

Inferring Attributed Grammars from Parser Implementations
Andreas Pointner, Josef Pichler, Herbert Pr\"ahofer
https://arxiv.org/abs/2507.13117 https:/…

Inferring Attributed Grammars from Parser Implementations
Software systems that process structured inputs often lack complete and up-to-date specifications, which specify the input syntax and the semantics of input processing. While grammar mining techniques have focused on recovering syntactic structures, the semantics of input processing remains largely unexplored. In this work, we introduce a novel approach for inferring attributed grammars from parser implementations. Given an input grammar, our technique dynamically analyzes the implementation of…

The Gauss-Markov Adjunction: Categorical Semantics of Residuals in Supervised Learning
Moto Kamiura
https://arxiv.org/abs/2507.02442 https://

The Gauss-Markov Adjunction: Categorical Semantics of Residuals in Supervised Learning
Enhancing the intelligibility and interpretability of machine learning is a crucial task in responding to the demand for Explicability as an AI principle, and in promoting the better social implementation of AI. The aim of our research is to contribute to this improvement by reformulating machine learning models through the lens of category theory, thereby developing a semantic framework for structuring and understanding AI systems. Our categorical modeling in this paper clarifies and formalize…

Structured Semantics from Unstructured Notes: Language Model Approaches to EHR-Based Decision Support
Wu Hao Ran, Xi Xi, Furong Li, Jingyi Lu, Jian Jiang, Hui Huang, Yuzhuan Zhang, Shi Li
https://arxiv.org/abs/2506.06340

Structured Semantics from Unstructured Notes: Language Model Approaches to EHR-Based Decision Support
The advent of large language models (LLMs) has opened new avenues for analyzing complex, unstructured data, particularly within the medical domain. Electronic Health Records (EHRs) contain a wealth of information in various formats, including free text clinical notes, structured lab results, and diagnostic codes. This paper explores the application of advanced language models to leverage these diverse data sources for improved clinical decision support. We will discuss how text-based features, …

IPFormer: Visual 3D Panoptic Scene Completion with Context-Adaptive Instance Proposals
Markus Gross, Aya Fahmy, Danit Niwattananan, Dominik Muhle, Rui Song, Daniel Cremers, Henri Mee{\ss}
https://arxiv.org/abs/2506.20671

IPFormer: Visual 3D Panoptic Scene Completion with Context-Adaptive Instance Proposals
Semantic Scene Completion (SSC) has emerged as a pivotal approach for jointly learning scene geometry and semantics, enabling downstream applications such as navigation in mobile robotics. The recent generalization to Panoptic Scene Completion (PSC) advances the SSC domain by integrating instance-level information, thereby enhancing object-level sensitivity in scene understanding. While PSC was introduced using LiDAR modality, methods based on camera images remain largely unexplored. Moreover, …

RV32I in ACL2
Carl Kwan (The University of Texas at Austin)
https://arxiv.org/abs/2507.19009 https://arxiv.org/pdf/2507.19009

RV32I in ACL2
We present a simple ACL2 simulator for the RISC-V 32-bit base instruction set architecture, written in the operational semantics style. Like many other ISA models, our RISC-V state object is a single-threaded object and we prove read-over-write, write-over-write, writing-the-read, and state well-formedness theorems. Unlike some other models, we separate the instruction decoding functions from their semantic counterparts. Accordingly, we verify encoding / decoding functions for each RV32I instru…

BoSS: Beyond-Semantic Speech
Qing Wang, Zehan Li, Hang Lv, Hongjie Chen, Yaodong Song, Jian Kang, Jie Lian, Jie Li, Yongxiang Li, Zhongjiang He, Xuelong Li
https://arxiv.org/abs/2507.17563

BoSS: Beyond-Semantic Speech
Human communication involves more than explicit semantics, with implicit signals and contextual cues playing a critical role in shaping meaning. However, modern speech technologies, such as Automatic Speech Recognition (ASR) and Text-to-Speech (TTS) often fail to capture these beyond-semantic dimensions. To better characterize and benchmark the progression of speech intelligence, we introduce Spoken Interaction System Capability Levels (L1-L5), a hierarchical framework illustrated the evolution…

YATE: The Role of Test Repair in LLM-Based Unit Test Generation
Michael Konstantinou, Renzo Degiovanni, Jie M. Zhang, Mark Harman, Mike Papadakis
https://arxiv.org/abs/2507.18316

YATE: The Role of Test Repair in LLM-Based Unit Test Generation
Recent advances in automated test generation utilises language models to produce unit tests. While effective, language models tend to generate many incorrect tests with respect to both syntax and semantics. Although such incorrect tests can be easily detected and discarded, they constitute a "missed opportunity" -- if fixed, they are often valuable as they directly add testing value (they effectively target the underlying program logic to be tested) and indirectly form good seeds for generating…

Locality in Many-Valued Structures
James Carr
https://arxiv.org/abs/2506.16206 https://arxiv.org/pdf/2506.16206

Locality in Many-Valued Structures
Many-valued models generalise the structures from classical model theory by defining truth values for a model with an arbitrary algebra. Just as algebraic varieties provide semantics for many non-classical propositional logics, models defined over algebras in a variety provide the semantics for the corresponding non-classical predicate logics. In particular models defined over varieties of residuated lattices represent the model theory for first-order substructrual logics. In this paper we st…

Don't exhaust, don't waste
Riccardo Bianchini, Francesco Dagnino, Paola Giannini, Elena Zucca
https://arxiv.org/abs/2507.13792 https://

Don't exhaust, don't waste
We extend the semantics and type system of a lambda calculus equipped with common constructs to be resource-aware. That is, the semantics keep tracks of the usage of resources, and is stuck, besides in case of type errors, if either a needed resource is exhausted, or a provided resource would be wasted. In such way, the type system guarantees, besides standard soundness, that for well-typed programs there is a computation where no resource gets either exhausted or wasted. The no-waste extensi…

This https://arxiv.org/abs/2503.07219 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDB_…

Bag Semantics Query Containment: The CQ vs. UCQ Case and Other Stories
Query Containment Problem (QCP) is a fundamental decision problem in query processing and optimization. While QCP has for a long time been completely understood for the case of set semantics, decidability of QCP for conjunctive queries under multi-set semantics ($QCP_{\text{CQ}}^{\text{bag}}$) remains one of the most intriguing open problems in database theory. Certain effort has been put, in last 30 years, to solve this problem and some decidable special cases of $QCP_{\text{CQ}}^{\text{bag}}$…

This https://arxiv.org/abs/2506.02139 has been replaced.
link: https://scholar.google.com/scholar?q=a

The Unified Cognitive Consciousness Theory for Language Models: Anchoring Semantics, Thresholds of Activation, and Emergent Reasoning
Few-shot learning in large language models (LLMs) reveals a core paradox: certain tasks generalize from just a few examples, while others demand extensive supervision. To explain this, we introduce the Unified Cognitive Consciousness Theory (UCCT), which reconceptualizes LLMs not as deficient agents, but as unconscious substrates: dense, distributed repositories of linguistic and conceptual patterns that operate without explicit semantics, intention, or goal-directed reasoning. Under this view,…

This https://arxiv.org/abs/2505.02548 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_mat…

Modal logic for reasoning about uncertainty and confusion
We consider a modal logic that can formalise statements about uncertainty and beliefs such as `I think that my wallet is in the drawer rather than elsewhere' or `I am confused whether my appointment is on Monday or Tuesday'. To do that, we expand Gödel modal logic $\mathbf{K}\mathsf{G}$ with the involutive negation $\sim$ defined as $v({\sim}ϕ,w)=1-v(ϕ,w)$. We provide semantics with the finite model property for our new logic that we call $\mathbf{K}\mathsf{G_{inv}}$ and show its equivalence…

SAVANT: Vulnerability Detection in Application Dependencies through Semantic-Guided Reachability Analysis
Wang Lingxiang, Quanzhi Fu, Wenjia Song, Gelei Deng, Yi Liu, Dan Williams, Ying Zhang
https://arxiv.org/abs/2506.17798

SAVANT: Vulnerability Detection in Application Dependencies through Semantic-Guided Reachability Analysis
The integration of open-source third-party library dependencies in Java development introduces significant security risks when these libraries contain known vulnerabilities. Existing Software Composition Analysis (SCA) tools struggle to effectively detect vulnerable API usage from these libraries due to limitations in understanding API usage semantics and computational challenges in analyzing complex codebases, leading to inaccurate vulnerability alerts that burden development teams and delay c…

React-tRace: A Semantics for Understanding React Hooks
Jay Lee, Joongwon Ahn, Kwangkeun Yi
https://arxiv.org/abs/2507.05234 https://a…

React-tRace: A Semantics for Understanding React Hooks
React has become the most widely used web front-end framework, enabling the creation of user interfaces in a declarative and compositional manner. Hooks are a set of APIs that manage side effects in functional components in React. However, their semantics are often seen as opaque to developers, leading to UI bugs. In this paper, we formalize the semantics of the essence of React Hooks we name React-tRace, providing a framework that clarifies their behavior. We demonstrate that our model capture…

An Adequate While-Language for Stochastic Hybrid Computation
Renato Neves, Jos\'e Proen\c{c}a, Juliana Souza
https://arxiv.org/abs/2507.15913 https://

An Adequate While-Language for Stochastic Hybrid Computation
We introduce a language for formally reasoning about programs that combine differential constructs with probabilistic ones. The language harbours, for example, such systems as adaptive cruise controllers, continuous-time random walks, and physical processes involving multiple collisions, like in Einstein's Brownian motion. We furnish the language with an operational semantics and use it to implement a corresponding interpreter. We also present a complementary, denotational semantics and estab…

A Diagrammatic Calculus for a Functional Model of Natural Language Semantics
Matthieu Pierre Boyer
https://arxiv.org/abs/2507.00782 https://

A Diagrammatic Calculus for a Functional Model of Natural Language Semantics
In this paper, we study a functional programming approach to natural language semantics, allowing us to increase the expressivity of a more traditional denotation style. We will formalize a category based type and effect system, and construct a diagrammatic calculus to model parsing and handling of effects, and use it to efficiently compute the denotations for sentences.

Linguine: A Natural-Language Programming Language with Formal Semantics and a Clean Compiler Pipeline
Lifan Hu
https://arxiv.org/abs/2506.08396 https://

Linguine: A Natural-Language Programming Language with Formal Semantics and a Clean Compiler Pipeline
Linguine is a natural-language-inspired programming language that enables users to write programs in a fluent, controlled subset of English while preserving formal semantics. The language introduces anaphoric constructs, such as pronoun variables (e.g., "it", "them"), that are statically resolved through referent-tracking analysis combined with a Hindley-Milner-style type system. Each pronoun is guaranteed to be unambiguous and well-typed at compile time. The Linguine compiler pipeline includ…

Code Clone Detection via an AlphaFold-Inspired Framework
Changguo Jia, Yi Zhan, Tianqi Zhao, Hengzhi Ye, Minghui Zhou
https://arxiv.org/abs/2507.15226 http…

Code Clone Detection via an AlphaFold-Inspired Framework
Code clone detection, which aims to identify functionally equivalent code fragments, plays a critical role in software maintenance and vulnerability analysis. Substantial methods have been proposed to detect code clones, but they fall short in capturing code semantics or relying on language-specific analyzers. Inspired by the remarkable success of AlphaFold in predicting three-dimensional protein structures from protein sequences, in this paper, we leverage AlphaFold for code clone detection ba…

Big Steps in Higher-Order Mathematical Operational Semantics
Sergey Goncharov, Pouya Partow, Stelios Tsampas
https://arxiv.org/abs/2506.01076 https://

Big Steps in Higher-Order Mathematical Operational Semantics
Small-step and big-step operational semantics are two fundamental styles of structural operational semantics (SOS), extensively used in practice. The former one is more fine-grained and is usually regarded as primitive, as it only defines a one-step reduction relation between a given program and its direct descendant under an ambient evaluation strategy. The latter one implements, in a self-contained manner, such a strategy directly by relating a program to the net result of the evaluation proc…

The downgrading semantics of memory safety
Ren\'e Rydhof Hansen, Andreas Stenb{\ae}k Larsen, Aslan Askarov
https://arxiv.org/abs/2507.11282 https://

The downgrading semantics of memory safety
Memory safety is traditionally characterized in terms of bad things that cannot happen, an approach that is often criticized as unprincipled. Prior work suggest a connection between memory safety and noninterference, but no satisfactory semantic notion of memory safety is currently known. This work proposes a notion of gradual allocator independence that accurately captures many allocator-specific aspects of memory safety. We consider a low-level language with access to an allocator that prov…

Emergent Semantics Beyond Token Embeddings: Transformer LMs with Frozen Visual Unicode Representations
A. Bochkov
https://arxiv.org/abs/2507.04886 https://…

Emergent Semantics Beyond Token Embeddings: Transformer LMs with Frozen Visual Unicode Representations
Understanding the locus of semantic representation in large language models (LLMs) is crucial for interpretability and architectural innovation. The dominant paradigm posits that trainable input embeddings serve as foundational "meaning vectors." This paper challenges that view. We construct Transformer models where the embedding layer is entirely frozen, with vectors derived not from data, but from the visual structure of Unicode glyphs. These non-semantic, precomputed visual embeddings are fi…

SHACL Validation in the Presence of Ontologies: Semantics and Rewriting Techniques
Anouk Oudshoorn, Magdalena Ortiz, Mantas Simkus
https://arxiv.org/abs/2507.12286

SHACL Validation in the Presence of Ontologies: Semantics and Rewriting Techniques
SHACL and OWL are two prominent W3C standards for managing RDF data. These languages share many features, but they have one fundamental difference: OWL, designed for inferring facts from incomplete data, makes the open-world assumption, whereas SHACL is a constraint language that treats the data as complete and must be validated under the closed-world assumption. The combination of both formalisms is very appealing and has been called for, but their semantic gap is a major challenge, semantical…

Enhancing Repository-Level Code Generation with Call Chain-Aware Multi-View Context
Yang Liu, Li Zhang, Fang Liu, Zhuohang Wang, Donglin Wei, Zhishuo Yang, Kechi Zhang, Jia Li, Lin Shi
https://arxiv.org/abs/2507.14791

Enhancing Repository-Level Code Generation with Call Chain-Aware Multi-View Context
Repository-level code generation aims to generate code within the context of a specified repository. Existing approaches typically employ retrieval-augmented generation (RAG) techniques to provide LLMs with relevant contextual information extracted from the repository. However, these approaches often struggle with effectively identifying truly relevant contexts that capture the rich semantics of the repository, and their contextual perspectives remains narrow. Moreover, most approaches fail to …

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
Justus Becker
https://arxiv.org/abs/2506.14307 https://…

A Non-Wellfounded and Labelled Sequent Calculus for Bimodal Provability Logic
We present a labelled and non-wellfounded calculus for the bimodal provability logic CS. The system is obtained by modelling the Kripke-like semantics of this logic. As in arXiv:2309.00532, we enforce the second-order property of converse wellfoundedness by using techniques from cyclic proof theory. We will prove soundness and completeness of this system with respect to the semantics and provide a primitive decision procedure together with a way to extract countermodels.

Understanding Haskell-style Overloading via Open Data and Open Functions
Andrew Marmaduke, Apoorv Ingle, J. Garrett Morris
https://arxiv.org/abs/2507.16086

Understanding Haskell-style Overloading via Open Data and Open Functions
We present a new, uniform semantics for Haskell-style overloading. We realize our approach in a new core language, System F$_\mathrm{D}$, whose metatheory we mechanize in the Lean4 interactive theorem prover. System F$_\mathrm{D}$ is distinguished by its open data types and open functions, each given by a collection of instances rather than by a single definition. We show that System F$_\mathrm{D}$ can encode advanced features of Haskell's of type class systems, more expressively than current s…

Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds
Alexandre Le Nepvou
https://arxiv.org/abs/2506.17276 https://

Modal Logic for Stratified Becoming: Actualization Beyond Possible Worlds
This article develops a novel framework for modal logic based on the idea of stratified actualization, rather than the classical model of global possible worlds. Traditional Kripke semantics treat modal operators as quantification over fully determinate alternatives, neglecting the local, dynamic, and often asymmetric nature of actualization processes. We propose a system Stratified Actualization Logic (SAL) in which modalities are indexed by levels of ontological stability, interpreted as admi…

Resourceful Traces for Commuting Processes
Matthew Earnshaw, Chad Nester, Mario Rom\'an
https://arxiv.org/abs/2507.18246 https://arxiv.org/pdf/2507.182…

Resourceful Traces for Commuting Processes
We show that, when the actions of a Mazurkiewicz trace are considered not merely as atomic (i.e., mere names) but transformations from a specified type of inputs to a specified type of outputs, we obtain a novel notion of presentation for effectful categories (also known as generalised Freyd categories), a well-known algebraic structure in the semantics of side-effecting computation. Like the usual representation of traces as graphs, our notion of presentation gives rise to a graphical calculus…

Bayesian Separation Logic
Shing Hin Ho, Nicolas Wu, Azalea Raad
https://arxiv.org/abs/2507.15530 https://arxiv.org/pdf/2507.15530

Bayesian Separation Logic
Bayesian probabilistic programming languages (BPPLs) let users denote statistical models as code while the interpreter infers the posterior distribution. The semantics of BPPLs are usually mathematically complex and unable to reason about desirable properties such as expected values and independence of random variables. To reason about these properties in a non-Bayesian setting, probabilistic separation logics such as PSL and Lilac interpret separating conjunction as probabilistic independence …

A Topological Semantics of Dialogue: Nerve Structures and Logical Extraction
Andreu Ballus Santacana
https://arxiv.org/abs/2506.00615 https://

A Topological Semantics of Dialogue: Nerve Structures and Logical Extraction
We introduce a concise, topologically-motivated semantics for finite dialogues by mapping each utterance to an open set in a fixed semantic space, building the corresponding nerve complex of joint satisfiability, and extracting fundamental combinatorial invariants: 1. The negative nerve, which enumerates all finite collections of utterances whose opens have empty intersection, providing a straightforward criterion for merging separate transcripts without contradiction. 2. The global int…

This https://arxiv.org/abs/2503.02768 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csPL_…

Denotational Semantics for Probabilistic and Concurrent Programs
We develop a denotational model for probabilistic and concurrent imperative programs, a class of programs with standard control flow via conditionals and while-loops, as well as probabilistic actions and parallel composition. Whereas semantics for concurrent or randomized programs in isolation is well studied, their combination has not been thoroughly explored and presents unique challenges. The crux of the problem is that interactions between control flow, probabilistic actions, and concurrent…

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
Alejandro D\'iaz-Caro, Nicolas A. Monzon
https://arxiv.org/abs/2506.16244 https://

A Quantum-Control Lambda-Calculus with Multiple Measurement Bases
We introduce Lambda-SX, a typed quantum lambda-calculus that supports multiple measurement bases. By tracking duplicability relative to arbitrary bases within the type system, Lambda-SX enables more flexible control and compositional reasoning about measurements. We formalise its syntax, typing rules, subtyping, and operational semantics, and establish its key meta-theoretical properties. This proof-of-concept shows that support for multiple bases can be coherently integrated into the type disc…

A Note on Proper Relational Structures
Adam Bjorndahl, Philip Sink
https://arxiv.org/abs/2506.17142 https://arxiv.org/pdf/2506.17142

A Note on Proper Relational Structures
In this note we provide an algorithm for translating relational structures into "proper" relational structures, i.e., those such that there is no pair of worlds w and u such that w is accessible from u for every agent. In particular, our method of translation preserves many classical properties of relational structures, such as transitivity and the Euclidean property. As a result, this method of translation has many applications in the literature on Simplicial Semantics for modal logic, where t…

An Execution Model for RICE
Steven Libby
https://arxiv.org/abs/2506.05839 https://arxiv.org/pdf/2506.05839

An Execution Model for RICE
In this paper, we build on the previous work of the RICE compiler by giving its execution model. We show the restrictions to the FlatCurry language that were made to produce executable code, and present the execution model using operational semantics similar to Launchbury. Finally, we show that the execution model conforms with the standard operational semantics for Curry.

Transordinal Fixed-Point Operators and Self-Referential Games: A Categorical Framework for Reflective Semantic Convergence
Faruk Alpay, Hamdi Al Alakkad
https://arxiv.org/abs/2507.16620

Transordinal Fixed-Point Operators and Self-Referential Games: A Categorical Framework for Reflective Semantic Convergence
We present a new theoretical framework that unifies category-theoretic fixed-point constructions, transfinite recursion, and game-based semantics to model how interpretations of language can stabilize through unlimited self-reference. By iterating a meaning-refinement operator across all ordinal stages, we isolate a unique "transordinal" fixed point and show, via a hierarchy of reflective games, that this same object is the sole equilibrium of an infinite dialogue between a text and its interpr…

Replaced article(s) found for cs.PL. https://arxiv.org/list/cs.PL/new
[1/1]:
- A refined operational semantics for FreeCHR
Sascha Rechenberger, Thom Fr\"uhwirth

This https://arxiv.org/abs/2502.13033 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Classical notions of computation and the Hasegawa-Thielecke theorem
In the spirit of the Curry-Howard correspondence between proofs and programs, we define and study a syntax and semantics for classical logic equipped with a computationally involutive negation, using a polarised effect calculus. A main challenge in designing a denotational semantics is to accommodate both call-by-value and call-by-name evaluation strategies, which leads to a failure of associativity of composition. Building on the work of the third author, we devise the notion of dialogue duplo…

This https://arxiv.org/abs/2505.15053 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csLO_…

Owicki--Gries Logic for Timestamp Semantics
Whereas an extension with non-interference of Hoare logic for sequential programs Owicki--Gries logic ensures the correctness of concurrent programs on strict consistency, it is unsound to weak memory models adopted by modern computer architectures and specifications of programming languages. This paper proposes a novel non-interference notion and provides concurrent program logic sound to timestamp semantics corresponding to a weak memory model that allows delays in the effects of store instru…