LOPSTR 2001 

Eleventh International Workshop on
Logic-based Program Synthesis and Transformation


November 28 - 30, 2001

Paphos, Cyprus


LOPSTR 2001 is co-located with the 17th International Conference on Logic Programming (ICLP 2001) and the  7th International  Conference on Principle and Practice of  Constraint Programming (CP 2001). Joint events and reduced joint registration are planned.


The aim of the LOPSTR  workshops is to stimulate and promote international research and collaboration on logic-based program development, and the workshop is open to contributions in logic-based program development in any language paradigm. Past workshops were held in Manchester, UK (1991, 1992, 1998), Louvain-la-Neuve, Belgium (1993), Pisa, Italy (1994), Arnhem, the Netherlands (1995), Stockholm, Sweden (1996), Leuven, Belgium (1997), Venice, Italy (1999), London, UK (2000).

LOPSTR also aims to be a lively, friendly forum for presenting and discussing work in progress, so it is a real workshop in the sense that it is also intended to provide useful feedback to authors on their preliminary research. Formal proceedings of the workshop are produced only after the workshop, so that authors can incorporate this feedback in the published papers.


Scope of the Workshop

We solicit extended abstracts describing work in progress. Topics of interest cover all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large.

The following is a non-exhaustive list of topics:
  • specification
  • synthesis
  • verification
  • transformation
  • specialisation
  • analysis
  • optimisation
  • composition
  • reuse
  • applications
  • component-based software development
  • software architectures
  • design patterns and frameworks


Submission Guidelines

  • Authors should submit extended abstracts describing work in progress. Extended abstracts should be written in English and should not exceed 8 pages in llncs format. Abstracts should be submitted electronically in Postscript format to the program chairman at the following email address: adp@iasi.rm.cnr.it.  The submission deadline is September 24, 2001.
  • Promising abstracts relevant to the scope of LOPSTR will be selected for presentation at the workshop. The notification of acceptance or rejection will be sent by October 5, 2001. Accepted abstracts will be collected in informal pre-proceedings which will be available at the workshop. Perspective authors who have difficulties for the electronic submission may contact the chairman.
  • After the workshop, authors of work which is judged mature for publication will be invited to submit full papers. These will be reviewed according to the usual refereeing procedures, and accepted papers will be published in the formal proceedings of the workshop which will be published in the Lecture Notes in Computer Science series by Springer-Verlag.

  •  


    Organizers

  • Programme Chair

  • Alberto Pettorossi, University of Rome Tor Vergata
    c/o  IASI-CNR
    Viale Manzoni, 30
    I-00185 Roma, Italy
    Phone: +39 - 06 7716 427 or +39 - 06 7716 426
    Fax: +39 - 06 7716 461
    Email: adp@iasi.rm.cnr.it
     
     
  • Organizing Committee

  • Fabio Fioravanti (IASI-CNR, Roma, Italy), Antonis Kakas (University of Cyprus, Cyprus), Alberto Pettorossi (University of Rome Tor Vergata, Italy), Maurizio Proietti (IASI-CNR, Roma, Italy)
     
     
  • Programme Committee

  • Venue

    The conference will be held in the Coral Beach Hotel and Resort in an idyllic beachfront setting near to the town of Paphos. Paphos is included in the official UNESCO list of cultural and natural treasures of world heritage, and is described as "... Home To Aphrodite, Adonis, Dionysus, and Lucky Mortals".


    Technical Programme  (download)

    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
         Solving the mutiplication constraint in several approximation spaces
          Alain Colmerauer (University of Marseille, France)

    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"


    Important Dates

    Submission of extended abstracts: September 24, 2001
    Notification of acceptance/rejection:  October 5, 2001
    Workshop:  November 28 - 30, 2001