LOPSTR`01 TECHNICAL PROGRAMME ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^ WEDNESDAY, Nov. 28th ^^^^^^^^^^^^^^^^^^^^ 09.00 CP Invited talk What I foresee for 4C. Eugene Freuder, Cork Constraint Computation Center 10.30 Coffee 11.00 LOPSTR Opening LOPSTR Session: Program Transformation and Equivalence A Transformation Technique for Datalog Programs based on Non-deterministic Constructs P. Potikas, P. Rondogiannis, M. Gergatsoulis On Deforesting Parameters of Accumulating Maps K. Kakehi, R. Glueck, Y. Futamura Equivalence in Answer Set Programming M. Osorio, J.A. Navarro, J. Arrazola 12.30 Lunch 13.45 Excursion: Aphrodite's Trail Performance by the Cyprus Orchestra of Ancient Greek Musical Organs Light Dinner THURSDAY, Nov. 29th ^^^^^^^^^^^^^^^^^^^ 09.00 LOPSTR Invited Talk Generating Efficient Code from Logic Natarajan Shankar, SRI, Menlo Park, CA, USA 10.30 Coffee 11.00 LOPSTR Session: Verification Transforming a Proof System into Prolog for Verifying Security Protocols G. Delzanno, S. Etalle Abstract Partial Deduction using Regular Types and its Application to Model Checking M. Leuschel, S. Gruner Verification of Sets of Infinite State Processes Using Program Transformation F. Fioravanti, A. Pettorossi, M. Proietti 12.45 Lunch 14.30 ICLP Invited Talk X-tegration - some cross-enterprise thoughts Ashish Gupta (Chief Scientific Officer, Tavant Technologies) 16.00 Coffee 16.30 LOPSTR Session: Program Analysis When Size Does Matter W. Vanhoof, M. Bruynooghe Source-Level Abstract Profiling for Multi-Paradigm Declarative Languages E. Albert, G. Vidal 18.30 Conference Dinner at the wine village of Polemi (Cypriot Night) FRIDAY, Nov. 30th ^^^^^^^^^^^^^^^^^ 09.00 CP Invited talk Towards theoretical frameworks for comparing constraint satisfaction models and algorithms Peter van Beek, University of Waterloo 10.30 Coffee 11.00 LOPSTR Session: Program Development Towards Correct Object-Oriented Systems in Computational Logic K.-K. Lau, M. Ornaghi The Principles of a Toolbox for the Implementation of Customized Logics S. Ferre', O. Ridoux Environment-aware Computations via Program Updates J.J. Alferes, A. Brogi, J.A. Leite, L.M. Pereira 12.45 Lunch 14.00 Invited Talk Alain Colmerauer (University of Marseille, France) Solving the mutiplication constraint in several approximation spaces 15.30 Coffee 16.00 LOPSTR Session: Program Synthesis Extracting Recursion Operators in Nuprl's Type Theory J. Caldwell Extracting Exact Time Bounds from Logical Proofs M. Ferrari, C. Fiorentini, M. Ornaghi 17.30 Joint CP & ICLP Panel "The future of LP and CP Systems"