Third International Workshop on

Constraints in Formal Verification

Held in conjunction with

20th International Conference on Automated Deduction


Tallinn, Estonia, July 23, 2005

Index:

Overview ]

Scope ]

Delivery ]

Submissions ]

Important Dates ]

Invited Speakers ]

Schedule ]

Organization ]

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 for 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 formal 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.

Back to top ]

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.

Back to top ]

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.

All workshop attendees must pay the CADE workshop registration fee.

Back to top ]

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 papers should be submitted electronically in pdf format. Papers should be formatted using the Lecture Notes in Computer Science (LNCS) style.

Please send your submissions by email to cfv05-sub@sat.inesc-id.pt using the subject line "CADE05 CFV Workshop Submission".

The proceedings of CFV workshop are expected to be published as a volume of ENTCS, together with the proceedings of the other CADE'05 workshops.

Authors of selected papers will be invited to submit extended versions of their papers for review for a special issue of the Journal on Satisfiability, Boolean Modeling and Computation (JSAT). The special issue is scheduled for January 2006, and will have a submission deadline in September 2005.

Back to top ]

Important Dates

The proposed schedule of important dates for the workshop is as follows:

Paper submission deadlineJune 15th
Notification of acceptanceJune 29th
Camera-ready version deadlineJuly 2nd
Workshop DateJuly 23rd

Back to top ]

Invited Speakers

Masahiro Fujita
University of Tokyo, Japan

Fabio Somenzi
University of Colorado, U.S.A.

Tentative Workshop Schedule

09:00 - 10:00Invited Talk: Satisfaction and Justification
Fabio Somenzi
10:00 - 10:30Coffee break
10:30 - 12:30 Generalized Blocking Clauses in Unbounded Model Checking
Maciej Szreter

Circuit Based Quantification: A Probabilistic/Approximated Approach
Gianpiero Cabodi, Sergio Nocco, Stefano Quer

Experimenting with QBF-Based Formal Verification
Marco Benedetti

Applying Constraint Logic Programming for Predicate Abstraction of RTL Verilog Description
Tun Li, Yang Guo, Sikun Li, Dan Zhu

12:30 - 14:00Lunch
14:00 - 16:00Invited Talk: Dependence graph based verification and synthesis of hardware/software co-designs with SAT related formulation
Masahiro Fujita

Using Constraint Logic Programming for Symbolic Animation of Formal Models
Fabrice Bouquet, Drédéric Dadeau, Bruno Legeard

Why Don't We Simply Use a Model Checker?
Isabelle Dony, Baudouin Le Charlier

16:00 - 16:30 Cofee break
16:30 - 16:45Discussion & Conclusions.

Back to top ]

Workshop Chairs

Joao Marques-Silva
Technical University of Lisbon, IST/INESC-ID
Email: jpms@inesc-id.pt

Miroslav Velev
Reservoir Labs, U.S.A.
Email: mvelev@ece.cmu.edu

Back to top ]

Program Committee

Magdy Abadir, Freescale Semiconductor Inc., U.S.A.

Enrico Giunchiglia, Univ. Genova, Italy

Aarti Gupta, NEC Research Labs, U.S.A.

Ziyad Hanna, Intel, U.S.A.

Yakov Novikov, Infenion, Germany

Andreas Podelski, Max-Planck-Institut für Informatik, Germany

Mukul Prasad, Fujitsu Labs of America, U.S.A.

Stefano Quer, Politecnico di Torino, Italy

Toby Walsh, University of New South Wales, Australia


Back to top ]