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

20 results for “Programming concepts”

CS papers only

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

Want pure semantic search? Try claim verification →

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.CYcs.SEEmpiricalRecentJul 3, 2026

Analyzing the Difficulty of Programming Assignments with Interpretable Knowledge Component Metrics

Tsvetomila Mihaylova, Jing Fan, Bita Akram, Narges Norouzi +3 more

This paper explores using Knowledge Components (KCs) as interpretable signals to understand assignment difficulty and student struggle in intro programming courses.

View →
cs.SEcs.AIRecentMay 28, 2026

CodeGolf Bench: A Multi-Language Benchmark for Evaluating Concise Code Generation Capabilities of Large Language Models

Vedant Padwal

The paper introduces CodeGolf Bench, a novel multi-language benchmark using code golf to measure LLMs' ability to generate highly concise and efficient code, showing that reasoning models significantl…

View →
cs.LGcs.AIcs.CLEmpiricalRecentJul 2, 2026

Program-as-Weights: A Programming Paradigm for Fuzzy Functions

Wentao Zhang, Liliana Hotsko, Woojeong Kim, Pengyu Nie +2 more

The paper proposes Fuzzy-Function Programming and introduces Program-as-Weights (PAW), a compact, locally-executable neural artifact for everyday programming tasks.

View →
cs.CCcs.LGTheoreticalRecentJun 11, 2026

The Program Is Still There: A Conservation Law for Program Discovery

Jorge Miguel Silva

This paper measures the lower bound for the shortest program generating a sequence, proving a conservation law and providing a deterministic engine to recover generating programs for certain sequences…

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.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.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.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.HCcs.AIcs.SEEmpiricalRecentJun 29, 2026

To Tab or Not to Tab: Measuring Critical Engagement in AI Code Completion Tools Using Behavioral Signals and Attention Checks

Jessica Hutchison, Ian Tyler Applebaum, Kenneth Angelikas, Kush Rakesh Patel +5 more

The paper introduces Clover, a code completion tool that logs students' interactions and offers attention checks to promote reflective engagement during programming tasks.

View →
cs.CRcs.SERecentMar 23, 2026

A Survey of Web Application Security Tutorials

Bhagya Chembakottu, Martin P. Robillard

This survey analyzed 132 web application security tutorials, finding that most lack concrete implementation details and recommending that the presence of runnable code and links to official resources…

View →
cs.AIRecentMay 28, 2026

Meta-Programming for Linear-time Temporal Answer Set Programming

Susana Hahn, Amade Nems, Javier Romero, Torsten Schaub

The paper proposes a flexible meta-programming framework to declaratively operationalize and explore varied temporal logics, such as TEL, MEL, and DEL, within standard Answer Set Programming systems.

View →
cs.CYcs.AIcs.SERecentMay 31, 2026

ASE-26: a curriculum for agentic software engineering as a discipline

Mikael Gorsky

This paper introduces ASE-26, a comprehensive undergraduate curriculum designed to formalize and teach agentic software engineering as a distinct academic discipline.

View →
cs.SEEmpiricalRecentJul 21, 2026

EmbeddedKittens: An Evaluation of Code Embeddings for Scratch

Benedikt Fein, Gordon Fraser

This paper compares different approaches for embedding source code in machine learning models for learning analytics in programming education, specifically for the visual block-based programming langu…

View →
cs.PLTheoreticalRecentJul 20, 2026

Extended Abstract: From Pattern Unification Towards Pattern Matching Unification

David Richter, Timon Böhler

The paper proposes integrating dependent pattern matching into the unification process in dependently typed languages to synthesize functions defined by case analysis, addressing the limitation of exi…

View →
cs.AIRecentMay 27, 2026

Efficient Post-training of LLMs for Code Generation With Offline Reinforcement Learning

Mingze Wu, Abhinav Anand, Shweta Verma, Mira Mezini

This paper proposes using offline reinforcement learning (RL) as an efficient alternative to online RL for post-training code-generating LLMs, demonstrating its effectiveness, especially for smaller m…

View →
cs.SEcs.AIEmpiricalRecentJun 19, 2026

An Exploratory Case Study of LLM-Assisted Refactoring and Gameplay Feature Generation in an Endless Runner Game

Jan Wunderlich, Markus Kleffmann, Sebastian Lempert

This paper explores the use of GPT-4o in game development using a Python/Pygame endless runner, examining refactoring and gameplay feature generation tasks.

View →