ppxscal/embedding_network huggingface dataset:
An interactive program verification system
Authors: Donald I. Good, Ralph L. London, W. W. Bledsoe
Venue: Proceedings of the international conference on Reliable software (1975)

This paper is an initial progress report on the development of an interactive system for verifying that computer programs meet given formal specifications. The system is based on the conventional inductive assertion method: given a program and its specifications, the object is to generate the verification conditions, simplify them, and prove what remains. The important feature of the system is that the human user has the opportunity and obligation to help actively in the simplifying and proving. The user, for example, is the primary source of problem domain facts and properties needed in the proofs. A general description is given of the overall design philosophy, structure, and functional components of the system, and a simple sorting program is used to illustrate both the behavior of major system components and the type of user interaction the system provides.
Digital video display systems and dynamic graphics
Authors: Ronald Baecker
Venue: Proceedings of the 6th annual conference on Computer graphics and interactive techniques (1979)

Most digital video display systems have been capable of producing only text or static imagery. This paper shows that these limitations are not intrinsic to the technology, but are rather a direct consequence of the display system architecture. The paper begins by summarizing some of the background required to understand digital video display systems. The state-of-the-art is then surveyed, supported by an extensive bibliography. Existing systems are described in terms of a methodology which clarifies the effect of system architecture on capabilities and performance. It is shown how dynamic graphics capabilities can be provided if systems adhere to one or the other of two possible architectures. Examples of such systems are presented.
A hierarchical, restructurable multi-microprocessor architecture
Authors: R. G. Arnold, E. W. Page
Venue: Proceedings of the 3rd annual symposium on Computer architecture (1976)

This paper introduces a system architecture which allows a high degree of restructuring so that system resources may be tailored to processing requirements. The proposed system organization consists of a large number of byte-slice processors interconnected through a system of busses. Each processor is capable of communicating with every other processor in the system and any number of adjacent processors may be strung together to create a wider arithmetic capability than is possible with a single processor. Processors may be organized into a number of independent teams while processor teams may, in turn, be organized in a hierarchical fashion to allow for concurrent processing. Processor teams may function either in cooperation with or completely independent of other processor teams. All communication throughout the system consists of information packets containing the data to be transferred and a series of tags which indicate the destination address for the data and the action to be taken by the processor upon receipt of the information packet. Two types of busses are employed; Conventional busses and the circulating loop (or Pierce loop). The circulating loop moves an information packet in a fixed direction a uniform distance in each unit of time and therefore allows independent data transfer operations to be carried out simultaneously. Several examples illustrate the utility of the proposed architecture.
Algorithms for Gaussian integer arithmetic
Authors: B. F. Caviness, G. E. Collins
Venue: Proceedings of the third ACM symposium on Symbolic and algebraic computation (1976)

In this paper new algorithms are given for Gaussian integer division and the calculation of the greatest common divisor of two Gaussian integers. Empirical tests show that the new gcd algorithm is up to 5.39 times as fast as a Euclidean algorithm using the new division algorithm.
Determination of physician manpower requirements using a simulative forecasting model
Authors: Francis J. Brewerton, R. Wayne Gober, Richard B. Howe
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

Increased emphasis on solving social problems has demanded better manpower planning in all areas, but particularly in health services planning. A unique forecasting model is developed for predicting probabilistically the number of physicians required for specified future time periods. Each factor in the model is treated as a random variable with a triangular probability distribution. Exercising the model produces a probability distribution for the incremental number of physicians needed for the specified time period. The simulation results indicate that community health planners are able to assess future physician requirements probabilistically and with greater confidence than with traditional point estimation techniques.
Applications of symbolic and algebraic manipulation systems I (Panel Session)
Venue: Proceedings of the ACM annual conference - Volume 2 (1972)

This session will contain papers describing the use of symbolic and algebraic manipulation systems in various application areas.
CASPER
Authors: William A. Rux
Venue: Proceedings of the sixth international conference on APL (1974)

This paper describes the development of a set of APL routines which assist in the design of output reports and data bases found in administrative reporting systems. The routines described perform the 'housekeeping' of systems development while retaining the flexibility needed to provide for variations among systems. Samples are used to show the actual routines in use.
Towards automatic debugging of programs
Authors: Shmuel Katz, Zohar Manna
Venue: Proceedings of the international conference on Reliable software (1975)

