Symposium on the Effectiveness of Logic in Computer Science in Honour of Moshe Vardi
Technical report MPI-I-2002-2-007
Witold Charatonik and Harald Ganzinger (Eds.)
March 2002, 63 pages
Abstract:
This report contains abstracts of the talks given at the Symposium
on the Effectiveness of Logic in Computer Science in Saarbrücken on
March 4-6, 2002. The symposium was held in honour of Professor Moshe
Vardi, Rice University, on the ocasion of awarding him a Honorary
Doctoral Degree from the Saarland University for his outstanding
contributions to the area of Logic in Computer Science.
Contents:
- Cover pages and abstracts of invited talks
- Poster presentations
- Recursive resolution for modal
logic by Yevgeny Kazakov, pages 11-15.
- Dynamic discovery of e-services: a
Description Logics based approach by Christophe Rey,
pages 17-21.
- Verification of Security
Protocols by Yannick Chevalier, pages 23-25.
- Is Logic Effective for
Analyzing C Programs? by Thomas Hillenbrand, Andreas
Podelski and Dalibor Topic, pages 27-30.
- Formal Verification of the VAMP
Microprocessor Project Status by Christoph Berg, Sven
Beyer, Christian Jacobi, Daniel Kröning and Dirk
Leinenbach, pages 31-36.
- Interesting Examples for the
Approach of Feder and Vardi to classify CSP by Manuel
Bodirsky, pages 37-42. Withdrawn by the author.
- Recursive Tarskian Set
Constraints without Functions (extended abstract) by
Tomasz Charatonik and Leszek Pacholski, pages 43-47.
- An ASM Specification of the XPDL
Language Semantics by Petr Matousek, pages 49-53.
- A Framework for Circular
Assume-Guarantee Rules by Patrick Maier, pages 55-58.
- Formal Verification in an Industrial
Context by Carsten Sinz, pages 59-63.
Witold Charatonik
Last modified: Tue Apr 30 10:18:39 MEST 2002