English
Related papers

Related papers: Implementation of a Unimodularity Test

200 papers

In this paper we report the experience of using AutoProof to statically verify a small object oriented program. We identified the problems that emerged by this activity and we classified them according to their nature. In particular, we…

Software Engineering · Computer Science 2017-06-20 Mansur Khazeev , Victor Rivera , Manuel Mazzara , Leonard Johard

System integration testing is the process of testing a system by the stepwise integration of sub-components. Usually these sub-components are already verified to guarantee their correct functional behavior. By integration of these verified…

Software Engineering · Computer Science 2014-04-29 Susanne Kandl , Martin Elshuber

Checking two probabilistic automata for equivalence has been shown to be a key problem for efficiently establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test…

Formal Languages and Automata Theory · Computer Science 2012-01-09 Stefan Kiefer , Andrzej S. Murawski , Joël Ouaknine , Björn Wachter , James Worrell

Automated and therefore repeatable tests are important in product lines to ensure and maintain quality of software functions as well as efficiency of the developers. This article shows methods for fully automated testing of SIMULINK models…

Software Engineering · Computer Science 2014-09-24 Alexej Beresnev , Bernhard Rumpe , Frank Schoven

Software is omnipresent within all factors of society. It is thus important to ensure that software are well tested to mitigate bad user experiences as well as the potential for severe financial and human losses. Software testing is however…

Software Engineering · Computer Science 2025-04-30 Jason Wang , Basem Suleiman , Muhammad Johan Alibasa

Quantum computing has emerged as a promising field with the potential to revolutionize various domains by harnessing the principles of quantum mechanics. As quantum hardware and algorithms continue to advance, developing high-quality…

Software Engineering · Computer Science 2024-05-27 Peixun Long , Jianjun Zhao

We show that a class of optimized e-value combinations, arising from a standard construction of e-processes, remains valid even when the tuning parameter is optimized based on the data. This result holds for independent e-values, and, more…

Methodology · Statistics 2026-03-12 Jiahao Ming , Yi Shen , Ruodu Wang

In this work, tests of symmetry for bivariate copulas are introduced and studied using empirical Bernstein copula process. Three statistics are proposed and their asymptotic properties are established. Besides, a multiplier bootstrap…

Methodology · Statistics 2024-05-14 Guanjie Lyu , Mohamed Belalia

With the increasing popularity of continuous integration, algorithms for selecting the minimal test-suite to cover a given set of changes are in order. This paper reports on how polymorphism can handle false negatives in a previous…

Software Engineering · Computer Science 2014-12-15 Ali Parsai , Quinten David Soetens , Alessandro Murgia , Serge Demeyer

We present an ongoing effort to implement Universal Algebra in the UniMath system. Our aim is to develop a general framework for formalizing and studying Universal Algebra in a proof assistant. By constituting a formal system for isolating…

Logic in Computer Science · Computer Science 2024-12-11 Gianluca Amato , Marco Maggesi , Maurizio Parton , Cosimo Perini Brogi

We present simple, self-contained proofs of correctness for algorithms for linearity testing and program checking of linear functions on finite subsets of integers represented as n-bit numbers. In addition we explore a generalization of…

Computational Complexity · Computer Science 2015-06-24 Sheela Devadas , Ronitt Rubinfeld

We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For a vast range of algorithms, the existence of an oracle to a…

Data Structures and Algorithms · Computer Science 2010-08-05 C. Seshadhri , Jan Vondrak

The correctness of complex software depends on the correctness of both the source code and the compilers that generate corresponding binary code. Compilers must do more than preserve the semantics of a single source file: they must ensure…

Programming Languages · Computer Science 2024-09-04 Luke Geeson , James Brotherston , Wilco Dijkstra , Alastair F. Donaldson , Lee Smith , Tyler Sorensen , John Wickerson

Quantum programs exhibit inherent non-deterministic behavior, which poses more significant challenges for error discovery compared to classical programs. While several testing methods have been proposed for quantum programs, they often…

Software Engineering · Computer Science 2024-05-27 Peixun Long , Jianjun Zhao

This document provides a brief overview of different metrics and terminology that is used to measure the performance of binary classification systems.

Machine Learning · Computer Science 2014-10-21 Sebastian Raschka

In hypothesis testing problems the property of strict unbiasedness describes whether a test is able to discriminate, in the sense of a difference in power, between any distribution in the null hypothesis space and any distribution in the…

Statistics Theory · Mathematics 2025-06-11 Andrew McCormack

The aim of this paper is to review some work conducted in the field of user testing that aims at specifying or clarifying the test procedures and at defining and developing tools to help conduct user tests. The topics that have been…

Human-Computer Interaction · Computer Science 2010-09-30 J. M. Christian Bastien

This paper presents the early deployment of a fully virtual platform to perform the tests of certified airborne software. This is an alternative to the current approach based on the use of dedicated hardware platforms.

Software Engineering · Computer Science 2012-04-17 Famantanantsoa Randimbivololona , Abderrahmane Brahmi , Philippe Le Meur

We present a complete methodology for testing the performances of quantum tomography protocols. The theory is validated by several numerical examples and by the comparison with experimental results achieved with various protocols for whole…

We describe, study, and experiment with an algorithm for finding all solutions of systems of polynomial equations using homotopy continuation and monodromy. This algorithm follows a framework developed in previous work and can operate in…

Symbolic Computation · Computer Science 2018-06-01 Nathan Bliss , Timothy Duff , Anton Leykin , Jeff Sommars