English
Related papers

Related papers: Static Analysis for Regular Expression Exponential…

200 papers

Large reasoning models, such as OpenAI o1 and DeepSeek-R1, tend to become increasingly verbose as their reasoning capabilities improve. These inflated Chain-of-Thought (CoT) trajectories often exceed what the underlying problems require,…

Machine Learning · Computer Science 2026-05-12 Songtao Wei , Yi Li , Zhikai Li , Xu Hu , Yuede Ji , Guanpeng Li , Feng Chen , Carl Yang , Zhichun Guo , Bingzhe Li

Metaprogramming and effect handlers interact in unexpected, and sometimes undesirable, ways. One example is scope extrusion: the generation of ill-scoped code. Scope extrusion can either be preemptively prevented, via static type systems,…

Programming Languages · Computer Science 2026-01-27 Michael Lee , Ningning Xie , Oleg Kiselyov , Jeremy Yallop

Matching regexes (regular expressions) is a common problem in many areas of computer science, with requirements on high speed and robust performance. Regexes with backreferences allow one to express certain patterns (even beyond regular)…

Logic in Computer Science · Computer Science 2026-04-16 Vojtěch Havlena , Lukáš Holík , Ondřej Lengál , Jan Vašák , Sabína Gulčíková

Reinforcement learning (RL) is a promising, upcoming topic in automatic control applications. Where classical control approaches require a priori system knowledge, data-driven control approaches like RL allow a model-free controller design…

Systems and Control · Electrical Eng. & Systems 2022-02-01 Daniel Weber , Maximilian Schenke , Oliver Wallscheid

The Refinement Calculus of Reactive Systems (RCRS) is a compositional formal framework for modeling and reasoning about reactive systems. RCRS provides a language which allows to describe atomic components as symbolic transition systems or…

Logic in Computer Science · Computer Science 2018-02-09 Viorel Preoteasa , Iulia Dragomir , Stavros Tripakis

Since the topic emerged several years ago, work on regular model checking has mostly been devoted to the verification of state reachability and safety properties. Though it was known that linear temporal properties could also be checked…

Logic in Computer Science · Computer Science 2009-01-27 Ahmed Bouajjani , Axel Legay , Pierre Wolper

Most modern libraries for regular expression matching allow back-references (i.e., repetition operators) that substantially increase expressive power, but also lead to intractability. In order to find a better balance between expressiveness…

Formal Languages and Automata Theory · Computer Science 2018-02-06 Dominik D. Freydenberger , Markus L. Schmid

Counterfactual explanations (CEs) are a powerful means for understanding how decisions made by algorithms can be changed. Researchers have proposed a number of desiderata that CEs should meet to be practically useful, such as requiring…

Machine Learning · Computer Science 2022-09-26 Marco Virgolin , Saverio Fracaros

A recurrent neural network (RNN) possesses the echo state property (ESP) if, for a given input sequence, it ``forgets'' any internal states of the driven (nonautonomous) system and asymptotically follows a unique, possibly complex…

Dynamical Systems · Mathematics 2020-06-26 Andrea Ceni , Peter Ashwin , Lorenzo Livi , Claire Postlethwaite

To deal with time-varying processor availability and lossy communication channels in embedded and networked control systems, one can employ an event-triggered sequence-based anytime control (E-SAC) algorithm. The main idea of E-SAC is, when…

Optimization and Control · Mathematics 2018-04-24 Thuy V. Dang , K. V. Ling , D. E. Quevedo

Counterfactual explanations (CEs) are advocated as being ideally suited to providing algorithmic recourse for subjects affected by the predictions of machine learning models. While CEs can be beneficial to affected individuals, recent work…

Machine Learning · Computer Science 2024-02-06 Junqi Jiang , Francesco Leofante , Antonio Rago , Francesca Toni

Robustness analyzes the impact of small perturbations in the semantics of a model. This allows to model hardware imprecision and therefore it has been applied to determine implementability of timed automata. In a recent paper, we extend…

Software Engineering · Computer Science 2012-07-19 Louis-Marie Traonouez

Logically constrained rewrite systems (LCTRSs) are a versatile and efficient rewriting formalism that can be used to model programs from various programming paradigms, as well as simplification systems in compilers and SMT solvers. In this…

Computational Complexity · Computer Science 2020-12-14 Sarah Winkler , Georg Moser

Runtime Verification deals with the question of whether a run of a system adheres to its specification. This paper studies runtime verification in the presence of partial knowledge about the observed run, particularly where input values may…

Logic in Computer Science · Computer Science 2022-07-13 Hannes Kallwies , Martin Leucker , Cesar Sanchez

R is a popular language and programming environment for data scientists. It is increasingly co-packaged with both relational and Hadoop-based data platforms and can often be the most dominant computational component in data analytics…

Programming Languages · Computer Science 2017-07-04 Rathijit Sen , Jianqiao Zhu , Jignesh M. Patel , Somesh Jha

Control systems can show robustness to many events, like disturbances and model inaccuracies. It is natural to speculate that they are also robust to sporadic deadline misses when implemented as digital tasks on an embedded platform. This…

Optimization and Control · Mathematics 2022-08-31 Nils Vreman , Paolo Pazzaglia , Jie Wang , Victor Magron , Martina Maggio

Runtime verification consists in observing and collecting the execution traces of a system and checking them against a specification, with the objective of raising an error when a trace does not satisfy the specification. We consider…

Logic in Computer Science · Computer Science 2025-11-04 Chana Weil-Kennedy , Darine Rammal , Christophe Gaston , Arnault Lapitre

This paper studies exponential stability properties of a class of two-dimensional (2D) systems called differential repetitive processes (DRPs). Since a distinguishing feature of DRPs is that the problem domain is bounded in the "time"…

Dynamical Systems · Mathematics 2017-10-16 Berk Altın , Kira Barton

Recent improvements in the expressive power of spatio-temporal models have led to performance gains in many real-world applications, such as traffic forecasting and social network modelling. However, understanding the predictions from a…

Machine Learning · Computer Science 2025-03-07 Saif Anwar , Nathan Griffiths , Thomas Popham , Abhir Bhalerao

Explicit reasoning models are trained to produce intermediate reasoning traces before final answers, but downstream fine-tuning is often performed on ordinary instruction-response data that contains no such traces. We show that this…

Machine Learning · Computer Science 2026-05-21 Lukas Twist , Helen Yannakoudakis , Jie M. Zhang