<html><head></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space; "><span class="Apple-tab-span" style="white-space: pre; "><div><span class="Apple-tab-span" style="white-space: pre; "><br></span></div><div><span class="Apple-tab-span" style="white-space: pre; ">D</span>ue to several requests, we extend the deadline for abstract and</div><div>paper submission by one week ...</div><div><br></div><div>Burkhart Wolff & Martin Gogolla</div><div><span class="Apple-tab-span" style="white-space: pre; "><br></span></div><div><span class="Apple-tab-span" style="white-space: pre; ">A</span>pologies for multiple copies ...</div><div><br></div><div>=====================================================</div><div><span class="Apple-tab-span" style="white-space: pre; "><br></span></div> </span><span class="Apple-tab-span" style="white-space: pre; "> </span><span class="Apple-tab-span" style="white-space: pre; "> </span> CALL FOR PAPERS<br> 5th International Conference on Tests and Proofs (TAP 2011)<br><span class="Apple-tab-span" style="white-space: pre; "> </span> <a href="http://www.tap2011.informatik.uni-bremen.de/">http://www.tap2011.informatik.uni-bremen.de/</a><br><span class="Apple-tab-span" style="white-space: pre; "> </span> June 30 - July 1, 2011, Zuerich, Switzerland<br><span class="Apple-tab-span" style="white-space: pre; "> </span> Part of the TOOLS Federated Conferences 2011<br><br>The TAP conference is devoted to the convergence of proofs and tests, to<br>the application of techniques from both sides and their combination for<br>the advancement of software quality. Test and Proof seem to be<br>contradictory techniques: if you have proved your program, it's<br>fruitless to comb it for bugs; and if you are testing it, that is surely<br>a sign that you have given up on any hope to prove its correctness.<br>Accordingly, proofs and tests have, since the onset of software<br>engineering research, been pursued by distinct communities.<br><br>However, the development of both approaches lead to the discovery of<br>common issues and to the realization that each may need the other. The<br>emergence of model checking has been one of the first signs that<br>contradiction may yield to complementarity. Further evidence give<br>test data generation techniques from models or programs boil down to<br>constraint resolution techniques for relatively large formula; the<br>advent of powerful SMT solvers have therefore powered new testing<br>techniques. Finally, since formal, proof-based verification is costly,<br>testing invariants and background theories can be helpful to detect<br>errors early and to improve cost effectivity. Summing up, in the past<br>few years an increasing number of research efforts have encountered the<br>need for combining proofs and tests, dropping earlier dogmatic views of<br>incompatibility and taking instead the best of what each of these<br>software engineering domains has to offer.<br><br>The TAP conference aims to bring together researchers and practitioners<br>working in the converging fields of testing and proving, and will offer<br>a generous allocation of panels and informal discussions.<br><br>Topics of interest include (other topics related to TAP are welcome):<br>- Transfer of concepts from testing to proving (e.g., coverage criteria)<br> and from proving to testing<br>- Program proving with the aid of testing techniques<br>- Verification and testing techniques combining proofs and tests<br>- Generation of test data, oracles, or preambles by deductive<br> techniques such as: theorem proving, model checking, symbolic<br> execution, constraint logic programming<br>- Model-based testing and verification<br>- Generation of specifications by deduction<br>- Automatic bug finding<br>- Formal frameworks<br>- Tool descriptions and experience reports<br>- Case studies combining tests and proofs<br><br>Abstract submission: February 11, 2011<br>Paper submission: February 18, 2011<br>Notification: March 14, 2011<br>Camera ready version: March 28, 2011<br>TAP conference: June 30 - July 01, 2011<br>TOOLS conferences (TOOLS, ICMT, SC, TAP): June 27 - July 01, 2011<br>Conference Chairs: Yuri Gurevich, Bertrand Meyer<br>Program Chairs: Martin Gogolla, Burkhart Wolff<br>Publication Chair: Gordon Fraser<br>Web Chair: Lars Hamann<br><br>Program Committee (to be finalized; acceptance for few names pending):<br> Nazareno Aguirre, Bernhard K. Aichernig, Paul Ammann, Benoit Baudry,<br> Dirk Beyer, Nikolaj Bjoerner, Achim Brucker, Koen Claessen, Robert<br> Clariso, John A. Clark, Marco Comini, Catherine Dubois, Gordon<br> Fraser, Carlo Alberto Furia, Angelo Gargantini, Arnaud Gotlieb,<br> Reiner Haehnle, Bart Jacobs, Thierry Jeron, Gregory Kapfhammer,<br> Nikolai Kosmatov, Victor Kuliamin, Karl Meinke, Antoni Olive, Holger<br> Schlingloff, T.H. Tse, Margus Veanes.<br><br>Submissions (via <a href="http://www.tap2011.informatik.uni-bremen.de/">http://www.tap2011.informatik.uni-bremen.de/</a>):<br>- Research papers: full papers with at most 16 pages in LNCS format<br> (pdf), which have to be original, unpublished and not submitted<br> elsewhere.<br>- Short contributions: work in progress, (industrial) experience<br> reports or tool demonstrations, position statements; an extended<br> abstract with at most 6 pages in LNCS format (pdf) is expected.<br><br>Accepted papers will be published in the Springer LNCS series (details<br>to be confirmed) and will be available at the conference. The program<br>chairs are negotiating with journals about a special issue dedicated to<br>extended versions of selected conference papers.<br><br>The contents of previous TAP proceedings is available at:<br><a href="http://www.informatik.uni-trier.de/~ley/db/conf/tap/">http://www.informatik.uni-trier.de/~ley/db/conf/tap/</a></body></html>