1 The tenth anniversary of the LOPSTR symposium provided the incentive for this volume. LOPSTR started in 1991 as a workshop on logic program synthesis and transformation, but later it broadened its scope to logic-based program development in general, that is, program development in computational logic, and hence the title of this volume. The motivating force behind LOPSTR has been the belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Speci?cation, synthesis, transformation or specialization, analysis, debugging and veri?cation can all be given logical foundations, thus providing a unifying framework for the whole development process. In the past 10 years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, veri?cation and speci- ization. However,itisfairtosaythatsofarthefocushaslargelybeenonprogrammi- in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world. Returning to this volume, our aim is to present a collection of papers that re?ect signi?cant research e?orts over the past 10 years. These papers cover the wholedevelopmentprocess:speci?cation,synthesis,analysis,transformationand specialization, as well as semantics and systems.
Author(s): Kung-Kiu Lau, Mario Ornaghi (auth.), Maurice Bruynooghe, Kung-Kiu Lau (eds.)
Series: Lecture Notes in Computer Science 3049
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2004
Language: English
Pages: 539
Tags: Logics and Meanings of Programs; Programming Techniques; Mathematical Logic and Formal Languages; Artificial Intelligence (incl. Robotics); Software Engineering; Programming Languages, Compilers, Interpreters
Front Matter....Pages -
Specifying Compositional Units for Correct Program Development in Computational Logic....Pages 1-29
Synthesis of Programs in Computational Logic....Pages 30-65
Developing Logic Programs from Specifications Using Stepwise Refinement....Pages 66-89
Declarative Semantics of Input Consuming Logic Programs....Pages 90-114
On the Semantics of Logic Program Composition....Pages 115-151
Analysing Logic Programs by Reasoning Backwards....Pages 152-188
Binding-Time Analysis for Mercury....Pages 189-232
A Generic Framework for Context-Sensitive Analysis of Modular Programs....Pages 233-260
Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems....Pages 261-290
Transformation Rules for Locally Stratified Constraint Logic Programs....Pages 291-339
Specialising Interpreters Using Offline Partial Deduction....Pages 340-375
Characterisations of Termination in Logic Programming....Pages 376-431
On the Inference of Natural Level Mappings....Pages 432-452
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach....Pages 453-498
Herbrand Constraints in HAL....Pages 499-538
Back Matter....Pages -