Less Arbitrary waiting time

11/05/2020
by   Michał J. Gajda, et al.
0

Property testing is the cheapest and most precise way of building up a test suite for your program. Especially if the datatypes enjoy nice mathematical laws. But it is also the easiest way to make it run for an unreasonably long time. We prove connection between deeply recursive data structures, and epidemic growth rate, and show how to fix the problem, and make Arbitrary instances run in linear time with respect to assumed test size.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

05/03/2020

Efficiently Testing Simon's Congruence

Simon's congruence ∼_k is defined as follows: two words are ∼_k-equivale...
12/21/2020

Fast Rule-Based Graph Programs

Implementing graph algorithms efficiently in a rule-based language is ch...
05/31/2018

Tokenized Data Markets

We formalize the construction of decentralized data markets by introduci...
11/04/2020

PCP Theorems, SETH and More: Towards Proving Sub-linear Time Inapproximability

In this paper we propose the PCP-like theorem for sub-linear time inappr...
06/27/2021

Effective grey-box testing with partial FSM models

For partial, nondeterministic, finite state machines, a new conformance ...
05/25/2012

Foreword: A Computable Universe, Understanding Computation and Exploring Nature As Computation

I am most honoured to have the privilege to present the Foreword to this...
07/07/2021

"Are you sure?": Preliminary Insights from Scaling Product Comparisons to Multiple Shops

Large eCommerce players introduced comparison tables as a new type of re...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.