We present the germ of an idea for automatically correcting logical errors in programs by manipulating the invariants of the program. An invariant tree is defined, and we show how it can be used to change the program in order to guarantee correctness. Debugging could be incorporated into a verification system which would first try to prove the correctness of the program. If the attempt is unsuccessful, two alternative approaches are suggested and compared. In the first, we try directly to correct the invariants and - through these - the statements, taking the calculated risk of modifying an already correct program. In the second approach, we initially prove incorrectness, and only then try to correct the program, by invalidating this proof.
Structure of an efficient duplex memory for processing fault-tolerant programs
Authors: K. H. Kim, C. V. Ramamoorthy
Venue: Proceedings of the 5th annual symposium on Computer architecture (1978)

Fault-tolerant programs contain redundancy to provide tolerance for residual program errors and hardware faults during task execution. The concept of parallel execution of fault-tolerant programs, i.e., overlapping main-stream computation with redundant computation related to validation and recovery, was developed in [8]. A memory scheme, referred to as &ldquo;duplex memory&rdquo;, was also designed to realize the full potential of parallel execution. Although the duplex memory sketched in [8] is valid, it suffers from high storage and time overhead. This paper presents an improved version of duplex memory and shows its optimality in terms of storage overhead for parallel execution. A scheme for mapping logical addresses of variables to physical memory locations is also discussed.
QoS Mechanism Composition at Design-Time and Runtime
Authors: Andreas Ulbrich, Torben Weis, Kurt Geihs
Venue: Proceedings of the 23rd International Conference on Distributed Computing Systems (2003)

In this paper we present a model-driven approach to the composition of QoS mechanisms. The support of multiple QoS categories as well as runtime adaptation requires the ability to change the message path of a middleware on the fly. This leads to a new set of problems regarding the composition of individual mechanisms to a functioning message path. Especially the order in which messages are passed through the QoS mechanisms is of great importance.We show how QoS mechanisms and their composition constraints can be modeled using the UML. Furthermore, a mapping from these UML models to our .NET Remoting based QoS management framework DotQoS is presented.
Package short courses: An idea whose time has come
Authors: Jane T. Baxter
Venue: Proceedings of the 6th annual ACM SIGUCCS conference on User services (1978)

It takes time to develop a really effective short course: time which is precious to all of us, and time which many smaller User Services departments simply do not have. But there is a way we can eliminate what sometimes amounts to years of trial and error, if we are willing to cooperate with each other. Individual User Services departments also used to take a great deal of time writing &ldquo;house&rdquo; statistical packages. That needless duplication has been eliminated now, with the development of the SPSS, SAS, and BMD statistical packages which are used in common by different schools. The idea of using someone else's developed course may seem foreign to some of you. But at GSU we have taken the approach that the developer is not always the teacher, and it has worked very well for several years now.
A programming environment for a timeshared system
Authors: Richard P. Gabriel, Martin E. Frost
Venue: ACM SIGPLAN Notices (1984)

In 1968 the Stanford Artificial Intelligence Laboratory began to construct a programming environment from a PDP-10, a pre-TOPS-10 DEC1 timesharing system, and some innovative terminal hardware. By now this has developed into a programming environment for a KL-10 that integrates our editor with various other system functions, especially the Lisp subsystem. We use the term 'SAIL' to refer to the Stanford A. I. Lab KL-10 computer running the WAITS timesharing system. [Harvey 1982] By 'programming environment' we mean the mechanisms that allow a user to type text at his program or subsystem, and which manage output text. 2 We are talking about mechanical management of the interaction between user and program, not about any intelligent mediation. A good programming environment should be flexible enough to suit individuals, yet without requiring the mechanics of interaction to be re-learned for each new program. In this paper we describe our programming environment, what makes it unique, and why we think that it is not necessary to move to personal computers for a very usable programming environment.
Using formal specifications in the design of a human-computer interface
Authors: Robert J. K. Jacob
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

This paper surveys specification techniques that can be applied to human-computer interfaces, provides examples of specifications, and presents some conclusions drawn from the author's experience using the techniques for specifying the user interface of the message system.
SAC-1 variable precision floating point arithmetic
Authors: James R. Pinkert
Venue: Proceedings of the 1975 annual conference (1975)

With most FORTRAN implementations, each variable V in a user's program is characterized at compile time as V(B, M, N) to specify that V can store exactly only values of the form &plusmn;b1b2... bm x B&plusmn;n, where the bj are B-digits, m &le; M, and n &le; N. One typical triple is (16, 6, 64). A system has been developed in which (108, 103, 108) is readily attainable, and M can be changed during execution. To achieve efficiency and portability, the implementation makes extensive use of the SAC-1 system developed by George Collins. This paper describes the routines comprising the system, and discusses a sample application, Theoretical and empirical computing times are also presented.
Misnet&mdash;the APL management information system for communications network
Authors: Isaak Gilyutin
Venue: Proceedings of the international conference on APL (1984)

