11. ICLP 1994, Workshop W2: Verification and Analysis of (Concurrent) Logic Languages

Organizer

• F. S. de Boer, Free University Amsterdam, The Netherlands
• M. Gabbrielli, Universit` di Pisa

Contacts

Frank S. de Boer
Free University
de Boelelaan 1081
1081 HV Amsterdam, The Netherlands
E-mail: frankb@cs.vu.nl

This workshop aims at a discussion of the analysis and correctness of logic programs and their concurrent (constraint) extensions. More specifically, we are interested in proof methods based on abstract interpretation and the applicability of methods developed in different programming paradigms, like process algebras, Hoare logics, etc. The workshop also includes discussion of techniques for the development of (concurrent) logic programs.

Verification of Logic Programs

• Livio Colussi, Elena Marchiori, Massimo Marchiori: Combining Logic and Control to Characterize Global Invariants of Prolog Programs.
• Eric Vetillard: Constraint Logic Programs with Declarations: Theory and Implementation.
• Paolo Mascellani, Dino Pedreschi: Total correctness of logic and pure Prolog programs.
• Salvatore Ruggieri: Proving (total) correctness of Prolog programs.

Verification of Concurrent Constraint Programs

• Pascal Chambre, Pierre Deransart: Towards a Proof method of Non-Suspension of Concurrent Constraint Logic Programs.
• Jörg Würtz: Towards the Verification of Concurrent Constaint Programs in the Field of Finite Domain Reasoning. 87-107
• Frank de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi: Proving correctness of Concurrent Constraint Programs.

Abstract Interpretation I

• Enea Zaffanella, Giorgio Levi, Roberto Giacobazzi: Abstracting Synchronization in Concurrent Constraint Programming.
• Moreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi: Denotational semantics for Concurrent Constraint Programs analyses.
• Roberto Giacobazzi: On the Collecting Semantics for Logic Programs.
• Dmitri Boulanger, Maurice Bruynooghe: Abstract Domains: a Model-Theoretic approach.

Abstract Interpretation II

• Michael Codish, Bart Demoen: Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of Prop.
• Maurice Bruynooghe, Michael Codish, Anne Mulkers: Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program Variables.
• Roberto Bagnara: On the Detection of Implicit and Redundant Numeric Constraints in CLP Programs.
• J.-M. Jacquet: Verifying Logic Programs from Metric Semantics.
• Michel Bergere, Gerard Ferrand, Jeam-Hugues Rety: Indipendence of the Computation Rule for SLD-derivation with delay.