ppxscal/embedding_network huggingface dataset:
Abstraction Mechanisms for Event Control in Program Debugging
Authors: B. Lazzerini, L. Lopriore
Venue: IEEE Transactions on Software Engineering (1989)

In the event-action model of interactions between the debugging system and the program being debugged, an event will occur on the evaluation of a conditional defined in terms of the program activity if the evaluation yields the value true, and an action is an operation performed by the debugging system on the occurrence of an event. This paper presents a set of mechanisms for expressing conditionals at different levels of abstraction. At the lowest level, the authors have the simple conditionals, which can be expressed in terms of the values of the program entities and of the execution of the program statements. Simple conditionals can be grouped to form higher-level compound conditionals, which can be expressed in terms of the state and flow histories. The paper shows that the proposed abstraction mechanisms are powerful tools for monitoring program activity. They adequately support different debugging techniques, and offer the user a considerable degree of control over the debugging experiment.
To DOS or not to DOS
Authors: William B. Miller
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

Much to the disappointment of hard core disk operating system (DOS) wizards, many computer users have little knowledge of DOS commands and, in fact, they may not need much DOS knowledge in the future. Computer users today are able to manage files and move from application to application without directly invoking a DOS command. Application packages such as word processors, spread sheets, and data bases provide for file management. Special software programs are available that allow the user to backup an entire hard disk without any knowledge of DOS. Menu programs can be placed on a hard disk which allow the user to choose applications without knowing DOS commands. Perhaps the most creative programs to help the user avoid DOS, are the DOS management systems available on the market today which allow the user to speak English while the program speaks DOS to the system. On some campuses personnel are available to install and set up computers with hard disks using menu programs, applications, and DOS management programs. The user is trained in using the application and shown how to work with the menu system. As long as the system does not have a hardware or software problem, the user is able to be productive without extensive training in DOS commands. This process saves a great deal of time and money in training the computer user. Emphasis can be placed on training programs in areas where there is direct return for the time and money spent. Certainly a case could be developed to support DOS training for all computer users. Knowledge of the operating system, file management, backup procedures, etc. could be a tremendous advantage for the user. However, management must weigh the expenditure of time and cost against the advantages of training a staff in MS-DOS. Furthermore, not all computer users will find DOS friendly and their attempt to use the DOS commands could become frustrating and time consuming.
Tenuring policies for generation-based storage reclamation
Authors: David Ungar, Frank Jackson
Venue: ACM SIGPLAN Notices (1988)

One of the most promising automatic storage reclamation techniques, generation-based storage reclamation, suffers poor performance if many objects live for a fairly long time and then die. We have investigated the severity of this problem by simulating Generation Scavenging automatic storage reclamation from traces of actual four-hour sessions. There was a wide variation in the sample runs, with garbage-collection overhead ranging from insignificant, during the interactive runs, to severe, during a single non-interactive run. All runs demonstrated that performance could be improved with two techniques: segregating large bitmaps and strings, and mediating tenuring with demographic feedback. These two improvements deserve consideration for any generation-based storage reclamation strategy.
Software engineering meets user services: a methodology for developing user
Authors: Robin Mayne
Venue: Proceedings of the 16th annual ACM SIGUCCS Conference on User Services (1988)

This paper will address the task of applying Software Engineering techniques of requirements analysis to one aspect of the User Services Consultant's job: analyzing a problem situation and recommending some course of action, often computer-related. While User Services consultants do not typically develop systems for users, they are frequently approached by individuals who suspect that a problem they are experiencing might be solved through the use of a computer. Consultants then attempt to help the user articulate the problem, identify data and equipment needs, and recognize personnel constraints. Various recommendations might be made, including discouraging automation, encouraging user self-implementation (i.e., user learns a package and implements on his or her own), or referring the project to M.I.S. for further analysis. The quality of this process is not carefully monitored and users receive various levels of assistance based on the particular expertise of the consultant. As a case study, I have selected a project in the Psychology Department to analyze. The result has been the development of a Requirements Specification Form which can be used in User Services. Its primary function is to force the consultant to ask the relevant questions such that an appropriate recommendation will be arrived at. It is expected that this methodology will markedly improve User Services' ability to deliver quality service in this important area.
A process-oriented extensible hypertext architecture
Authors: C. J. Kacmar
Venue: ACM SIGCHI Bulletin (1989)

Previous hypertext systems have been designed in a monolithic fashion. This design has inhibited the ability of hypertext systems to be extended or to interface with other systems. A new architecture for hypertext systems has been developed. This architecture is centered around the process and object-oriented models of software construction. The architecture provides hypertext functionality outside the application, allowing applications to draw upon those hypertext features appropriate to the application. The architecture also extends hypertext functionality so that inter-application as well as intra-application information links can be formed.
A parallel computer for lattice Gauge theories
Authors: T. W. Chiu
Venue: Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1 (1988)

