Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-11T07:26:52.948Z Has data issue: false hasContentIssue false
  • English
  • Français

Special issue on ‘Program development’

Published online by Cambridge University Press:  26 July 2002

MAURICE BRUYNOOGHE  and
KUNG-KIU LAU
MAURICE BRUYNOOGHE
Affiliation:
Katholieke Universiteit Leuven, Department of Computer Science, Celestijnenlaan 200A, B 3001 Heverlee Belgium (e-mail: Maurice.Bruynooghe@cs.kuleuven.ac.be)
KUNG-KIU LAU
Affiliation:
University of Manchester, Department of Computer Science, Oxford Road, Manchester M13 9PL, UK (e-mail: kung-kiu@cs.man.ac.uk)
Get access Rights & Permissions [Opens in a new window]

Abstract

This special issue marks the tenth anniversary of the LOPSTR workshop. LOPSTR started in 1991 as a workshop on Logic Program Synthesis and Transformation, but later it broadened its scope to logic-based Program Development in general.

The motivating force behind LOPSTR has been a belief that declarative paradigms such as logic programming are better suited to program development tasks than traditional non-declarative ones such as the imperative paradigm. Specification, synthesis, transformation or specialisation, analysis, verification and debugging can all be given logical foundations, thus providing a unifying framework for the whole development process.

In the past ten years or so, such a theoretical framework has indeed begun to emerge. Even tools have been implemented for analysis, verification and specialisation. However, it is fair to say that so far the focus has largely been on programming-in-the-small. So the future challenge is to apply or extend these techniques to programming-in-the-large, in order to tackle software engineering in the real world.

Type
Research Article
Information
Theory and Practice of Logic Programming , Volume 2 , Issue 4-5 , July 2002 , pp. 423 - 424
Copyright
© 2002 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)