Tests and Proofs

1. Front Matter

   PDF

2. Security Testing and Formal Methods for High Levels Certification of Smart Cards

   • Boutheina Chetali

   Pages 1-5

3. Verification, Testing and Statistics

   • Aditya Nori, Sriram K. Rajamani

   Pages 6-9

4. Development of a Generic Voter under FoCal

   • Philippe Ayrault, Thérèse Hardin, François Pessaux

   Pages 10-26

5. Combining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing

   • Andrea Calvagna, Angelo Gargantini

   Pages 27-42

6. Incorporating Historical Test Case Performance Data and Resource Constraints into Test Case Prioritization

   • Yalda Fazlalizadeh, Alireza Khalilian, Mohammad Abdollahi Azgomi, Saeed Parsa

   Pages 43-57

7. Complementary Criteria for Testing Temporal Logic Properties

   • Gordon Fraser, Franz Wotawa

   Pages 58-73

8. Could We Have Chosen a Better Loop Invariant or Method Contract?

   • Christoph Gladisch

   Pages 74-89

9. Consistency, Independence and Consequences in UML and OCL Models

   • Martin Gogolla, Mirco Kuhlmann, Lars Hamann

   Pages 90-104

10. Dynamic Symbolic Execution for Testing Distributed Objects

    • Andreas Griesmayer, Bernhard Aichernig, Einar Broch Johnsen, Rudolf Schlatte

    Pages 105-120

11. Combining Model Checking and Testing in a Continuous HW/SW Co-verification Process

    • Paula Herber, Florian Friedemann, Sabine Glesner

    Pages 121-136

12. Symbolic Execution Based Model Checking of Open Systems with Unbounded Variables

    • Nicolas Rapin

    Pages 137-152

13. Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate

    • Stefan Ratschan, Jan-Georg Smaus

    Pages 153-168

14. Back Matter

    PDF

1 This volume contains the research papers and invited papers presented at the Third International Conference on Tests and Proofs (TAP 2009) held at ETH Zurich, Switzerland, during July 2–3, 2009. TheTAPconferenceisdevotedtotheconvergenceofproofsandtests. Itc- bines ideasfromboth sidesforthe advancementofsoftwarequality. Toprovethe correctness of a program is to demonstrate, through impeccable mathematical techniques, that it has no bugs; to test a program is to run it with the exp- tation of discovering bugs. The two techniques seem contradictory: if you have proved your program, it is fruitless to comb it for bugs; and if you are testing it, that is surely a sign that you have given up on any hope of proving its corre- ness. Accordingly, proofs and tests have, since the onset of software engineering research,been pursuedby distinct communities using ratherdi?erent techniques and tools. And yet the development of both approaches leads to the discovery of common issues and to the realization that each may need the other. The emergence of model checking has been one of the ?rst signs that contradiction may yield to complementarity, but in the past few years an increasing number of research e?orts have encountered the need for combining proofs and tests, dropping earlier dogmatic views of incompatibility and taking instead the best of what each of these software engineering domains has to o?er.

• automatic testing
• conformance testing
• constraint logic programming
• dynamic logic
• first-order logic
• formal methods
• formal models
• linear temporal logic
• model checking
• model-based testing
• program analysis
• program verification
• programming
• testing
• verification

• CÉDRIC-ENSIIE, Évry Cedex, France

  Catherine Dubois

Policies and ethics