Fast and sound random generation for automated testing and benchmarking in objective Caml

Canou, Benjamin; Darrasse, Alexis

doi:10.1145/1596627.1596637

Cited by 14 publications

(13 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Boltzmann sampling is a framework for random generation of combinatorial structures (see [12] for further details). The basic idea is to give the sampler a class specification of a combinatorial structure and a value to control the size of the generated objects.…”

Section: Boltzmann Sampled Grammarsmentioning

confidence: 99%

See 1 more Smart Citation

Detecting Ambiguity in Programming Language Grammars

Vasudevan

Tratt

2013

Software Language Engineering

View full text Add to dashboard Cite

Abstract. Ambiguous Context Free Grammars (CFGs) are problematic for programming languages, as they allow inputs to be parsed in more than one way. In this paper, we introduce a simple non-deterministic search-based approach to ambiguity detection which non-exhaustively explores a grammar in breadth for ambiguity. We also introduce two new techniques for generating random grammars -Boltzmann sampling and grammar mutation -allowing us to test ambiguity detection tools on much larger corpuses than previously possible. Our experiments show that our breadth-based approach to ambiguity detection performs as well as, and generally better, than extant tools.

show abstract

Section: Boltzmann Sampled Grammarsmentioning

confidence: 99%

“…To get an efficient sampler, these two values need to be set as low as possible [12]. However, the lower these values are, the greater the likelihood of large objects being generated.…”

Section: Precisionmentioning

confidence: 99%

Detecting Ambiguity in Programming Language Grammars

Vasudevan

Tratt

2013

Software Language Engineering

View full text Add to dashboard Cite

show abstract

“…In fact, Canou and Darrasse [7] have already created a library for random test generation in OCaml based on the ideas of combinatorial species. There has also been some interesting recent work by Duregård on automatic derivation of QuickCheck generators for algebraic data types [11], and by Bernardy et al on using parametricity to improve random test generation [5]; combining these approaches with insights from the theory of species seems promising.…”

Section: Applicationsmentioning

confidence: 99%

Species and functors and types, oh my!

Yorgey

2010

Proceedings of the Third ACM Haskell Symposium on Haskell

View full text Add to dashboard Cite

The theory of combinatorial species, although invented as a purely mathematical formalism to unify much of combinatorics, can also serve as a powerful and expressive language for talking about data types. With potential applications to automatic test generation, generic programming, and language design, the theory deserves to be much better known in the functional programming community. This paper aims to teach the basic theory of combinatorial species using motivation and examples from the world of functional programming. It also introduces the species library, available on Hackage, which is used to illustrate the concepts introduced and can serve as a platform for continued study and research.

show abstract

“…Automated testing One interesting application is to use species expressions as input to a test-generator-generator, for either random [9] or exhaustive [22] testing. In fact, Canou and Darrasse [7] have already created a library for random test generation in OCaml based on the ideas of combinatorial species. There has also been some interesting recent work by Duregård on automatic derivation of QuickCheck generators for algebraic data types [11], and by Bernardy et al on using parametricity to improve random test generation [5]; combining these approaches with insights from the theory of species seems promising.…”

Section: Applicationsmentioning

confidence: 99%

Species and functors and types, oh my!

Yorgey

2010

SIGPLAN Not.

View full text Add to dashboard Cite

The theory of combinatorial species, although invented as a purely mathematical formalism to unify much of combinatorics, can also serve as a powerful and expressive language for talking about data types. With potential applications to automatic test generation, generic programming, and language design, the theory deserves to be much better known in the functional programming community. This paper aims to teach the basic theory of combinatorial species using motivation and examples from the world of functional programming. It also introduces the species library, available on Hack-age, which is used to illustrate the concepts introduced and can serve as a platform for continued study and research.

show abstract

Fast and sound random generation for automated testing and benchmarking in objective Caml

Cited by 14 publications

References 9 publications

Detecting Ambiguity in Programming Language Grammars

Detecting Ambiguity in Programming Language Grammars

Species and functors and types, oh my!

Species and functors and types, oh my!

Contact Info

Product

Resources

About