Billy G. Claybrook

Learn More
The concept of data abstraction is utilized in database systems to define user interfaces via database views in database application languages and to describe the architecture of database systems. Differences between the specification and use of database views and other data abstractions realized as abstract data types are discussed. Database views are(More)
A specifilcation method designed primarily for specifying data abstractions, but suitable for specifying procedural abstractions as well, is described. The specification method is based on the abstract model approach to specifying abstractions. Several data abstractions and procedural abstractions are specified and a proof of implementation correctness is(More)
Analytical results in terms of Laplace-Stieltjes transforms for the busy period distribution of a time-sharing system with a central processing unit (CPU) and N peripheral units are derived in an earlier paper by Bhat and Nance. Assumptions of the model are that job arrivals are Poisson, required processing time for each job is an independent exponential(More)
Many programming applications, e.g., symbolic and algebraic manipulation applications and artificial intelligence applications, require the use of list structures. Several list processing languages or languages that provide for list processing have been developed, e.g. LISP 1.5, LISP 2, SLIP, PL/1, ALGOL 68, etc. With the exception of ALGOL 68 and LISP 2,(More)
A data structure definition facility (DSDF) is described that provides definitions for several primitive data types, homogeneous and heterogeneous arrays, cells, stacks, queues, trees, and general lists. Each nonprimitive data structure consists of two separate entities—a head and a body. The head contains the entry point(s) to the body of the(More)
An encapsulation mechanism, the <underline>module</underline>, for specifying abstract data types is described. The <underline>module</underline> employs a constructive specification method for specifying abstract data types. The constructive method consists of two specifications: a <underline>logical structure</underline> specification and a(More)
For some time now I have been wondering how well the existing polynomial factorization algorithms perform on some of the more difficult multivariate polynomials. Below are ten (of the over 300) multivariate polynomials that the heuristic program (POLYFACT) with learning factored while I was working on my dissertation (a complete description of POLYFACT will(More)
FOL is a language for implementing file organizations. It is implemented in LPL, a list processing language that is an extension of PL/1. FOL presents the user with a convenient means for declaring the structure of records in a file. Either tree structured or graph structured files can be created and manipulated. The language treats records in a file as(More)