|
Conferences in DBLP
- Donald Sannella
Algebraic Specification and Program Development by Stepwise Refinement. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:1-9 [Conf]
- Mireille Ducassé, Laurence Rozé
Proof Obligations of the B Formal Method: Local Proofs Ensure Global Consistency. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:10-29 [Conf]
- Laurent Fribourg
Constraint Logic Programming Applied to Model Checking. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:30-41 [Conf]
- Juliana Küster Filipe, Kung-Kiu Lau, Mario Ornaghi, Hirokazu Yatsu
On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:42-61 [Conf]
- Michael Leuschel, Thierry Massart
Infinite State Model Checking by Abstract Interpretation and Program Specialisation. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:62-81 [Conf]
- Jan-Georg Smaus, Patricia M. Hill, Andy King
Mode Analysis Domains for Typed Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:82-101 [Conf]
- Julio C. Peralta, John P. Gallagher
Imperative Program Specialisation: An Approach Using CLP. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:102-117 [Conf]
- Jacob M. Howe, Andy King
Specialising Fininte Domain Programs Using Polyhedra. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:118-135 [Conf]
- Ralf Lämmel, Günter Riedewald, Wolfgang Lohmann
Roles of Program Extension. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:136-155 [Conf]
- Annalisa Bossi, Nicoletta Cocco, Sandro Etalle
Transformation of Left Terminating Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:156-175 [Conf]
- Alberto Pettorossi, Maurizio Proietti
Transformation Rules for Logic Programs with Goals as Arguments. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:176-195 [Conf]
- Peter Ross, David Overton, Zoltan Somogyi
Making Mercury Programs Tail Recursive. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:196-215 [Conf]
- Marco Bertolino, Sandro Etalle, Catuscia Palamidessi
The Replacement Operation for CCP Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:216-233 [Conf]
- Marija Kulas
Annotations for Prolog - A Concept and Runtime Handling. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:234-254 [Conf]
- Daniel Le Métayer, Valérie-Anne Nicolas, Olivier Ridoux
Verification by Testing for Recursive Program Schemes. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:255-272 [Conf]
- Germán Puebla, Francisco Bueno, Manuel V. Hermenegildo
Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:273-292 [Conf]
- Jürgen Giesl
Context-Moving Transformations for Function Verification. [Citation Graph (0, 0)][DBLP] LOPSTR, 1999, pp:293-312 [Conf]
|