<div><br></div><div>------------------------------------------------------------------------</div><div><br></div><div> ***** CALL FOR WORKSHOP PROPOSALS *******</div><div><br></div><div><br></div><div> 24th International Conference on </div>
<div> Computer Aided Verification </div><div> CAV 2012 </div><div> July 7-13, 2012 </div><div> Berkeley, California, USA</div><div><br></div><div><br></div><div>Workshop Chair: Shuvendu Lahiri (Microsoft Research, Redmond)</div>
<div><br></div><div>The 2012 Computer-Aided Verification (CAV) Workshops provide an</div><div>opportunity for participants to discuss topics in the broader</div><div>verification related domains. CAV 2012 Workshops will be held</div>
<div>before the main conference on July 7 and 8.</div><div><br></div><div>Workshop proposals will be reviewed by the Workshop chair along with</div><div>the program chairs and members of the steering committee. Proposals</div>
<div>must consist of the following two parts:</div><div><br></div><div>-- Part I: Technical Information --</div><div><br></div><div>A short (about 1 page) scientific justification of the proposed</div><div>topic, its significance and relevance to CAV, and the particular</div>
<div>benefits of the workshop to the verification community, as well as a</div><div>list of previous or related workshops (if relevant).</div><div><br></div><div>-- Part II: Organizational Information --</div><div><br></div>
<div>- contact information of the workshop organizers</div><div>- identifying a main contact for the workshop (i.e. a workshop chair)</div><div>- the desired length of the workshop, (one or two days)</div><div>- estimate of the audience size</div>
<div>- proposed format and agenda (for example, demo sessions, tutorials, etc.)</div><div>- potential invited speakers</div><div>- procedures for selecting papers and participants</div><div>- plans for dissemination, if any (for example, special issues of</div>
<div> journals)</div><div>- special technical, AV, or USB stick needs</div><div>- links to a preliminary website of the workshop and call for</div><div> papers (if possible)</div><div>- information if workshop has been previously held</div>
<div><br></div><div><br></div><div>Important Dates:</div><div><br></div><div>Proposals are due by Nov 10th, 2011 by email to the Workshop</div><div>chair. Organizers will be notified by Nov 20th, 2011.</div><div><br></div>
<div>The workshop proposals will be reviewed and evaluated on the following</div><div>criteria:</div><div><br></div><div>* Potential to advance state of the art in verification technologies,</div><div>especially ability to break new ground.</div>
<div>* Relevance to CAV.</div><div>* Overlap of topics with other proposed workshops.</div><div>* Past-successes of the workshop and association with previous CAV</div><div>conferences.</div><div>* Organizers' ability and experience to lead a successful workshop.</div>
<div><br></div><div>All accepted workshops will be asked to provide a webpage, call for</div><div>papers, and list of invited speakers. The workshop participants will</div><div>be required to register for the workshop through the CAV main</div>
<div>registration page.</div><div><br></div><div>The registration rates for workshops will be set by CAV organizers in</div><div>consultation with the workshop organizers, following rate structures</div><div>similar to (but not the same as) those followed in the past. The</div>
<div>workshop organizers are strongly encouraged to seek external funding</div><div>and sponsorships.</div><div><br></div><div>For further enquiries or information, please contact:</div><div> </div><div>Shuvendu Lahiri (CAV2012 Workshop Chair)</div>
<div>Microsoft Research, </div><div>One Microsoft Way,</div><div>Redmond, WA 98052, USA</div><div>Phone: 1-425-722-4122</div><div>email: shuvendu AT <a href="http://microsoft.com">microsoft.com</a></div><div>http: <a href="http://research.microsoft.com/en-us/people/shuvendu/">http://research.microsoft.com/en-us/people/shuvendu/</a></div>
<div>-------------------------------------------------------------------------</div><div><br></div>