Abstract is missing.
- Verifying Logic Programs from Metric SemanticsJean-Marie Jacquet.
- Proving correctness of Concurrent Constraint ProgramsFrank S. de Boer, Maurizio Gabbrielli, Elena Marchiori, Catuscia Palamidessi.
- Denotational semantics for Concurrent Constraint Programs analysesMoreno Falaschi, Maurizio Gabbrielli, Kim Marriott, Catuscia Palamidessi.
- Abstracting Synchronization in Concurrent Constraint ProgrammingEnea Zaffanella, Giorgio Levi, Roberto Giacobazzi.
- Indipendence of the Computation Rule for SLD-derivation with delayMichel Bergère, Gérard Ferrand, Jean-Hugues Réty.
- Abstract Unification for a Composite Domain Deriving Sharing and Freeness Properties of Program VariablesMaurice Bruynooghe, Michael Codish, Anne Mulkers.
- Deriving Polymorphic Type Dependencies for Logic Programs Using Multiple Incarnations of PropMichael Codish, Bart Demoen.
- Towards a Proof method of Non-Suspension of Concurrent Constraint Logic ProgramsPascal Chambre, Pierre Deransart.
- On the Collecting Semantics for Logic ProgramsRoberto Giacobazzi.
- Total correctness of logic and pure Prolog programsPaolo Mascellani, Dino Pedreschi.
- Proving (total) correctness of Prolog programsSalvatore Ruggieri.
- Combining Logic and Control to Characterize Global Invariants of Prolog ProgramsLivio Colussi, Elena Marchiori, Massimo Marchiori.
- Abstract Domains: a Model-Theoretic approachDmitri Boulanger, Maurice Bruynooghe.
- Constraint Logic Programs with Declarations: Theory and ImplementationEric Vétillard.
- On the Detection of Implicit and Redundant Numeric Constraints in CLP ProgramsRoberto Bagnara.
- Towards the Verification of Concurrent Constaint Programs in the Field of Finite Domain ReasoningJörg Würtz. 87-107