A parallel computer especially designed for the calculations in lattice gauge theories is proposed. The final device will contain 256 nodes running in MIMD mode with a computational power about one billion 32-bit floating point operations per second. Each node is controlled by the Motorola 68020/68882 microprocessors, (the Weitek floating-point processors ) and two megabyte static RAM. The architecture is designed to allow rapid execution of the numerically intensive calculations in lattice gauge theories. In this paper, we outline the hardware and software design of the first four nodes which have been built and tested.
CHI '88 trip report
Authors: Jakob Nielsen
Venue: ACM SIGCHI Bulletin (1988)

"Do you want to spend the rest of your life selling sugared water or do you want a chance to change the world?" By asking this question, the then chairman of Apple Steve Jobs enticed John Sculley away from his fast track career in Pepsi. Similar considerations form a large part of my own motivation for working in the user interface field. As Ben Shneiderman said in his keynote speech at CHI'86: Our work will influence how people live in the next century.
A DCFL E/D-MESFET GaAs Experimental RISC Machine
Authors: W. Helbig, V. Milutinovic
Venue: IEEE Transactions on Computers (1989)

The design of RCA's 32-bit GaAs microprocessor is described. Technology limitations and influences of the software environment are discussed. The details of the instruction set architecture (ISA) and the instruction execution sequence (IES) are described. The essence of the original contributions of the research and the design is emphasized. The simulated performance evaluation data are presented.
Towards a Better Understanding of Data Models Through the Multilingual Database System
Authors: Steven A. Demurjian, David K. Hsiao
Venue: IEEE Transactions on Software Engineering (1988)

An approach to the design of a database system, the multilingual database system (MLDS), has been proposed and implemented. MLDS is a single database system that can execute may transactions written respectively in different data languages and support many databases structured correspondingly in various data models, i.e. DL/I transactions on hierarchical databases, CODASYL-DML transactions on network databases, SQL transactions on relational databases, and Daplex transactions on functional databases. The authors describe MLDS, focusing on its motivation and structure. It is shown how MLDS, by providing an integrated environment for experimenting with data models and data languages, also serves as a testbed that provides insight to data models and data-model semantics, using qualitative and quantitative techniques. Related work on data-language comparison and analysis is indicated.
Generic expert system shell for diagnostic reasoning
Authors: Wei-Han Chu
Venue: Proceedings of the 1st international conference on Industrial and engineering applications of artificial intelligence and expert systems - Volume 1 (1988)

Rule based expert systems provide a modular and uniform approach to representing knowledge, however it has been recognized that rule-based systems become increasingly difficult to understand and maintain as the number of rules grow. Expert systems today are developed on general purpose inference shells that offer general purpose paradigms which do not take into considerations the type of problems being solved. It is up to the users to create the meta level control to prevent rule interference, and for the rules to function properly. This task tends to become increasingly difficult in direct proportion to the size of the accumulated knowledge. The solution is in a new generation of Application Specific Expert System Tools that are designed with specific paradigms and knowledge representation methodology that meet the requirements of a specific domain. This concept is examplified in the work presented here that introduces a generic expert systems shell for diagnostic reasoning. Domain knowledge is represented as five different classes of objects. A paradigm for diagnostic reasoning is built into the inference algorithm to become part of the inference shell, replacing the usual general purpose forward or backward chaining algorithm.
Formal Methods for Protocol Testing: A Detailed Study
Authors: Deepinder P. Sidhu, Ting-kau Leung
Venue: IEEE Transactions on Software Engineering (1989)

The authors present a detailed study of four formal methods (T-, U-, D-, and W-methods) for generating test sequences for protocols. Applications of these methods to the NBS Class 4 Transport Protocol are discussed. An estimation of fault coverage of four protocol-test-sequence generation techniques using Monte Carlo simulation is also presented. The ability of a test sequence to decide whether a protocol implementation conforms to its specification heavily relies on the range of faults that it can capture. Conformance is defined at two levels, namely, weak and strong conformance. This study shows that a test sequence produced by T-method has a poor fault detection capability, whereas test sequences produced by U-, D-, and W-methods have comparable (superior to that for T-method) fault coverage on several classes of randomly generated machines used in this study. Also, some problems with a straightforward application of the four protocol-test-sequence generation methods to real-world communication protocols are pointed out.
Scaling Theorems for Zero-Crossings
Authors: L. Wu, Z. Xie
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (1990)

