article · 1994

On Refinement and Foops

Paulo Borba, Paulo Borba, Joseph A. Goguen, Joseph A. Goguen

Cited by 0Abstract and details only

Abstract

FOOPS is a concurrent object-oriented language. Based on FOOPS operational semantics, we define a notion of refinement, and an associated proof technique. The use of refinement for stepwise formal development of programs in FOOPS is illustrated by examples involving memory cells, and different implementations of buffers. 1 Introduction FOOPS is a concurrent object-oriented specification language with an executable subset [8, 23]. FOOPS includes a functional language derived from OBJ [10], which is a first order, purely functional language supporting an algebraic style for the specification, rapid prototyping, and implementation of abstract data types. FOOPS extends OBJ by providing a simple declarative style for object-oriented programming and specification using (conditional) equations. It supports classes of objects with associated methods and attributes, object identity, dynamic object creation and deletion, overloading, polymorphism, inheritance with overriding, and many additiona...

Cite this paper

APA 7

Borba, P., Borba, P., Goguen, J. A., & Goguen, J. A. (1994). On Refinement and Foops.

MLA 9

Borba, Paulo, et al. “On Refinement and Foops.” 1994.

Chicago

Borba, Paulo, Paulo Borba, Joseph A. Goguen, and Joseph A. Goguen. 1994. “On Refinement and Foops.”

Harvard

Borba, P. et al. (1994) ‘On Refinement and Foops’.

BibTeX

@article{borba1994refinement,
  title = {{On Refinement and Foops}},
  author = {Borba, Paulo and Borba, Paulo and Goguen, Joseph A. and Goguen, Joseph A.},
  year = {1994}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.