The Blame Game for Property-based Testing

We present a toy programming language supporting higher-order functions, extensible records and polymorphic variants, as well as a sufficient condition (that can be tested in

For an EDatatype instance, we define manually a set of mutation operators that are applicable to it when applying the mutation actions. For example, applying the mutation actions

To generate executable test cases from misuse case specifications we employ some concepts of natural language programming, a term which refers to approaches automatically

We show that, given two formally specified programming languages, it is possible to construct the formal semantics of an aggregated language, in which programs consist of pairs

In this section, we show an improved upper bound and a matching lower bound on the query complexity of property testing of regular languages under weighted edit distance.. 3.1

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Verifiability is often split in different sub-properties according to the auditors that perform the checks: individual verifiability (each voter can check that her ballot was

For the same implication with Property FM’, it is convenient to first observe that a topological group G has Property FM’ if and only if for every continuous discrete G-set