Two scaling theorems are given. Instead of delta functions, polynomial functions are used as input. The advantages are twofold: the smoothness conditions on kernels are not required, so that kernels of the form e/sup -k mod X mod / can be included; the proofs are based on calculus completely and so can be more easily understood.
Using one-way functions for authentication
Authors: L. Gong
Venue: ACM SIGCOMM Computer Communication Review (1989)

Techniques are suggested to construct authentication protocols on a basis of one-way functions rather than encryption algorithms. This approach is thought of interest for several reasons. It appears that this approach could achieve, at least, equally simple and capable protocols.
Computational hypertext in biological modelling
Authors: J. L. Schnase, J. J. Leggett
Venue: Proceedings of the second annual ACM conference on Hypertext (1989)

This paper describes an application of hypertext to a biological research problem. An individual energetics model for Cassin's Sparrow was developed in which the computations and intellectual activities associated with each phase of the research were performed within an integrated hypertext environment. The study demonstrates the effectiveness of computational hypertext in meeting the personal information management requirements of individual researchers in the natural sciences and its ability to speed the dissemination of research results within a community of scholars. Most important, the study shows how hypertext can be &ldquo;phased in&rdquo; to support traditional scholarship in disciplines that are otherwise slow to respond to emerging computer technologies.
Integration of rational functions: Rational computation of the logarithmic part
Authors: D Lazard, R Rioboo
Venue: Journal of Symbolic Computation (1990)

A new formula is given for the logarithmic part of the integral of a rational function, one that strongly improves previous algorithms and does not need any computation in an algebraic extension of the field of constants, nor any factorisation since only polynomial arithmetic and GCD computations are used. This formula was independently found and implemented in SCRATCHPAD by B. M. Trager.
Arithmetic with real algebraic numbers is in NC
Authors: B. Mishra, P. Pedersen
Venue: Proceedings of the international symposium on Symbolic and algebraic computation (1990)

We describe NC algorithms for doing exact arithmetic with real algebraic numbers in the sign-coded representation introduced by Coste and Roy [CoR 1988]. We present polynomial sized circuits of depth &Ogr;(log3 N) for the monadic operations -&agr;, 1/&agr;, as well as &agr; + r, &agr; &middot; r, and sgn(&agr; - r), where r is rational and &agr; is real algebraic. We also present polynomial sized circuits of depth &Ogr;(log7 N) for the dyadic operations &agr;+&bgr;, &agr;&middot;&bgr;, and sgn(&agr; - &bgr;), where &agr; and &bgr; are both real algebraic. Our algorithms employ a strengthened form of the NC polynomial-consistency algorithm of Ben-Or, Kozen, and Reif [BKR 1986].
Software engineering for distributed applications: the design project
Authors: M. Dr. Muhlhäuser
Venue: Proceedings of the 10th international conference on Software engineering (1988)

The DESIGN project combines a set of new approaches to software engineering for distributed applications. Distributed applications may thereby consist of a large, varying number of interacting processes. Specific problems encountered with the development of such distributed applications are not suitably reflected by known programming languages and software engineering environments. The DESIGN system in its current version integrates consistent approaches specifically suited for distributed application development. These approaches pertain to the areas `language support`, `performance prediction/rapid prototyping`, and `project support environment`. Most parts of the DESIGN system have been implemented and successfully applied to first sample distributed applications.
Design of the x-kernel
Authors: N. Hutchinson, L. Peterson
Venue: Symposium proceedings on Communications architectures and protocols (1988)

The x-kernel is a configurable operating system kernel designed to support experimentation in interprocess communication and distributed programming. The x-kernel's underlying architecture provides a rich set of abstractions that are used to construct and compose communication protocols. The architecture is interesting because the abstractions are both general enough to accommodate a wide range of protocols and efficient enough to provide a useful testbed in which protocol performance can be accurately measured.
Telescience and advanced technologies
Authors: B. M. Leiner
Venue: Proceedings of the ACM workshop on Frontiers in computer communications technology (1987)

