20 results for “program semantics”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper introduces symbolic SOS, a rule format for specifying both concrete and symbolic operational semantics of programming languages.
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…
This paper formalizes the semantics of a popular property-based testing framework and introduces a restricted version with a compositional semantics.
This paper introduces Abstract Lipschitz Continuity (ALC), a property of functions that relates bounded input differences to output differences.
The paper evaluates the ability of language models to reason about code changes and their semantic effects.
The paper proposes a generic memory framework for advanced static program analysis, supporting various memory behaviors from different programming languages using Abstract Interpretation theory.
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.
This paper investigates WP-preserving compilation, where the weakest preconditions of a source program carry over to the compiled program.
The paper presents a framework called AGDecode for enforcing semantic correctness in code generation using constrained decoding.
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.
This paper studies modalities in the linear lambda calculus using endofunctors in monoidal closed categories.
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.
Mechanising denotational semantic definitions of programming languages in Agda with minimal reformulation.
LEAF is a dynamic analysis framework for Rust that captures MIR-level semantic information and delivers it as an event stream through Dynamic MIR.
This paper presents a polymorphic calculus with first-class environments that conservatively extends System F with a small-step environment semantics.
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.