Tests and Proofs: 6th International Conference, TAP 2012, by Andreas Kuehlmann (auth.), Achim D. Brucker, Jacques

By Andreas Kuehlmann (auth.), Achim D. Brucker, Jacques Julliand (eds.)

This booklet constitutes the refereed lawsuits of the sixth foreign convention on try and Proofs, faucet 2012, held in Prague, Czech Republic, in May/June 2012, as a part of the instruments 2012 Federated meetings. The nine revised complete papers provided including 2 invited papers, four brief papers and one educational have been conscientiously reviewed and chosen from 29 submissions. The papers are dedicated to the convergence of exams and proofs for constructing novel suggestions and alertness that aid engineers in construction safe, secure, and trustworthy platforms. one of the themes coated are model-based trying out; scenario-based checking out; advanced facts constitution iteration; and the validation of protocols and libraries.

Show description

Read or Download Tests and Proofs: 6th International Conference, TAP 2012, Prague, Czech Republic, May 31 – June 1, 2012. Proceedings PDF

Best international books

Tests and Proofs: 6th International Conference, TAP 2012, Prague, Czech Republic, May 31 – June 1, 2012. Proceedings

This booklet constitutes the refereed complaints of the sixth foreign convention on try out and Proofs, faucet 2012, held in Prague, Czech Republic, in May/June 2012, as a part of the instruments 2012 Federated meetings. The nine revised complete papers awarded including 2 invited papers, four brief papers and one instructional have been rigorously reviewed and chosen from 29 submissions.

Cooperative Information Agents II Learning, Mobility and Electronic Commerce for Information Discovery on the Internet: Second International Workshop, CIA'98 Paris, France, July 4–7, 1998 Proceedings

This ebook constitutes the refereed complaints of the second one overseas Workshop on Cooperative info platforms, CIA'98, held in cognition with brokers global in July 1998 in Paris. The e-book offers 9 invited contributions including 14 revised complete papers chosen from a complete of fifty four submissions.

Data Warehousing and Knowledge Discovery: 12th International Conference, DAWAK 2010, Bilbao, Spain, August/September 2010. Proceedings

Facts warehousing and data discovery has been generally permitted as a key te- nology for organizations and corporations to enhance their talents in facts research, determination help, and the automated extraction of data from facts. With the exponentially starting to be volume of knowledge to be integrated within the decision-making technique, the knowledge to be thought of develop into a growing number of complicated in either constitution and semantics.

Automated Reasoning: 6th International Joint Conference, IJCAR 2012, Manchester, UK, June 26-29, 2012. Proceedings

This booklet constitutes the refereed lawsuits of the sixth foreign Joint convention on computerized Reasoning, IJCAR 2012, held in Manchester, united kingdom, in June 2012. IJCAR 2012 is a merger of major occasions in computerized reasoning, particularly CADE (International convention on computerized Deduction), FroCoS (International Symposium on Frontiers of mixing Systems), FTP (International Workshop on First-Order Theorem Proving), and TABLEAUX (International convention on automatic Reasoning with Analytic Tableaux and comparable Methods).

Additional info for Tests and Proofs: 6th International Conference, TAP 2012, Prague, Czech Republic, May 31 – June 1, 2012. Proceedings

Sample text

We still have to define what we mean by “exercise in a similar way”. This can be done, in principle, by choosing any white-box coverage criterion, to be applied to repOK. For instance, we can consider decision coverage on repOK; in this case, two inputs to the traversing routine (the code under test) would be considered equivalent if they make the decision points in repOK to evaluate to the same values. = null never evaluates to true in this case). 24 V. Bengolea et al. In general, notice that any white-box testing criterion Crit gives rise to a partition of the input space of the program under test, with each class in the partition usually capturing some path or branch condition expressed as a constraint on the inputs.

As the experiments show, for some white-box coverage criteria on the representation invariant, we obtain a performance in mutant killing that is comparable to that of bounded-exhaustive suites. In particular, we used a variant of decision coverage, called counting decision coverage, which takes into account the number of times each decision point in the program under test becomes true and false. This criterion, applied to the representation invariant, is useful in our context, since in general we observe that there is a relationship between the size of the structure and the number of times a particular decision point in the corresponding representation invariant evaluates to true or false.

Moreover, this process strongly depends on the structure of the repOK routine too. For instance, an if-then-else with a composite condition could alternatively be written as nested if-then-else statements with atomic conditions; such structurally different but behaviourally equivalent programs may have very different equivalence classes, for the same white-box criterion, and therefore our approach may result in different reduced suites. 4 On the Effectiveness of Reduced Test Suites In this section we evaluate the effectiveness of test suites reduced using the approach presented in the previous section.

Download PDF sample

Rated 4.27 of 5 – based on 20 votes