2026· International Conference on Principles and Practice of Constraint Programming· pp. 7:1-7:23· 0 citations· 29 references
Computer Science
TL;DR
Optional variables have for a long time been identified as a crucial component of state-of-the-art scheduling solvers and play an important role in the efficiency of such solvers by enabling a stronger inference in a constraint propagation engine.
LLM-based code generation fails when correctness depends on execution-dependent coupling: the meaning of one routine is defined by the runtime behavior of another, a relationship that cannot be resolved from textual descriptions alone. This limitation, which we call static binding, is not confined to explicitly coupled...
Gnaneswar Villuri, Hashmath Shaik, Alex Doboli· 1 citation
This work introduces DueList, an abstraction-refinement approach geared towards list reasoning, which is implemented on top of off-the-shelf SMT solvers and extends reasoning facilities of existing solvers, allowing to conclude about the (un)satisfiability of a larger range of problems, while outperforming existing sol...
Pierre Goutagny, Aymeric Fromherz, Raphaël Monat· 0 citations
This paper presents an incremental, classroom-scale approach to building a JIT compiler in manageable steps that successfully supports a Read-Eval-Print Loop and a first-call specialization mechanism.
Shaurya Raswan, Mark Barbone, Nicolás Lehmann et al.· Proceedings of the 27th ACM...· 0 citations
A functor is a familiar model of an implementation, where every operation in a specification is assigned a concrete instantiation at the outset. But some tasks are less eager: we often want to assemble systems while leaving backend choices such as data representations and algorithms for later. We observe that cofunctor...
SMT solvers make automated verification convenient. At the same time, solvers suffer from instability, whereby seemingly inconsequential changes to the input may cause a previously quickly produced proof to fail or time out. This paper addresses a common cause of outcome instability (i.e., unsat/unknown fluctuations) i...
Can Cebeci, Nikolaj S. Bjørner, George Candea et al.· 0 citations
Pack Iteration, a feature introduced in Swift 6.0 that allows developers to iterate over parameter packs using a familiar, imperative for-in loop, is presented, and empirical evaluation confirms that pack iteration provides performance comparable to - and sometimes significantly better than - the complex workarounds pr...
S. Nerush, Eitan Frachtenberg· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
