Related papers: Expressiveness and Extensions of an Instruction Se…
Compilers use control flow graph (CFG) representations of low-level programs because they are suited to program analysis and optimizations. However, formalizing the behavior and metatheory of CFG programs is non-trivial: CFG programs don't…
Segmentation, a new approach based on successive edge contraction is introduced for extract method refactoring. It targets identification of distinct functionalities implemented within a method. Segmentation builds upon data and control…
Processing programs as data is one of the successes of functional and logic programming. Higher-order functions, as program-processing programs are called in functional programming, and meta-programs, as they are called in logic…
Diffusion and flow-based generative models dominate visual synthesis, with guidance aligning samples to user input and improving perceptual quality. However, Classifier-Free Guidance (CFG) and extrapolation-based methods are heuristic…
We show that any automatic sequence can be separated into a structured part and a Gowers uniform part in a way that is considerably more efficient than guaranteed by the Arithmetic Regularity Lemma. For sequences produced by strongly…
Left-sequential logics provide a means for reasoning about (closed) propositional terms with atomic propositions that may have side effects and that are evaluated sequentially from left to right. Such propositional terms are commonly used…
CLP(H) is an instantiation of the general constraint logic programming scheme with the constraint domain of hedges. Hedges are finite sequences of unranked terms, built over variadic function symbols and three kinds of variables: for terms,…
GUI Process Automation (GPA) is a lightweight but general vision-based Robotic Process Automation (RPA), which enables fast and stable process replay with only a single demo. Addressing the fragility of traditional RPA and the…
We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…
The conformal Galilei algebra (CGA) and the exotic conformal Galilei algebra (ECGA) are applied to construct partial differential equations (PDEs) and systems of PDEs, which admit these algebras. We show that there are no single…
We add probabilistic features to basic thread algebra and its extensions with thread-service interaction and strategic interleaving. Here, threads represent the behaviours produced by instruction sequences under execution and services…
In this paper, we consider graded associative conformal algebras. The class of these objects includes pseudo-algebras over non-cocommutative Hopf algebras of regular functions on some linear algebraic groups. In particular, an associative…
We study a syntax for specifying quantitative "assertions" - functions mapping program states to numbers - for probabilistic program verification. We prove that our syntax is expressive in the following sense: Given any probabilistic…
The notion of $P$-stability of an infinite set of degree sequences plays influential role in approximating the permanents, rapidly sampling the realizations of graphic degree sequences, or even studying and improving network privacy. While…
In earlier work, we introduced the framework of language-based decisions, the core idea of which was to modify Savage's classical decision-theoretic framework by taking actions to be descriptions in some language, rather than functions from…
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a…
Regular expressions in an Automata Theory and Formal Languages course are mostly treated as a theoretical topic. That is, to some degree their mathematical properties and their role to describe languages is discussed. This approach fails to…
Our aim is to show the way we pass from the results of ordered semigroups (or semigroups) to ordered $\Gamma$-semigroups (or $\Gamma$-semigroups). The results of this note have been transferred from ordered semigroups. The concept of…
First of all, we recall the well known notion of semidirect product both for classical algebraic structures (like groups and rings) and for more recent ones (digroups, left skew braces, heaps, trusses). Then we analyse the concept of…
Incremental learning aims to overcome catastrophic forgetting when learning deep networks from sequential tasks. With impressive learning efficiency and performance, prompt-based methods adopt a fixed backbone to sequential tasks by…