Logic-based program synthesis and transformation : 9th International Workshop, LOPSTR 99, Venice, Italy, September 22-24, 1999 : selected papers
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 computationa...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
1817 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Logic-based program synthesis and transformation, 9th International Workshop, LOPSTR '99, Venice, Italy, September 1999, selected papers, Annalisa Bossi (ed.), Berlin, Springer, 2000, 1 vol. (VIII-312 p.), Lecture notes in computer science, 3-540-67628-7 • Logic-Based Program Synthesis and Transformation, Texte imprimé, 9783662170465 |
Inhaltsangabe:
- Invited Talk
- Algebraic Specification and Program Development by Stepwise Refinement
- Tutorials
- Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency
- Constraint Logic Programming Applied to Model Checking
- Software Development
- On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic
- Analysis and Specialisation
- Infinite State Model Checking by Abstract Interpretation and Program Specialisation
- Mode Analysis Domains for Typed Logic Programs
- Imperative Program Specialisation: An Approach Using CLP
- Specialising Finite Domain Programs Using Polyhedra
- Transformation
- Roles of Program Extension
- Transformation of Left Terminating Programs
- Transformation Rules for Logic Programs with Goals as Arguments
- Making Mercury Programs Tail Recursive
- The Replacement Operation for CCP Programs
- Verification
- Annotations for Prolog A Concept and Runtime Handling
- Verification by Testing for Recursive Program Schemes
- Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs
- Context-Moving Transformations for Function Verification.