Space Station and its associated laboratories, coupled with the availability of new computing and communications technologies, have the potential of significantly enhancing scientific research. Telescience involves the interaction of scientific researchers and equipment on earth with on-board personnel and equipment as well as with other researchers, remote ground-based resources, mission control personnel, and space station developers. To assure that this potential is met, scientists and managers associated with the Space Station project must gain significant experience with the use of these technologies for scientific research, and this experience must be fed into the development process for Space Station. In this talk, a pilot program is described that is attempting to address this problem. University researchers are conducting rapid prototyping testbeds employing new telescience technologies and ideas. These testbeds are specific research experiments within the scientific discipline areas that will use Space Station laboratories. The experiments are being carried out in a coordinated manner to allow the critical questions to be answered by groups of scientists working with technologists in a rapid prototyping testbed environment. The rapid prototyping testbeds are not like a typical testbed. Rather than being used to evaluate and integrate systems on the way to deployment, the rapid prototyping testbeds constitute a Technology Evaluation Environment (TEE), allowing users to interact with advanced technologies in the conduct of scientific research in order to develop the required base of experience to permit development and evaluation of requirements and specifications.
Reliability of Systems with Markov Transfer of Control
Authors: Kyle Siegrist
Venue: IEEE Transactions on Software Engineering (1988)

Software/hardware systems are considered which can be decomposed into a finite number of modules. It is assumed that control of the system is transferred among the modules according to a Markov process. Each module has an associated reliability which gives the probability that the module will operate correctly when called and will transfer control successfully when finished. The system will eventually either fail or complete its task successfully and enter a terminal state. The reliability of the system is studied in terms of the module reliabilities and the transition probabilities. Improved methods of predicting system reliability, allocating module reliability, and determining module sensitivity are developed. Special branching and sequential systems are studied in detail.
On &ohgr;-automata and temporal logic
Authors: S. Safra, M. Y. Vardi
Venue: Proceedings of the twenty-first annual ACM symposium on Theory of computing (1989)

We study here the use of different representation for infinitary regular languages in extended temporal logic. We focus on three different kinds of acceptance conditions for finite automata on infinite words, due to B&uuml;chi, Streett, and Emerson and Lei (EL), and we study their computational properties. Our finding is that B&uuml;chi, Streett, and EL automata span a spectrum of succinctness. EL automata are exponentially more succinct than B&uuml;chi automata, and complementation of EL automata is doubly exponential. Streett automata are of intermediate complexity. While translating from Streett automata to B&uuml;chi automata involves an exponential blow-up, so does the translation from EL automata to Streett automata. Furthermore, even though Streett automata are exponentially more succinct than B&uuml;chi automata, complementation of Streett automata is only exponential. As a result, we show that the decision problem for ETLEL, where temporal connectives are represented by EL automata, is EXPSPACE-complete, and the decision problem for ETLS, where temporal connectives are represented by Streett automata, is PSPACE-complete.
Algebraic programming of geometrical calculus and clifford algebra
Authors: Ph. Tombal, A. Moussiaux
Venue: Journal of Symbolic Computation (1989)

The basic concepts of geometrical calculus have been implemented in an algebraic programming language. In this paper, we describe how our program performs fundamental operations on multivectors.
Latch-to-Latch Timing Rules
Authors: Arthur F. Champernowne, Louis B. Bushard, John T. Rusterholz, John R. Schomburg
Venue: IEEE Transactions on Computers (1990)

Latch-to-latch timing rules that ensure the proper operation of synchronous systems are presented and analyzed. The rules state bounds on the amount of propagation delay for the combinational logic between consecutive latch pairs in a digital design. If the bounds are satisfied in a design, then setup and hold times are met throughout the design for each latch on each cycle of machine operation. The rules are quite general in that they apply to systems with multiple skew levels (a feature of most real systems), with multiple latch parameters such as clock to data propagation delays, data to data propagation delays, and setup and hold times, and with multiple clock pulse widths and clock phases. The abstract notion of a clock skew hierarchy is introduced and characterized. The rules are established by a novel and robust method.
Identifying the semantic and textual differences between two versions of a program
Authors: Susan Horwitz
Venue: Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation (1990)

Text-based file comparators (e.g., the Unix utility diff), are very general tools that can be applied to arbitrary files. However, using such tools to compare programs can be unsatisfactory because their only notion of change is based on program text rather than program behavior. This paper describes a technique for comparing two versions of a program, determining which program components represents changes, and classifying each changed component as representing either a semantic or a textual change.
Kit: A Study in Operating System Verification
Authors: W. R. Bevier
Venue: IEEE Transactions on Software Engineering (1989)

The author reviews Kit, a small multitasking operating system kernel written in the machine language of a uniprocessor von Neumann computer. The kernel is proved to implement on this shared computer a fixed number of conceptually distributedcommunicating processes. In addition to implementing processes, the kernel provides the following verified services: process scheduling, error handling, message passing, and an interface to asynchronous devices. As a by-product of the correctness proof, security-related results such as the protection of the kernel from tasks and the inability of tasks to enter supervisor mode are proved. The problem is stated in the Boyer-Moore logic, and the proof is mechanically checked with the Boyer-Moore theorem prover.