From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id B896CBB83 for ; Mon, 29 May 2006 08:03:08 +0200 (CEST) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k4T60o4k011250 for ; Mon, 29 May 2006 08:00:50 +0200 Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id IAA12787 for ; Mon, 29 May 2006 08:00:49 +0200 (MET DST) Received: from ug-out-1314.google.com (ug-out-1314.google.com [66.249.92.170]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id k4T60luu011245 for ; Mon, 29 May 2006 08:00:47 +0200 Received: by ug-out-1314.google.com with SMTP id o2so212872uge for ; Sun, 28 May 2006 23:00:47 -0700 (PDT) DomainKey-Signature: a=rsa-sha1; q=dns; c=nofws; s=beta; d=gmail.com; h=received:message-id:date:from:to:subject:cc:mime-version:content-type; b=ZzOGV3imGQ3+KPySU46CIEtqnniO1r6UliqjzaUHiu/qZuODqCgUxshrU9Kin26SAP+bEcmrYld8A7LT0PF1+sy0dtmThVJepxzX3nuXa+aK38Z9VtQmbpfwkxOSWTDQwCfJWhBTgGJaDYO8Iu7SvbcM4h8qXonxDqCOR+KSVIA= Received: by 10.67.105.19 with SMTP id h19mr1559207ugm; Sun, 28 May 2006 23:00:17 -0700 (PDT) Received: by 10.67.28.14 with HTTP; Sun, 28 May 2006 23:00:16 -0700 (PDT) Message-ID: <95bd0d720605282300t673b5304pc02df9464ea9949d@mail.gmail.com> Date: Mon, 29 May 2006 01:00:16 -0500 From: "Miroslav Velev" To: acclaim@sics.se, acl2@cs.utexas.edu, acl@cs.columbia.edu, agents@cs.umbc.edu, ai@uk.ac.qmw.dcs, aiia@di.unito.it, alp-list@intellektik.informatik.th-darmstadt.de, alp@doc.ic.ac.uk, amast@cs.utwente.nl, asci@twi.tudelft.nl, apes@cs.strath.ac.uk, apng-all@apng.org, appiar@ncc.up.pt, appsem-ed-site@dcs.ed.ac.uk, appsem@dcs.qmw.ac.uk, appsem@pauillac.inria.fr, appsem@disi.unige.it, appsem@cs.chalmers.se, appsem-local@di.uminho.pt, appsem-discussion@harlequin.co.uk, atp@logic.tuwien.ac.at, atp_alias@cs.jcu.edu.au, bcs-hci-request@jiscmail.ac.uk, behavior@cs.ucsd.edu, benelog@cs.kuleuven.ac.be, bista@di.unipi.it, bra-types@cs.chalmers.se, brics-others-dk@daimi.aau.dk, brics-vip@daimi.aau.dk, cade@research.att.com, calculemus-ig@dist.unige.it, calculemus-ig@calculemus.net, calligramme@loria.fr, caml-list@inria.fr, categories@mta.ca, cav-all@csa.cs.technion.ac.il, ccl@dfki.uni-sb.de, cclp.x@parc.xerox.com, cl-adverts@spock.inf.tu-dresden.de, clean-list@cs.kun.nl, clp@cis.ohio-state.edu, clp@comp.nus.edu.sg, clp@cs.cmu.edu, clpr-users@comp.nus.edu.sg, cofi-reactive@brics.dk, Colibri@let.uu.nl, collinsp@scot.ac.uk, comlab@comlab.ox.ac.uk, complog@cs.nmsu.edu, comprox@doc.ic.ac.uk, compsci@uk.ac.aston.mail.demon.co.uk, compulog-deduction@cs.bham.ac.uk, compulog-list@cwi.nl, compulog@doc.imperial.ac.uk, compulognet-parimp@dia.fi.upm.es, compunode-exec@ecrc.de, compunode@compulog.org, compunode@dfki.de, compunode@ecrc.de, concurrency@cwi.nl, conferences@iao.fhg.de, constraints-list@cwi.nl, coq-club@pauillac.inria.fr, cphc-conf@jiscmail.ac.uk, cp-ai-or_mailing_list@uni-paderborn.de, cs-logic@cs.indiana.edu, csl99org@eucmos.sim.ucm.es, csl@dbai.tuwien.ac.at, csp@carlit.toulouse.inra.fr, cyber-security@stevens-tech.edu, DAI-List@ece.sc.edu, dai-list@mcc.com, daimi-employees@brics.dk, dappia@di.fct.unl.pt, dataloger@cs.chalmers.se, dbworld@cs.wisc.edu, digest@uk.ac.ed.aiva.ed.ac.uk, discipl@inria.fr, distributed-ai@jiscmail.ac.uk, dma-list@nic.surfnet.nl, DMANET@zpr.uni-koeln.de, dreamers@dai.ed.ac.uk, ea@ira.uka.de, ea-owner@ira.uka.de, eacsl@dimi.uniud.it, eapls@jiscmail.ac.uk, eatcs-it@cs.unibo.it, echos@ens.fr, eclipse_users@ecrc.de, ecoop-info@ecoop.org, elsnet-list@cogsci.ed.ac.uk, erlang-questions@erlang.org, eslai@cs.stevens-tech.edu, facs@lboro.ac.uk, facs-members@lut.ac.uk, fg121@sunjessen46.informatik.tu-muenchen.de, flprog@informatik.uni-muenchen.de, fm-info@air16.larc.nasa.gov, fmics@inrialpes.fr, focs@comlab.ox.ac.uk, formal-methods@cs.uidaho.edu, fr-sem@frmug.org, frocos@loria.fr, fsdm@it.uq.edu.au, fsdm@cs.uq.oz.au, generic-haskell@cs.uu.nl, genie-logiciel@wanadoo.fr, glasgow-fp@dcs.gla.ac.uk, gulp@di.unipi.it, harning@sigchi.dk, haskell@dcs.glasgow.ac.uk, haskell@haskell.org, henk@cs.kun.nl, hise-safety-critical@minster.cs.york.ac.uk, hpsg-l@lists.stanford.edu, hvg@cl.cam.ac.uk, IDSS@socs.uts.edu.au, ifmsig@cs.tcd.ie, ikbs@caad.ed.ac.uk, icfp@dcs.gla.ac.uk, imps@linus.mitre.org, info-hol@jaguar.cs.byu.edu, ipa-list@win.tue.nl, isabelle-users@cl.cam.ac.uk, jair-ed@isi.edu, jml@cs.iastate.edu, kgs@dbai.tuwien.ac.at, kgs@logic.tuwien.ac.at, lambda-usergroup@dcs.ed.ac.uk, lego-club@dcs.ed.ac.uk, lfcs-interest@dcs.ed.ac.uk, lfg@lists.stanford.edu, lics@research.att.com, lics@research.bell-labs.com, lics-list@math.uic.edu, lics-request@math.uic.edu, lics-request@sun1.matematik.uni-freiburg.de, lics-email@cs.idiana.edu, logic-announce@uclink4.berkeley.edu, logic-list@cs.rice.edu, logic-list@Helsinki.fi, logic-ml@logic.jaist.ac.jp, logic@cs.cornell.edu, logic@math.ufl.edu, logic@theory.lcs.mit.edu, lotos-world@sanson.dit.upm.es, lpnmr@cs.engr.uky.edu, lprolog@central.cis.upenn.edu, lprolog@cs.umn.edu, maamaw@cosmos.imag.fr, mercury-ads@cs.mu.oz.au, mfpl-mail@math.tulane.edu, mizar-forum@mizar.uwb.edu.pl, ml@ics.uci.edu, mlnet@swi.psy.uva.nl, mlnet@csd.abdn.ac.uk, mol@cis.upenn.edu, mrg@itc.it, multi@cs.chalmers.se, nl-kr@cs.rpi.edu, nlcl@cogs.susx.ac.uk, nlp-ia@bosoleil.ci.umoncton.ca, nqthm-users@cli.com, nuprllist@cs.cornell.edu, nuprlnotes@cs.cornell.edu, nvti-list@cwi.nl, om-announce@lars.math.fsu.edu, owner-uai@cs.orst.edu, oz-users@dfki.uni-sb, ozsl-list@wins.uva.nl, parforce@ecrc.de, papm@dcs.ed.ac.uk, PetriNets@daimi.aau.dk, plt-scheme@slow.flux.utah.edu, pop-group@cs.cmu.edu, POPX@vax.ox.ac.uk, PROCOS@jiscmail.ac.uk, practical-applications@pap.com, prog-lang@brics.dk, prog-lang@daimi.au.dk, prog-lang@diku.dk, proglog@cs.chalmers.se, prolia@tlxf.geomail.org, prolog-pe@bach.ces.cwru.edu, prolog-vendors@sics.se, puml-list@cs.york.ac.uk, protagonist@cs.kun.nl, pvs@csl.sri.com, pvs-owner@csl.sri.com, qed@mcs.anl.gov, quintus-users@quintus.com, reliable_computing@interval.usl.edu, research@macs.biu.ac.il, rewriting@ens-lyon.fr, rewriting@loria.fr, rewriting-list@loria.crin.fr, rewriting-list@lorraine.loria.fr, rrrs-authors@zurich.csail.mit.edu, scheme48@zurich.csail.mit.edu, scheme@mc.lcs.mit.edu, sepia_users@ecrc.de, seworld@cs.colorado.edu, sicstus-users@sics.se, sig-es@c-lab.de, smid-medl@imv.au.dk, softverf@jaguar.cs.byu.edu, softverf@nist.gov, stimdi-rek-subscribe@yahoogroups.com Subject: CFV'06: Call for Papers Cc: "Joao Marques-Silva" MIME-Version: 1.0 Content-Type: multipart/alternative; boundary="----=_Part_37356_9734467.1148882416989" X-j-chkmail-Score: MSGID : 447A8E12.000 on nez-perce : j-chkmail score : XX : 5/20 0 X-j-chkmail-Score: MSGID : 447A8E0F.000 on nez-perce : j-chkmail score : XXX : 5/20 1 X-Miltered: at nez-perce with ID 447A8E12.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 447A8E0F.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; solvers:01 solvers:01 lncs:01 lncs:01 joao:01 joao:01 06.:98 2006:98 disseminate:98 06.:98 2006:98 disseminate:98 short:01 short:01 constraint:01 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: * X-Spam-Status: No, score=1.9 required=5.0 tests=HTML_60_70,HTML_MESSAGE, RCVD_BY_IP,RCVD_IN_BL_SPAMCOP_NET autolearn=disabled version=3.0.3 ------=_Part_37356_9734467.1148882416989 Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: quoted-printable Content-Disposition: inline Call for Papers: CFV'06 Fourth International Workshop on Constraints in Formal Verification (CVF'06), http://www.easychair.org/FLoC-06/CFV.html Paper submission deadline: June 5 CFV'06 will be held on August 22, and will be part of the 3rd International Joint Conference on Automated Reasoning (IJCAR'06), http://ijcar06.uni-koblenz.de/ a conference at the Federated Logic Conference (FLoC) http://research.microsoft.com/floc06/ in Seattle, Washington, August 2006 Overview Formal verification is of crucial significance in the development of hardware and software systems. In the last few years, tremendous progress was made in both the speed and capacity of constraint technology. Most notably, SAT solvers have become orders of magnitude faster and capable of handling problems that are orders of magnitude bigger, thus enabling the formal verification of more complex computer systems. As a result, the formal verification of hardware and software has become a promising area fo= r research and industrial applications. The main goals of the Constraints in Formal Verification workshop are to bring together researchers from the CSP/SAT and the formal verification communities, to describe new applications of constraint technology to forma= l verification, to disseminate new challenging problem instances, and to propose new dedicated algorithms for hard formal verification problems. This workshop will be of interest to researchers from academia and industry= , working in constraints or in formal verification and interested in the application of constraints in formal verification. Scope The scope of the workshop includes topics related with the application of constraint technology in formal verification, namely: application of constraint solvers to hardware verification; application of constraint solvers to software verification; dedicated solvers for formal verification problems; challenging formal verification problems. Delivery The workshop will be scheduled for one full day. We expect to structure the workshop to allow ample time for discussion and demonstration of new tools and new problem instances. Submissions Submissions can include one of the following: -A workshop paper of up to 15 pages in LNCS format. -A short paper of up to 4 pages, in LNCS format, describing an industrial experience. Workshop Chairs Joao Marques-Silva, University of Southampton, UK Miroslav Velev, Consultant, U.S.A. Program Committee Armin Biere, Johannes Kepler University, Austria Louise Dennis, University of Nottingham, U.K. Wolfgang Kunz, Technical University of Kaiserslautern, Germany Ines Lynce, Technical University of Lisbon, Portugal Darko Marinov, University of Illinois at Urbana-Champaign, U.S.A. John Moondanos, Intel, U.S.A. Chao Wang, NEC Research Labs, U.S.A. Li-C. Wang, University of Santa Barbara, U.S.A. ------=_Part_37356_9734467.1148882416989 Content-Type: text/html; charset=ISO-8859-1 Content-Transfer-Encoding: quoted-printable Content-Disposition: inline

Call for Papers: CFV'06

 

Fourth International Workshop on Constraints in Formal Verificatio= n (CVF'06),

http://www.e= asychair.org/FLoC-06/CFV.html

 

Paper submission deadline: June 5

 

 

CFV'06 will be held on August 22, and will be part of

the 3rd  Internation= al Joint Conference on Automated Reasoning (IJCAR'06),

http://ijcar06.uni-kobl= enz.de/

a conference at the Federated Logic Conference (FLoC)

http://research.= microsoft.com/floc06/

in Seattle, Washington, August 2006

 

 

Overview

Formal verification is of crucial significance in the development = of hardware and software systems. In the last few years, tremendous progres= s was made in both the speed and capacity of constraint technology. Most no= tably, SAT solvers have become orders of magnitude faster and capable of ha= ndling problems that are orders of magnitude bigger, thus enabling the form= al verification of more complex computer systems. As a result, the formal v= erification of hardware and software has become a promising area for resear= ch and industrial applications.=20

 

The main goals of the Constraints in Formal Verification workshop = are to bring together researchers from the CSP/SAT and the formal verificat= ion communities, to describe new applications of constraint technology to f= ormal verification, to disseminate new challenging problem instances, and t= o propose new dedicated algorithms for hard formal verification problems.= =20

 

This workshop will be of interest to researchers from academia and= industry, working in constraints or in formal verification and interested = in the application of constraints in formal verification.=20

 

 

Scope

The scope of the workshop includes topics related with the applica= tion of constraint technology in formal verification, namely:

 

application of constraint solvers to hardware verification;

application of constraint solvers to software verification;

dedicated solvers for formal verification problems;

challenging formal verification problems.

 

Delivery

The workshop will be scheduled for one full day. We expect to stru= cture the workshop to allow ample time for discussion and demonstration of = new tools and new problem instances.=20

 

Submissions

Submissions can include one of the following:

-A workshop paper of up to 15 pages in LNCS format.

-A short paper of up to 4 pages, in LNCS format, describing an ind= ustrial experience.

 

 

Workshop Chairs

Joao Marques-Silva, University of Southampton, UK

Miroslav Velev, Consultant, U.S.A.

 

 

Program Committee

Armin Biere, Johannes Kepler University, Austria

Louise Dennis, University of Nottingham, U.K.

Wolfgang Kunz, Technical University of Kaiserslautern, Germany

Ines Lynce, Technical University of Lisbon, Portugal

Darko Marinov, University of Illinois at Urbana-Champaign, U.S.A.<= /font>

John Moondanos, Intel, U.S.A.

Chao Wang, NEC Research Labs, U.S.A.

Li-C. Wang, University of Santa Barbara, U.S.A.

 

------=_Part_37356_9734467.1148882416989--