Abstract is missing.
- Algebraic Specification and Program Development by Stepwise RefinementDonald Sannella. 1-9
- Proof Obligations of the B Formal Method: Local Proofs Ensure Global ConsistencyMireille Ducassé, Laurence Rozé. 10-29
- Constraint Logic Programming Applied to Model CheckingLaurent Fribourg. 30-41
- On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational LogicJuliana Küster Filipe, Kung-Kiu Lau, Mario Ornaghi, Hirokazu Yatsu. 42-61
- Infinite State Model Checking by Abstract Interpretation and Program SpecialisationMichael Leuschel, Thierry Massart. 62-81
- Mode Analysis Domains for Typed Logic ProgramsJan-Georg Smaus, Patricia M. Hill, Andy King. 82-101
- Imperative Program Specialisation: An Approach Using CLPJulio C. Peralta, John P. Gallagher. 102-117
- Specialising Fininte Domain Programs Using PolyhedraJacob M. Howe, Andy King. 118-135
- Roles of Program ExtensionRalf Lämmel, Günter Riedewald, Wolfgang Lohmann. 136-155
- Transformation of Left Terminating ProgramsAnnalisa Bossi, Nicoletta Cocco, Sandro Etalle. 156-175
- Transformation Rules for Logic Programs with Goals as ArgumentsAlberto Pettorossi, Maurizio Proietti. 176-195
- Making Mercury Programs Tail RecursivePeter Ross, David Overton, Zoltan Somogyi. 196-215
- The Replacement Operation for CCP ProgramsMarco Bertolino, Sandro Etalle, Catuscia Palamidessi. 216-233
- Annotations for Prolog - A Concept and Runtime HandlingMarija Kulas. 234-254
- Verification by Testing for Recursive Program SchemesDaniel Le Métayer, Valérie-Anne Nicolas, Olivier Ridoux. 255-272
- Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic ProgramsGermán Puebla, Francisco Bueno, Manuel V. Hermenegildo. 273-292
- Context-Moving Transformations for Function VerificationJürgen Giesl. 293-312