Donald Sannella (auth.), Annalisa Bossi (eds.)3540676287, 9783540676287
This volume contains the proceedings of the ninth international workshop on logic-based program synthesis and transformation (LOPSTR’99) which was held in Venice (Italy), September 22-24, 1999. LOPSTRistheannualworkshopandforumforresearchersinthelogic-based program development stream of computational logic. The main focus used to be on synthesis and transformation of logic programs, but the workshop is open to contributions on logic-based program development in any paradigm. Previous workshops were held in Manchester, UK (1991, 1992), Louvain-la-Neuve, B- gium (1993), Pisa, Italy (1994), Arnhem, The Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), and Manchester, UK (1998). LOPSTR is a real workshop in the sense that it is a friendly and lively forum for presenting recent and current research as well as discussing future trends. Formal proceedings of the workshop are produced only after the workshop and contain only those papers selected by the program committee after a second refereeing process. The program committee of LOPSTR’99 accepted 20 extended abstracts for presentation at the workshop; then selected 14 papers for inclusion in the po- workshop proceedings. Selected papers cover all the main streams of LOPSTR’s topics: synthesis, specialization, transformation, analysis, and veri?cation. Ve- ?cation, transformation, and specialization methods are applied to functional, constraint, logic, and imperative programming. |
Table of contents :
Front Matter….Pages –
Algebraic Specification and Program Development by Stepwise Refinement….Pages 1-9
Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency….Pages 10-29
Constraint Logic Programming Applied to Model Checking….Pages 30-41
On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic….Pages 42-61
Infinite State Model Checking by Abstract Interpretation and Program Specialisation….Pages 62-81
Mode Analysis Domains for Typed Logic Programs….Pages 82-101
Imperative Program Specialisation: An Approach Using CLP….Pages 102-117
Specialising Finite Domain Programs Using Polyhedra….Pages 118-135
Roles of Program Extension….Pages 136-155
Transformation of Left Terminating Programs….Pages 156-175
Transformation Rules for Logic Programs with Goals as Arguments….Pages 176-195
Making Mercury Programs Tail Recursive….Pages 196-215
The Replacement Operation for CCP Programs….Pages 216-233
Annotations for Prolog – A Concept and Runtime Handling….Pages 234-254
Verification by Testing for Recursive Program Schemes….Pages 255-272
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs….Pages 273-292
Context-Moving Transformations for Function Verification….Pages 293-312
Back Matter….Pages – |
Reviews
There are no reviews yet.