What are the verification problems? What are the deduction techniques?
Sydney, August 10-11, 2008
in connection with IJCAR 2008
Keynote SpeakersG. Barthe* (IMDEA Software, Madrid)G. Heiser (National ICT Australia) A. Groce* (NASA JPL) P. Kalla* (U of Utah) * invited jointly with the CFV Workshop
Program & Workshop ChairsB. Beckert (U of Koblenz)G. Klein (National ICT Australia)
Program CommitteeS. Autexier (DFKI & U Saarbrücken)G. Barthe (IMDEA Software, Madrid) P. Baumgartner (National ICT Australia) B. Dutertre (SRI International) R. Hähnle (Chalmers U, Gothenburg) A. Ireland (Heriot-Watt U, Edinburgh) J. Kiniry (U Dublin) H. Mantel (TU Darmstadt) S. Merz (INRIA Lorraine) C. Morgan (U of New South Wales) P. Müller (Microsoft Research) M. Norrish (National ICT Australia) W. Paul (U Saarbrücken) L. Paulson (U of Cambridge) W. Reif (U of Augsburg) W. Schulte (Microsoft Research) J. Schumann (NASA Ames Research Center) L. Viganò (U of Verona) T. Walsh (National ICT Australia) C. Walther (TU Darmstadt)
Steering CommitteeS. Autexier (DFKI & U Saarbrücken)H. Mantel (TU Darmstadt)
Call for papersPDF - ASCII
Important dates
Previous VERIFY workshops
ContactIf you need further information do not hesitateto contact us by sending an e-mail to beckert@uni-koblenz.de and/or gerwin.klein@nicta.com.au |
Proceedings available online at CEUR-WS.org Workshop Schedule and Programme
The formal verification of critical information systems has a long tradition as one of the main areas of application for automated theorem proving. Nevertheless, the area is of still growing importance as the number of computers affecting everyday life and the complexity of these systems are both increasing. The purpose of the VERIFY workshop series is to discuss problems arising during the formal modeling and verification of information systems and to investigate suitable solutions. Possible perspectives include those of automated theorem proving, tool support, system engineering, and applications. For automated theorem proving, each verification project is the source of numerous deduction problems that are not only interesting and challenging, but also of practical relevance. On the one hand, such proof obligations can serve as examples for experimenting with general-purpose deduction techniques and tools. On the other hand, deduction techniques can be tailored to typical classes of verification problems. Tool support is essential in order to deal with the numerous proof obligations arising in practical verifications. In particular, powerful theorem provers are required to provide a high degree of automation. Moreover, tool support is also necessary for making the development of large specifications feasible, for keeping ongoing developments in a consistent state, and for supporting the reuse of previously constructed specifications and proofs. Often, satisfactory tool support can only be achieved by combining different systems. Engineering techniques are needed for making the formal modeling and analysis of complex information systems feasible. Specifications become more manageable when being developed in a modular fashion and on different levels of abstraction. When a well-defined engineering process is applied, verification techniques can be tailored to the deduction problems that typically originate from this process. Applications include the verification of functional properties, of safety properties, of security properties, and of fault tolerance. Evaluation criteria like the Common Criteria, for instance, require the construction of formal security models that constitute a basis for a formal verification. Verification case studies are necessary for evaluating the feasibility of verification techniques in practice. The VERIFY workshop series aims at bringing together people who are interested in the development of safety and security critical systems, in formal methods, in the development of automated theorem proving techniques, and in the development of tool support. Practical experiences gained in realistic verifications are of interest to the automated theorem proving community and new theorem proving techniques should be transferred into practice. The overall objective of the VERIFY workshops is to identify open problems and to discuss possible solutions under the theme The scope of VERIFY includes topics such as
SubmissionSubmissions are encouraged in one of the following two categories:
Submission of papers is via EasyChair. Each accepted paper shall be presented at the workshop and at least one author of each paper shall attend the workshop. For each presentation there will be 30 minutes (including discussion) where, for discussion papers, 15 minutes shall be reserved for discussion. In addition, the program might include invited talks and/or discussion panels. Workshop proceedingsThe workshop proceedings will be distributed at the workshop as a collection of the accepted papers; they will also be made available as CEUR Workshop Proceedings. Final versions of accepted papers have to be prepared with LaTeX. |