Skip to main content

Expressing program requirements using refinement lattices

  • Logic for Artificial Intelligence III
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 689))

Abstract

Requirements capture is a term used in software engineering, referring to the process of obtaining a problem description—a high level account of the problem which a user wants to solve. This description is then used to control the generation of a program appropriate to the solution of this problem. Reliable requirements capture is seen as a key component of future automated program construction systems, since even small amounts of information about the type of problem being tackled can often vastly reduce the space of appropriate application programs. Many special purpose requirements capture systems exist but few of these are logic based and all of them operate in tightly constrained domains. This paper introduces a formal language for requirements capture which bridges the gap between an order sorted logic of problem description and the Prolog programming language. An extended version of this paper appears in [4].

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Bundy and M. Uschold. The use of typed lambda calculus for requirements capture in the domain of ecological modelling. Research Paper 446, Dept. of Artificial Intelligence, Edinburgh, 1989.

    Google Scholar 

  2. J. Levy, J. Agusti, F. Esteva, and P. Garcia. An ideal model of an extended lambda-calculus with refinement. Ecs-lfcs-91-188, Laboratory for the Foundations of Computer Science, 1991.

    Google Scholar 

  3. D. McAllester, B. Givan, and T. Fatima. Taxonomic syntax for first order inference. In Proceedings of KR-89, 1989.

    Google Scholar 

  4. D. Robertson, J. Agusti, J. Hesketh, and J. Levy. Expressing program requirements using refinement lattices. Research paper, Department of Artificial Intelligence, University of Edinburgh, 1992. Longer version of paper submitted to ISMIS-93.

    Google Scholar 

  5. D. Robertson, A. Bundy, R. Muetzelfeldt, M. Haggith, and M Uschold. Eco-Logic: Logic-Based Approaches to Ecological Modelling. MIT Press (Logic Programming Series), 1991. ISBN 0-262-18143-6.

    Google Scholar 

  6. D. Robertson, M. Uschold, A. Bundy, and R. Muetzelfeldt. The eco program construction system: Ways of increasing its representational power and their effects on the user interface. International Journal of Man Machine Studies, 31:1–26, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan Komorowski Zbigniew W. Raś

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Robertson, D., Agustí, J., Hesketh, J., Levy, J. (1993). Expressing program requirements using refinement lattices. In: Komorowski, J., Raś, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics