ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “program semantics”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.PLTheoreticalRecentJun 19, 2026

Correct and Complete Symbolic Execution for Free

Erik Voogd, Einar Broch Johnsen, Åsmund Aqissiaq Arild Kløvstad, Jurriaan Rot +1 more

This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.

View →
cs.PLcs.AIRecentMay 29, 2026

SEMBridge: Tagless-Final Program Semantics with Weakest-Precondition and Bounded-Checking Interpretations

Eric Liang

SEMBridge is a tagless-final framework that allows a single executable object program to generate multiple program semantics, including weakest-precondition and bounded-checking interpretations, ensur…

View →
cs.PLTheoreticalRecentJun 21, 2026

Compositional Generator Equivalence (Extended Version)

Anthony Vandikas, Kiarash Sotoudeh, Marsha Chechik

This paper formalizes the semantics of a popular property-based testing framework and introduces a restricted version with a compositional semantics.

View →
cs.PLTheoreticalRecentOct 27, 2026

Abstract Lipschitz Continuity

Marco Campion, Isabella Mastroeni, Michele Pasqua, Caterina Urban

This paper introduces Abstract Lipschitz Continuity (ALC), a property of functions that relates bounded input differences to output differences.

View →
cs.SEcs.CLEmpiricalRecentOct 30, 2026

SCRBench: Beyond Equivalence Checking for Semantic Change Reasoning in Code

Omid Saghatchian, Ali Mahzoun, Khashayar Etemadi, Saeed Reza Kheradpisheh

The paper evaluates the ability of language models to reason about code changes and their semantic effects.

View →
cs.PLcs.SETheoreticalRecentJul 17, 2026

A Modular Framework for Stack-Heap and Value Abstractions (Extended Version)

Giacomo Boldini, Luca Negrini, Luca Olivieri, Pietro Ferrara

The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.

View →
cs.PLcs.CCcs.FLRecentMay 30, 2026

Grid Programs: A Two-Dimensional, Variable-Free Model of Computation

Ezequiel López-Rubio

The paper introduces Grid Programs, a novel, Turing-complete model of computation where programs are two-dimensional arrangements of instructions, fundamentally departing from linear code structures.

View →
cs.PLTheoreticalRecentOct 27, 2026

Preserving Separation Logic Specifications through Compilation

Carmine Abate, Kleio Liotati, František Farka, Sebastian Ertel

This paper investigates WP-preserving compilation, where the weakest preconditions of a source program carry over to the compiled program.

View →
cs.SEEmpiricalRecentJun 10, 2026

Enhancing LLM-Based Code Translation with Verified Multi-Semantic Representations

Yufu Wang, He Jiang, Hao Lin, Peiyu Zou +3 more

Multisage improves code translation success rates by explicit semantic augmentation

View →
cs.SEcs.PLEmpiricalRecentOct 26, 2026

AGDecode: Semantic Attribute Grammar Derivatives for Safety-Constrained Decoding of Large Language Models

Rajan Maghera, Asher Tempest Arya, Aren A. Babikian, Marsha Chechik +1 more

The paper presents a framework called AGDecode for enforcing semantic correctness in code generation using constrained decoding.

View →
cs.LOcs.PLEmpiricalRecentJun 26, 2026

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

Nils Lommen, Éléanore Meyer, Jürgen Giesl

KoAT is a tool that automatically infers complexity bounds and proves termination of integer programs using an alternating modular analysis approach and a portfolio of techniques.

View →
cs.PLTheoreticalRecentOct 16, 2026

Arbitrary Functors as Modalities in a Linear Calculus

Jean-Philippe Bernardy, Andreas Abel

This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.

View →
cs.PLTheoreticalRecentJun 18, 2026

Big-step and small-step Horn clause derivations applied to operational semantics

John P. Gallagher, Manuel Hermenegildo, José Morales, Pedro Lopez-Garcia +1 more

The paper proves equivalence between big-step and small-step derivations for Horn clauses and transforms Horn clauses into equivalent sets of clauses based on the given derivation strategy.

View →
cs.PLTheoreticalRecentOct 10, 2026

Mechanising Denotational Semantics in Agda

Peter D. Mosses, Jesper Cockx, Bernhard Reus

Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.

View →
cs.SEEmpiricalRecentJul 16, 2026

Leaf: An Instrumentation-based Dynamic Analysis Framework for Rust

Mohammad Omidvar Tehrani, Marco Gaboardi, Nick Sumner, Steven Y. Ko

LEAF is a dynamic analysis framework for Rust that captures MIR-level semantic information and delivers it as an event stream through Dynamic MIR.

View →
cs.PLTheoreticalRecentOct 27, 2026

Polymorphic First-Class Environments

Jinhao Tan, Jam Kabeer Ali Khan, Bruno C. d. S. Oliveira

This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.

View →
cs.PLTheoreticalRecentAug 11, 2026

A Rig of Transformations

Emma Tye

The paper presents a model of finite algebraic data types as a commutative rig to describe data layouts and their transformations in high-level functional languages.

View →