Smallcheck and lazy smallcheck

Runciman, Colin; Naylor, Matthew; Lindblad, Fredrik

doi:10.1145/1411286.1411292

Cited by 133 publications

(38 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to shrink a counterexample, a PBT tool searches for smaller failing counterexamples. The search method can be specified individually for different data types [15,24,29].…”

Section: Overviewmentioning

confidence: 99%

Property-based testing of web services by deriving properties from business-rule models

Aichernig

Schumi

2017

Softw Syst Model

View full text Add to dashboard Cite

Property-based testing is well suited for web-service applications, which was already shown in various case studies. For example, it has been demonstrated that JSON schemas can be used to automatically derive test case generators for web forms. In this work, we present a test case generation approach for a rule engine-driven web-service application. Business-rule models serve us as input for property-based testing. We parse these models to automatically derive generators for sequences of web-service requests together with their required form data. Property-based testing is mostly applied in the context of functional programming. Here, we define our properties in an object-oriented style in C# and its tool FsCheck. We apply our method to the business-rule models of an industrial web-service application in the automotive domain.

show abstract

“…In order to shrink a counterexample, a PBT tool searches for smaller failing counterexamples. The search method can be specified individually for different data types [15,24,29].…”

Section: Overviewmentioning

confidence: 99%

Property-based testing of web services by deriving properties from business-rule models

Aichernig

Schumi

2017

Softw Syst Model

View full text Add to dashboard Cite

show abstract

“…A more generic approach is type-targeted testing [26], wherein types are converted into queries to SMT solvers whose answers provide counterexamples. SmallCheck and Lazy SmallCheck [25] are two Haskell libraries for propertybased testing, allowing an automatic exhaustive testing for small values. In Coq, as far as we know, there is no equivalent to the Haskell library SmallCheck.…”

Section: Related Workmentioning

confidence: 99%

Tests and Proofs for Enumerative Combinatorics

2016

View full text Add to dashboard Cite

Abstract. In this paper we show how the research domain of enumerative combinatorics can benefit from testing and formal verification. We formalize in Coq the combinatorial structures of permutations and maps, and a couple of related operations. Before formally proving soundness theorems about these operations, we first validate them, by using logic programming (Prolog) for bounded exhaustive testing and Coq/QuickChick for random testing. It is an experimental study preparing a more ambitious project about formalization of combinatorial results assisted by verification tools.

show abstract

“…This approach is implemented, for example, in the Smallcheck system for Haskell [RNL08] and also in the Korat system for Java [BKM02]. The idea here is that counterexamples are usually small and that the exhaustive tests give some guarantees, at least for finite structures like functions over finite domains.…”

Section: Related Workmentioning

confidence: 99%

JSConTest: Contract-Driven Testing and Path Effect Inference for JavaScript.

Heidegger¹,

Thiemann²

2012

JOT

View full text Add to dashboard Cite

Program understanding is a major obstacle during program maintenance. In an object-oriented language, understanding an operation requires understanding its type and its effect on the object network. The effect is particularly important for scripting languages where there is neither class structure that restricts the shape of an object nor any other kind of access control.We have designed and implemented JSConTest, a tool that provides a facility to annotate JavaScript programs with type and effect contracts and to create random tests out of the contracts. Run-time monitoring for contracts is implemented with a program transformation. The effect of an operation is described by access permissions, which abstract sets of access paths along which the operation reads or writes object properties. Type contracts can also be used to drive guided random testing of the program.JSConTest contains an algorithm for computing access permissions from a set of access paths obtained by running the program. The main ingredient of the algorithm is a novel heuristic that produces precise and concise results without user interaction. It has been applied to a range of examples with encouraging results.

show abstract

Smallcheck and lazy smallcheck

Cited by 133 publications

References 13 publications

Property-based testing of web services by deriving properties from business-rule models

Property-based testing of web services by deriving properties from business-rule models

Tests and Proofs for Enumerative Combinatorics

JSConTest: Contract-Driven Testing and Path Effect Inference for JavaScript.

Contact Info

Product

Resources

About