MISNET is a multi purpose computer system created for the Western Union Telegraph Company to serve as a combined report generator, management information tool, and decision support system. Its main purpose is to evaluate all existing and forecast transmission requirements with regard to the Company's transmission network capacity. The system provides access to the data bank about the Company's communications network, routes and channels. The network itself consists of three sub networks: microwave terrestrial, microwave satellite and cable. Each of three sub networks in turn can carry regular 4 kHz voice frequency or wideband frequency channels. All three sub networks are interconnected. Routes through the network can be &ldquo;pure&rdquo;, when only one sub network is used, or &ldquo;mixed&rdquo;, when more than one sub network is used. An explanation for the choice of APL as the implementation language is given. System design problems are enumerated and data base design is discussed in detail. Special attention is devoted to route optimization and profitability analysis for new customer requirements. The algorithm for finding optimum routes is given, with an example and supplements. The profitability analysis algorithm is also discussed.
Assertions and APL programming
Authors: Susan L. Gerhart
Venue: Proceedings of seventh international conference on APL (1975)

Some difficulties in reading and writing APL programs are discussed. Assertions (important relations among and properties of variables) are suggested as a technique for improving reliability and readability of APL programs. It is shown how such assertions may be used for documentation, verification, optimization, and debugging. An implementation of run-time assertions in APLSV is given and illustrated by examples.
Instruction decomposition and microprogramming by exception in a generalized processor
Authors: Jerry Dillion
Venue: Supplement to the conference record of the 7th annual workshop on Microprogramming (1974)

A control structure is described whereby a limited set of tagged commands achieves the function of the typical fetch, decode, and execute processes of a higher level instruction but with fewer steps and decreased execution time than that required by the usual microprogramming. It is based on the decomposition of an instruction rather than the implementation of the fetch-decode-execute cycle. This results in a higher-level instruction set in which the lower level tagged commands are a primitive subset in contrast to typical emulation in which the two levels are incompatible. A firmware routine is only necessary for the more complex or seldom used instructions, hence the term microprogramming by exception. This approach offers the low cost, flexibility, and potential for extensive instruction sets of microprogramming without their serious execution time, control memory and implementation effort penalties. The set of tagged commands in a computer now under development is given, and examples of the implementation of higher-level instructions are provided.
Producing learning material for the intelligent videodisc
Authors: Alfred Bork
Venue: Proceedings of the ACM '81 conference (1981)

The notion of the intelligent videodisc as a learning device is one that has been with us for over seven years. But at the present time we still have very few examples of material employing the intelligent videodisc, and many of these examples are not impressive. Part of the difficult lies with inadequate funding to experiment with this learning medium. Part of the difficulty lies with the lack of experience in producing such materials, and therefore the lack of clear models to follow in the production process. It is this problem, the production process, that is the subject matter of the present paper. Some other aspects of the problem have been covered in previous papers by the author.
The IBM information retrieval center-(ITIRC) system techniques and applications
Authors: Samuel Kaufman
Venue: Proceedings of the 1966 21st national conference (1966)

This paper describes an information retrieval system which began in 1960 as an experiment in normal English text processing, using the IBM 650. The experiment has developed into a practical operating system on IBM 7090 and IBM 1401 computers serving approximately 5000 IBM technical and engineering professionals at IBM locations throughout the United States and Europe. The principal operation is at the Thomas J. Watson Research Center at Yorktown Heights, New York. The IBM Technical Information Retrieval Center (ITIRC) does retrospective searching and Current Information Selection for the U.S. installations, with a satellite installation at IBM San Jose, California, servicing the west coast on retrospective searching. A satellite operation at IBM France serves the IBM European Laboratories with both retrospective searching and CIS from La Gaude, France. The data bases are prepared and controlled at ITIRC headquarters at Yorktown Heights. Another satellite operation at Endicott, N. Y. handles IBM's suggestion plan.
Design and verification of secure systems
Authors: J. M. Rushby
Venue: ACM SIGOPS Operating Systems Review (1981)

This paper reviews some of the difficulties that arise in the verification of kernelized secure systems and suggests new techniques for their resolution. It is proposed that secure systems should be conceived as distributed systems in which security is achieved partly through the physical separation of its individual components and partly through the mediation of trusted functions performed within some of those components. The purpose of a security kernel is simply to allow such a 'distributed' system to actually run within a single processor; policy enforcement is not the concern of a security kernel. This approach decouples verification of components which perform trusted functions from verification of the security kernel. This latter task may be accomplished by a new verification technique called 'proof of separability' which explicitly addresses the security relevant aspects of interrupt handling and other issues ignored by present methods.
User models of text editing command languages
Authors: Lisa J. Folley, Robert C. Williges
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The present study was aimed at developing a method for determining novice and expert user's models of interactive text editing by empirically analyzing patterns of command language usage. These models, in turn, can form the basis for developing an interactive editor which is designed from the user, rather than the system, point of view.
On the use of simulation in the design and installation of a power and free conveyor system
Authors: George L. Good, J. Thomas Bauner
Venue: Proceedings of the 16th conference on Winter simulation (1984)

