FLOC'99

FLoC'99

THE 1999 FEDERATED LOGIC CONFERENCE

July 2 -10, 1999
Trento, Italy

Affiliated Workshops


  1. Implicit computational complexity
    Organizers: Anuj Dawar and Daniel Leivant
    Description

  2. Symbolic Model Checking
    Organizers: Alessandro Cimatti and Orna Grumberg
    Description

  3. Run-Time Result Verification
    Organizers: Amir Pnueli and Paolo Traverso
    Description

  4. Workshop on Security Protocol Verification
    Organizers: Edmund Clarke and Nevin Heintze
    Description

  5. Intuitionistic Modal Logics and Applications
    Organizers: Matt Fairtlough and Michael Mendler
    Description

  6. Strategies in Automated Deduction
    Organizers: Bernhard Gramlich, Helene Kirchner, and Frank Pfenning,
    Description

  7. CALCULEMUS - Systems for Integrated Computation and Deduction
    Organizers: Alessandro Armando and Tudor Jebelean
    Description

  8. Grobner bases and rewriting techniques
    Organizers: Klaus Madlener, Susan Hermiller, Ben Keller, and Birgit Reinert
    Description

  9. The Second International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs
    Organizers: L. Cardelli, T. Hardin, F. Kamareddine, D. Kesner, S. Nishizaki, and V. de Paiva
    Description

  10. A Tutorial Workshop on Realizability Semantics
    Organizers: D. Scott, G. Rosolini, A. Pitts, A. Simpson, J. van Oosten, G. Longo, B. Reus, D. Normann
    Description

  11. ERCIM WG on Formal Methods for Industrial Critical Systems
    Organizers:Diego Latella and Stefania Gnesi
    Description

  12. Complexity-theoretic and Recursion-theoretic methods in Databases, Artificial Intelligence and Finite Model Theory
    Organizers: T. Eiter, G. Gottlob, V.W. Marek, J.B. Remmel
    Description

  13. Automation of Proofs by Mathematical Induction
    Organizers: Dieter Hutter, Alan Bundy, Fausto Giunchiglia, and Andrew Ireland
    Description

  14. Finite Model Theory And Its Applications
    Organizers: Michael Benedikt, Leonid Libkin, and Jouko Vaananen
    Description

Note: Workshops #1, #12 and #14 will have a joint afternoon session of invited speakers on June 30, 1999.


Workshop Descriptions
  1. Implicit computational complexity


  2. Symbolic Model Checking


  3. Run-Time Result Verification


  4. Workshop on Security Protocol Verification


  5. Intuitionistic Modal Logics and Applications

    Intuitionistic and modal logics are of foundational relevance to Computer Science and both have led to successful applications in the formal specification and verification of computer systems. The intuitionistic and the modal frameworks are usually investigated separately. However, a growing body of published work, stimulated by theoretical considerations and fed by various applications in Computer Science, shows that both paradigms may fruitfully be merged. Intuitionistic Modal Logic (IML) and associated theories can exploit both the proof-theoretic strengths of intuitionistic logic and the model-theoretic features of modal logics. The potential and the challenge of IML both lie in finding a satisfactory combination of its intensional and its extensional aspects. We intend the workshop to seed a more concerted organisation of the ongoing research in the area of IML, bringing together the method-oriented and the problem-oriented approaches on the one hand, and the proof-theoretic and model-theoretic ones on the other. This will create fruitful research stimuli through the friction between engineering applications and pure theory, and between intensional and extensional lines of thinking.


  6. Strategies in Automated Deduction


  7. CALCULEMUS - Systems for Integrated Computation and Deduction

    Both Deduction Systems and Computer Algebra Systems are receiving growing attention from industry and academia. On the one hand, Mathematical Software Systems have been commercially very successful. Their use is now wide-spread in industry, education, and scientific contexts: there are now literally millions of installations of computer algebra programs. On the other hand, the use of formal methods in hardware and software development has made Deduction Systems indispensable not least because of the complexity and sheer size of the reasoning tasks involved. In spite of these successes there is still need for improvement as many application domains still fall outside the scope of existing Deduction Systems and Computer Algebra Systems. The workshop is intended for researchers and developers interested in combining the reasoning capabilities of Deduction Systems and the computational power of CASs. A key issue is whether existing systems and technologies can be integrated as they stand or if a fundamental redesign will be necessary. Contributions addressing this specific problem will be considered of special interest.


  8. Grobner bases and rewriting techniques

    The goal of this workshop is to emphasize and exploit the connections between Groebner bases and rewrite systems at the levels of theory, implementation and application. Of particular interest are the connections between Groebner bases in noncommutative rings and rewrite systems over strings. Participants from both the Groebner basis and rewriting communities will be invited to discuss current research. The workshop will consist of several sessions begun with presentation of a position paper followed by open discussion of the topic. Position papers, open problems and other participant contributions will be published on the world wide web as a resource for future research.


  9. The Second International Workshop on Explicit Substitutions: Theory and Applications to Programs and Proofs

    The aim of this one-day workshop is to bring together researchers working on both the theoretical and applied aspects of explicit substitutions, to present recent work (possibly still in progress), and to discuss new ideas as well as emerging trends in the subject. A special issue of MCSC dedicated to this workshop is planned.


  10. A Tutorial Workshop on Realizability Semantics


  11. ERCIM WG on Formal Methods for Industrial Critical Systems

    The aim of the FMICS workshops is to provide a forum mainly intended for, but not limited to, researchers of ERCIM sites who are interested in the development and application of formal methods in industry. In particular, these workshops should bring together scientists that are active in the area of formal methods and interested in exchanging their experiences in the industrial usage of these methods. They also aim at the promotion of research and development for the improvement of formal methods and tools for industrial applications.

    The First International Workshop on Formal Methods for Industrial Critical Systems took place in Oxford on March 19, 1996. The second edition was held in Cesena on July 4-5, 1997. The third edition was held in Amsterdam on May 25-26, 1998.


  12. Complexity-theoretic and Recursion-theoretic methods in Databases, Artificial Intelligence and Finite Model Theory


  13. Automation of Proofs by Mathematical Induction


  14. Finite Model Theory And Its Applications

    The interactions between finite model theory and computer science have expanded both in depth and in scope in recent years. Well-established connections, such as those between finite model theory and complexity theory and with relational databases, remain extremely fruitful. In addition, there are newer connections, such as those between finite model theory and verification, between finite model theory and linguistics, and between finite model theory and new database models (e.g. spatial and temporal databases). The goal of this one-day informal workshop is both to allow established researchers in the field of finite model theory to share contributions, and to introduce these new developments to a wide audience. The workshop will aim for invited talks of an expository nature, covering new developments and new applications; these talks will be aimed for a FLOC-wide audience. It will also seek contributions geared for those within the finite model theory community.

_________________________________
Leonid Libkin (libkin@bell-labs.com)