## Annalisa Bossi

*Selected Papers of the Ninth International Workshop on Logic Programming Synthesis and Transformation*

LOPSTR, 1999.

@proceedings{LOPSTR-1999, address = "Venezia, Italy", editor = "Annalisa Bossi", isbn = "3-540-67628-7", publisher = "{Springer-Verlag}", series = "{Lecture Notes in Computer Science}", title = "{Selected Papers of the Ninth International Workshop on Logic Programming Synthesis and Transformation}", volume = 1817, year = 1999, }

### Contents (17 items)

- LOPSTR-1999-Sannella #algebra #development #refinement #specification
- Algebraic Specification and Program Development by Stepwise Refinement (DS), pp. 1–9.
- LOPSTR-1999-DucasseR #consistency #formal method #proving
- Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency (MD, LR), pp. 10–29.
- LOPSTR-1999-Fribourg #constraints #logic programming #model checking
- Constraint Logic Programming Applied to Model Checking (LF), pp. 30–41.
- LOPSTR-1999-FilipeLOY #aspect-oriented #component #development #framework #logic #object-oriented #on the
- On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic (JKF, KKL, MO, HY), pp. 42–61.
- LOPSTR-1999-LeuschelM #abstract interpretation #infinity #model checking
- Infinite State Model Checking by Abstract Interpretation and Program Specialisation (ML, TM), pp. 62–81.
- LOPSTR-1999-SmausHK #analysis #logic programming #source code
- Mode Analysis Domains for Typed Logic Programs (JGS, PMH, AK), pp. 82–101.
- LOPSTR-1999-PeraltaG #approach #imperative #using
- Imperative Program Specialisation: An Approach Using CLP (JCP, JPG), pp. 102–117.
- LOPSTR-1999-HoweK #source code #using
- Specialising Fininte Domain Programs Using Polyhedra (JMH, AK), pp. 118–135.
- LOPSTR-1999-LammelRL
- Roles of Program Extension (RL, GR, WL), pp. 136–155.
- LOPSTR-1999-BossiCE #source code
- Transformation of Left Terminating Programs (AB, NC, SE), pp. 156–175.
- LOPSTR-1999-PettorossiP #logic programming #source code
- Transformation Rules for Logic Programs with Goals as Arguments (AP, MP), pp. 176–195.
- LOPSTR-1999-RossOS #recursion #source code
- Making Mercury Programs Tail Recursive (PR, DO, ZS), pp. 196–215.
- LOPSTR-1999-BertolinoEP #source code
- The Replacement Operation for CCP Programs (MB, SE, CP), pp. 216–233.
- LOPSTR-1999-Kulas #concept #prolog #runtime
- Annotations for Prolog — A Concept and Runtime Handling (MK), pp. 234–254.
- LOPSTR-1999-MetayerNR #recursion #testing #verification
- Verification by Testing for Recursive Program Schemes (DLM, VAN, OR), pp. 255–272.
- LOPSTR-1999-PueblaBH #constraints #debugging #logic programming #source code
- Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs (GP, FB, MVH), pp. 273–292.
- LOPSTR-1999-Giesl #verification
- Context-Moving Transformations for Function Verification (JG), pp. 293–312.

7 ×#source code

4 ×#logic programming

2 ×#constraints

2 ×#development

2 ×#model checking

2 ×#recursion

2 ×#using

2 ×#verification

4 ×#logic programming

2 ×#constraints

2 ×#development

2 ×#model checking

2 ×#recursion

2 ×#using

2 ×#verification