If the introduction of the first power and free conveyor system in a plant is a risky adventure, then the introduction of the second power and free conveyor system in a plant where the first one failed is an extremely hazardous undertaking. The people proposing this power and free conveyor system decided to decrease their risks by initiating a simulation study while the system was early in the design phase. The primary purpose of the proposed power and free system is to minimize the manual handling of parts between the two plating tanks compared to the system it replaced. The basic objective of this simulation study was to evaluate the feasibility of the proposed system to perform the required tasks while operating at specified production levels with efficient use of the planned number of workers.
Digital filter design and stability of a predictor-corrector integration
Authors: Sherman H. Wu
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

A new method of designing digital filters using numerical integration technique and Z-transform theory is developed, In addition the stability boundary of a predictor-corrector integration routine is established by using systems theory.
A polyalgorithm for the automatic solution of nonlinear equations
Authors: John R. Rice
Venue: Proceedings of the 1969 24th national conference (1969)

This paper discusses the design of a polyalgorithm for the automatic solution of a non-linear equation F(x) &equil; 0 for one variable. The polyalgorithm is part of NAPSS. The function F(x) is described by a computer program and is examined only by evaluation. The three main parts of the paper are: brief discussion of the objectives, description of the polyalgorithm and the testing made of it.
Systems training for the user executive
Authors: Jack Stone
Venue: Proceedings of the seventeenth annual computer personnel research conference (1980)

This paper describes an approach to systems training for user executives who have little or no direct experience in the management information systems (MIS) field.
Logic partitioning&mdash;component assignment
Authors: Hildegard A. Nidecker, William F. Simon
Venue: Proceedings of the 1968 23rd ACM national conference (1968)

A technique for partitioning logic into groups having minimal interconnection was considered an important tool necessary to the building of the Univac @@@@ 9200 System. Not only would costs be reduced by minimization of the total number of printed circuit assemblies and the total number of backboard connections, but logic signal propogation delay would also be minimized. The price to be paid for these advantages&mdash;a multiplicity of unique card types&mdash;was fully recognized, but considered tolerable in a small, high-volume system, 1
On structuring flowcharts (Preliminary Version)
Authors: S. Rao Kosaraju
Venue: Proceedings of the eighth annual ACM symposium on Theory of computing (1976)

Cooper's syntactic transformations for structuring flowcharts are studied. After exhibiting major problems with these transformations, a modified set of transformations are proposed. It is proved that a flowchart G is transformable into a D-chart if and only if for every 3 connected circuits C1, C2 and C3 in G, there exists a vertex v on C1+C2+C3 such that for every i, Ci passes through v or every path from Ci to the OUT of the flowchart passes through v.
The calculation of multivariate polynomial resultants
Authors: George E. Collins
Venue: Proceedings of the second ACM symposium on Symbolic and algebraic manipulation (1971)

An efficient algorithm is presented for the exact calculation of resultants of multivariate polynomials with integer coefficients. The algorithm applies modular homomorphisms and the Chinese remainder theorem, evaluation homomorphisms and interpolation, in reducing the problem to resultant calculation for univariate polynomials over GF(p), whereupon a polynomial remainder sequence algorithm is used. The computing time of the algorithm is analyzed theoretically as a function of the degrees and coefficient sizes of its inputs . As a very special case , it is shown that when all degrees are equal and the coefficient size is fixed, its computing time is approximately proportional to &lgr;2r+l , where &lgr; is the common degree and r is the number of variables . Empirically observed computing times of the algorithm are tabulated for a large number of examples, and other algorithms are compared. Potential application of the algorithm to the solution of systems of polynomial equations is briefly discussed.
Simulation of a minicomputer in a communications system
Authors: Frederick V. Crowley
Venue: Proceedings of the 7th conference on Winter simulation - Volume 1 (1974)

An analysis of the performance of a minicomputer, which is used in a computer communications environment, is presented. The purpose of the paper is to show how some of the minicomputer's capabilities may be defined, and to establish a basis for a more detailed analysis. The principal aspect being considered is message throughput. Two models, oriented about the software, were developed: one using conventional mathematical queuing techniques and the other using a discrete simulation language (GPSS). The GPSS model was used to provide an approximate verification of the assumptions and of the results obtained mathematically.