English
Related papers

Related papers: A Model to Estimate First-Order Mutation Coverage …

200 papers

An oracle determines whether the output of a program for executed test cases is correct. For machine learning programs, such an oracle is often unavailable or impractical to apply. Metamorphic testing addresses this by using metamorphic…

Software Engineering · Computer Science 2024-11-15 Madhusudan Srinivasan , Upulee Kanewala

Model checking of real-time systems has evolved throughout the years. Recently, the model checker Ecdar, using timed I/O automata, was used to perform compositional verification. However, in order to fully integrate model checking of…

Software Engineering · Computer Science 2018-09-12 Tobias R. Gundersen , Florian Lorber , Ulrik Nyman , Christian Ovesen

Standard conformal prediction offers a marginal guarantee on coverage, but for prediction sets to be truly useful, they should ideally ensure coverage conditional on each test point. Unfortunately, it is impossible to achieve exact,…

Machine Learning · Computer Science 2025-02-11 Jivat Neet Kaur , Michael I. Jordan , Ahmed Alaa

While large language models (LLMs) demonstrate impressive capabilities across numerous applications, their robustness remains a critical concern. This paper is motivated by a specific vulnerability: the order sensitivity of LLMs. This…

Machine Learning · Computer Science 2025-05-22 Beni Egressy , Jan Stühmer

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper…

Software Engineering · Computer Science 2012-02-29 Bernhard K. Aichernig , Elisabeth Jöbstl

Uncertainty analysis in the outcomes of model predictions is a key element in decision-based material design to establish confidence in the models and evaluate the fidelity of models. Uncertainty Propagation (UP) is a technique to determine…

Machine Learning · Computer Science 2023-02-13 Danial Khatamsaz , Vahid Attari , Raymundo Arroyave , Douglas L. Allaire

It is natural to suppose that a Large Language Model is more likely to generate correct test cases when prompted with correct code under test, compared to incorrect code under test. However, the size of this effect has never been previously…

Software Engineering · Computer Science 2025-03-31 Dong Huang , Jie M. Zhang , Mark Harman , Mingzhe Du , Heming Cui

We derive universal upper estimates for model-prediction error under moderate but otherwise unknown model uncertainty. Our estimates give upper bounds on the leading order trajectory-uncertainty arising along model trajectories, solely as…

Chaotic Dynamics · Physics 2021-02-03 Bálint Kaszás , George Haller

First-order model counting (FOMC) is the problem of counting the number of models of a sentence in first-order logic. Since lifted inference techniques rely on reductions to variants of FOMC, the design of scalable methods for FOMC has…

Logic in Computer Science · Computer Science 2025-06-11 Ananth K. Kidambi , Guramrit Singh , Paulius Dilkas , Kuldeep S. Meel

Independent component (IC) models are a standard tool for representing multivariate data in statistics, signal processing, and machine learning. Despite the extensive use of IC models, much less attention has been given to goodness-of-fit…

Statistics Theory · Mathematics 2026-05-20 Mingshuo Liu , Siyao Wang , Miles E. Lopes

Mutation testing may be used to guide test case generation and as a technique to assess the quality of test suites. Despite being used frequently, mutation testing is not so commonly applied in the mobile world. One critical challenge in…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

Logic in Computer Science · Computer Science 2015-05-22 Andreas Teucke , Christoph Weidenbach

It was recently established that for convex optimization problems with sparse optimal solutions (be it entry-wise sparsity or matrix rank-wise sparsity) it is possible to design first-order methods with linear convergence rates that depend…

Optimization and Control · Mathematics 2026-03-20 Dan Garber

We consider a class of statistical estimation problems in which we are given a random data matrix ${\boldsymbol X}\in {\mathbb R}^{n\times d}$ (and possibly some labels ${\boldsymbol y}\in{\mathbb R}^n$) and would like to estimate a…

Computation · Statistics 2022-01-14 Andrea Montanari , Yuchen Wu

The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…

Over the last years, machine learning techniques have been applied to more and more application domains, including software engineering and, especially, software quality assurance. Important application domains have been, e.g., software…

Software Engineering · Computer Science 2021-04-30 Safa Omri , Carsten Sinz

Order picking and order packing entail retrieving items from storage and packaging them according to customer requests. These activities have always been the main concerns of the companies in reducing warehouse management costs. This paper…

Optimization and Control · Mathematics 2022-06-24 Sen Xue , Chuanhou Gao

Probabilistic values, including Shapley values and semivalues, provide a model-agnostic framework to attribute the behavior of a black-box model to data points or features, with a wide range of applications including explainable artificial…

Artificial Intelligence · Computer Science 2026-05-05 Ziqi Liu , Kiljae Lee , Yuan Zhang , Weijing Tang

A successor-invariant first-order formula is a formula that has access to an auxiliary successor relation on a structure's universe, but the model relation is independent of the particular interpretation of this relation. It is well known…

Logic in Computer Science · Computer Science 2023-08-15 Jan van den Heuvel , Stephan Kreutzer , Michał Pilipczuk , Daniel A. Quiroz , Roman Rabinovich , Sebastian Siebertz

Modifications to open-source software (OSS) are often provided in the form of "patch stacks" - sets of changes (patches) that modify a given body of source code. Maintaining patch stacks over extended periods of time is problematic when the…

Software Engineering · Computer Science 2020-09-03 Ralf Ramsauer , Daniel Lohmann , Wolfgang Mauerer