ppxscal/embedding_network huggingface dataset:
A logic design front-end for improved engineering productivity
Authors: Frank Rubin, Paul W. Horstmann
Venue: Proceedings of the 20th Design Automation Conference (1983)

We have developed Design and Verification (DAV) as a new design front-end for the IBM Engineering Design System. DAV is a menu-driven system with powerful graphics capabilities for the entry and verification of a logic design. The design is hierarchically structured, using high-level technology-independent operators that can be simulated and verified at a purely logical level, then transformed into specific technologies and checked for LSSD rules and physical design constraints. The stated goals of DAV are for the product to get to the market in 30% less time, with 40% lower design cost, and with 98% percent of the errors removed prior to hardware prototyping. We expect to achieve these goals fully.
Removal of invariant statements from nested-loops in a single effective compiler pass
Authors: D. Neel, M. Amirchahy
Venue: ACM SIGPLAN Notices (1975)

This document presents how one of the most important optimizations that a program may undergo is dealt with by means of attributes [7]. A semantic formalization of the classical method which consists of removing all loop-independent statements from the articulation blocks of a loop is given. The method is equally well applicable to algebraic languages or their intermediate code : in a high level language even very well constructed programs quite often contain in their intermediate code version invariant loop expressions where address evaluations are concerned. Whatever the level of nested-loop structure, the method proposed here would not require more than a single real compiler pass in contrast with classical methods which proceed from the innermost loop and shift the invariant statements just one level at each successive pass. Finally an interesting algorithm to determine the articulation blocks of a program is given in the annexe. This method has been so conceived as to take into account the evaluation of attributes by the system DELTA [6]. In this phase of the compiler possibilities of parallel execution are offered as the evaluation program is data oriented. The rigour of formalization attained together with a certain minimization of risks of erroneous optimization applications which it involves render this method indubitably efficient.
Progress in control procedure standardization
Authors: Stanley R. Rosenblum
Venue: Proceedings of the ACM second symposium on Problems in the optimizations of data communications systems (1971)

The development of Data Communications Control Procedure standards is an essential element in reducing the complexity of Data Communications. The ASCII approach of the nineteen sixties provided a base for accommodating the problems of communication control and computer-oriented data interchange. The ASCII control procedure standard applied a character-oriented philosophy which brought some degree of order to the problem. A brief history and description of the philosophy is presented. A proposed bit-oriented advanced control procedure holds great promise for bringing a single data framing format and control technique to the interchange of information over communications links. The objectives of the new procedure are discussed and the procedure is described in some detail. Current status and prospects for standardization are reviewed with respect to progress in domestic and international standards bodies.
Operational and semantic equivalence between recursive programs.
Authors: Jean-Claude Raoult, Jean Vuillemin
Venue: Proceedings of the tenth annual ACM symposium on Theory of computing (1978)

In this paper, we show that two widely different notions of program equivalence coincide for the language of recursive definitions with simplification rules. The first one is the now classical equivalence for fixed-point semantics. The other one is purely operational in nature and is much closer to a programmer's intuition of program equivalence.
Evaluating extensions to APL
Authors: J. A. Brown
Venue: Proceedings of the international conference on APL: part 1 (1979)

This paper presents some guidelines which may be used to evaluate extensions to APL. These guidelines are then applied to some proposed APL extensions including complex arithmetic, functions on non-simple arrays and operators.
Recent developments in representation in the science of design
Authors: Charles M. Eastman
Venue: Proceedings of the 18th Design Automation Conference (1981)

A recent goal in computer aided design is the representation of a design artifact in a form sufficient to support all analyses and to determine that the design is realizable. Some aspects of a theory of design representations are presented. Benefits of developing such a theory is discussed.
Structured programming using BASIC
Authors: Robert N. Cook
Venue: ACM SIGCSE Bulletin (1980)

With the advent of inexpensive microcomputers, which are mainly programmed in BASIC, and the widespread availability of BASIC on both minicomputers and large scale computers, the advantages of structured programming mandate that the techniques be extended to BASIC. Alternation (IF-THEN-ELSE) as well as repetition (DO WHILE and DO UNTIL) are easily implemented in BASIC. The CASE structure and necessary style conventions to insure readable, easy to write, easy to debug programs are readily implemented in BASIC. Structured pseudocode is used to express algorithms which are then written in structured BASIC.
Computational parallels between the regular and context-free languages
Authors: H. B. Hunt,  III, D. J. Rosenkrantz
Venue: Proceedings of the sixth annual ACM symposium on Theory of computing (1974)

This paper presents a complexity theory of formal languages. The main technique used is that of embedding &ldquo;&equil;{0,1}*&rdquo;, &ldquo;&equil;0*&rdquo;, and &ldquo;&equil;&fgr;&rdquo; into other linguistic predicates. In Section 2, the undecidability of &ldquo;&equil;{0,1}*&rdquo; for cfl's is exploited to provide sufficient conditions for the undecidability of predicates on the cfl's. In Section 3, the same techniques are applied to regular sets. Predicates satisfying conditions similar to those of Section 2 are shown to be hard, where how hard depends on the descriptors used to enumerate the regular sets. Section 4 concentrates on the equivalence and containment problems for cfl's. For cfl's, regular sets, and linear cfl's, the complexity of determining equivalence to a fixed language is linked to whether the fixed language is finite, infinite but bounded, or unbounded. In Section 5, the ability of cfg's to generate finite languages whose strings are exponential in the size of the grammar is used to obtain exponential lower bounds on several decidable problems for cfg's generating finite sets. In Section 6, all nontrivial predicates for certain specific classes of languages are shown to be hard. In Section 7, we show that a dpda can always be converted in polynomial time into an equivalent dpda that always halts. Therefore the predicate &ldquo;&equil;{0,1}*&rdquo; is in P for dpda's, and embedding this problem into other predicates on the dpda's will not yield nonpolynomial lower bounds. In Section 8, some of the preceding results are generalized to other families of languages.
Automated rip-up and reroute techniques
Authors: William A. Dees,  Jr., Patrick G. Karger
Venue: Proceedings of the 19th Design Automation Conference (1982)

The ultimate goal of all automated routing systems is to interconnect 100% of the necessary point-to-point electrical connections. However, most automated routing systems fail to find acceptable paths for all required connections because of limited routing resources or problem complexity. Therefore, a cleanup phase is often necessary. During this cleanup phase, connectivity can be improved through a variety of manual and automated techniques. This paper concentrates on one automated technique, rip-up and reroute. Various rip-up and reroute strategies are discussed and evaluated, and experimental results are provided.
Digital sensor simulation: 1980-1985
Authors: Marshall B. Faintich
Venue: Proceedings of the 13th annual symposium on Simulation (1980)

The Defense Mapping Agency is producing global digital data bases to support aircrew training simulators and other computer image generation systems. The evolution to digital sensor simulation is presented and current digital data bases are described. The refinement of actual sensors is changing the content required in these data bases, and the effect on digital sensor simulation in the 1980-1985 time period is discussed.
On the morphological analysis of binary random fields
Authors: K. Sivakumar, J. Goutsias
Venue: Proceedings of the 1995 International Conference on Image Processing (Vol. 1)-Volume 1 - Volume 1 (1995)

Modeling image data by means of random fields and developing statistical techniques for the processing and analysis of these random fields is an important problem in image processing and analysis. We theoretically formulate the problem of processing binary random fields by means of mathematical morphology. This may allow us employ mathematical morphology in order to develop new statistical techniques for the processing and analysis of random shapes modeled as binary random fields. Since morphological transformations of continuous space binary random fields are not measurable in general, we employ intermediate steps which require generation of an equivalent random closed set. The relationship between binary random fields and random closed sets is thoroughly investigated. As a by-product of this investigation, a number of useful new results, regarding separability of random closed sets, are presented.
What price virtual memory?
Authors: Maria Davis, George E. Richmond
Venue: Proceedings of the 2nd symposium on Simulation of computer systems (1974)

Virtual memory offered a long term solution to a company requirement for a large memory system, but at what price in other computer resources? This study sought to predict the effect on compute load of moving from an IBM System 370 Model 165 with OS/MVT to a Model 165-2 or Model 168 with VS2. The compute load on the two virtual memory systems will increase in different ways relative to a Model 165 as a function of both the input/output activity and program locality. A GPSS simulation was performed for the 165, 165-2 and 168 central processor interaction with memory. The data flow between the instruction decode unit, execution unit, high-speed buffer and storage was modeled and parameterized, resulting in predicted bounds on the performance of a major time-critical application on a 165-2 and 168. Data collected later by a hardware monitor during 168 benchmarks verified the model. For the company's large, varying batch load, software monitor data, performance data for the new operating system and characterizations of the job stream based on hardware monitoring were combined to project the compute price of moving to the virtual systems. Thus with a combination of simulation, benchmarks, and hardware and software monitors, management was offered valuable technical inputs on the predicted effects of changes in computer model and operating system.
Hierarchies based on computational complexity and irregularities of class determining measured sets (Preliminary Report)
Authors: L. J. Bass, Paul R. Young
Venue: Proceedings of the second annual ACM symposium on Theory of computing (1970)

We consider here the problem of building transfinite hierarchies of computable functions on the basis of their difficulty of computation. Previous hierarchies of functions through the constructive ordinals have had two major problems, each apparently caused by not having techniques to restrict the classes considered at limit ordinals. These problems are, first that every function occurs at some name for &ohgr;, or some other small ordinal, and second that two names for the same constructive ordinal have two different classes of functions associated with them. The axioms of computational complexity introduced by Blum[1] and several theorems by Blum[1],and by McCreight and Meyer[9], particularly the union theorem, lead to a very natural method of hierarchy building that partially avoids the first of these problems. The other problem is not overcome, however. In attempting to understand the problem of obtaining unique, or nearly unique classes of functions we have encountered difficulties because the class determining measured sets of McCreight and Meyer[9] lack several properties that might reasonably be desired.
A dynamic clustering strategy in a demand paging environment
Authors: Udo W. Pooch
Venue: Proceedings of the 4th symposium on Simulation of computer systems (1976)

An algorithm is presented which dynamically clusters pages of a problem program based on its past program behavior (i.e. reference string patterns) in a demand paged virtual memory environment. The objective of this algorithm is to minimize the number of page faults during execution, while at the same time use memory page frames efficiently. Dynamic clusters of time and reference related pages are built during a program's execution time. Whenever a page fault for the i-th page occurs in this time evolving environment, the pages of the cluster associated with the i-th page is compared to the pages currently in real (physical) memory. Thus during this current page fault, the demanded page, and any associated clustered pages not currently in physical memory are placed into memory. Page frames holding pages not in the current cluster are returned to the memory management system. Thus the physical amount of memory allocated to a processing program is dependent upon the size of the associated cluster at that time. Simulation results of program behavior operating under this dynamic clustering strategy indicates that significant improvements in page faults and in the space time product may be achieved. The algorithm requires fewer real page frames per executed instruction than most currently implemented algorithms that utilize a fixed number of page frames per problem programs (i.e. fixed allocated partition or region). The algorithm, MLMM (Modified Locality Matrix Model), an extension of work by Hedges and Pooch [12] is used to determine inherent program locality to predict independent dynamic program behavior, separating instruction from data references. Furthermore, strength coefficients between weakly or loosely coupled clusters are used to refine the cluster population, identify cluster transitions, as well as indicate the behavior of the cluster formations.
Using an APL micro computer for distributive processing
Authors: Sandra L. Browne
Venue: ACM SIGAPL APL Quote Quad (1981)

There have been significant changes in computer technology since the authors of this paper started working in APL in 1969. From our point of view the most exciting recent event has been the development of APL for use with micro computers. The increasing power of low cost micros in combination with a good communication facility between the micro and the time sharing main frame make it possible to use micros for distributive processing in APL systems. This paper describes how the authors altered the system design of an existing time sharing APL system to include a micro, and the type of communications facilities which had to be developed for the micro so that no change in data entry procedure was observed by the operators of this system. The introduction of a micro which cost as much as a terminal cut system running cost by one third, paying for itself in less than six months.
Microcomputer operating systems panel: UNIX
Authors: Ian F. Darwin
Venue: Proceedings of the 1983 annual conference on Computers : Extending the human resource (1983)

Are multi-user microcomputer systems a good idea? They tend to be reinventions of the timesharing mainframe mistakes of the 60's and 70's. Why not give each user a real micro? This argument leads one either to multiprocessor systems, or to networking. But UNIX is an interesting system, since it's inherently multi-programmed, and because multi-programming if done correctly makes your system inherently multi-user. This is a case of the principle that if you make things general, you often get unexpected benefits. UNIX also inherently facilitates sharing of files and other resources. Other systems tend to make communal sharing difficult. UNIX evolved to serve a small community of cooperating users, hence a &ldquo;supermicro&rdquo; UNIX for a small department should work well (and does). UNIX has also, of course, been used in much larger (and less cooperative!) environments with considerable success (but not without some system maintenance).
Programming Distributed Systems
Authors: J. A. Feldman, J. R. Low, P. D. Rovner
Venue: Proceedings of the 1978 annual conference (1978)

For a number of technical and economic reasons, distributed computing is increasing rapidly in importance. The main technical considerations are the increased performance of small machines and of communications systems relative to that of giant computers and the opportunity for greater system reliability through redundancy. The economic considerations include all of the technical ones plus additional aspects including the geographic dispersal of needs and the organizational advantages of more specialized facilities (cf. Bank of America article in Datamation [1976]). The Computer Science Department of the University of Rochester has, from its inception in 1974, directed much of its research effort toward a better understanding of distributed computing.
Antisubmarine warfare simulation on a minicomputer
Authors: John M. Arrigan, David M. Shao
Venue: Proceedings of the 13th conference on Winter simulation - Volume 1 (1981)

Simulation has long been considered an effective technique in the area of military applications, especially in systems analysis and in personnel training programs. In this study, a simulation model designated as SEASIM (Surface Escort Antisubmarine Warfare Simulation) was developed to simulate an antisubmarine warfare engagement between surface escorts and an enemy submarine. The model development was sponsored by the Surface Sonar Department of the Naval Underwater Systems Center, New London, Connecticut. The original model was developed to run on a desktop minicomputer to take advantage of its easy accessibility, real-time graphics capability, interactive special features, and low costs. The simulation models specifically the acoustic detection of a submarine by a destroyer and the attack on the submarine by a torpedo-carrying helicopter.
Communication - Nets for the specification of operator dialogs
Authors: W. K. Epple, U. Rembold
Venue: Proceedings of the 1982 conference on Human factors in computing systems (1982)

The model of a man - machine - system is the basis of the proposed notation. It consists of the components man and machine. With these (statical) components a (dynamic) process, called man - machine - communication or man - machine - dialog, is realized. The (three) possible dynamic interfaces are described. According to /CAR;69/ an evaluation, decision and control module for the exchange of information belongs to an active bidirectional communication. An operator dialog is such a communication.
SDVS: A system for verifying microcode correctness
Authors: Leo Marcus, Stephen D. Crocker, Jaisook R. Landauer
Venue: ACM SIGMICRO Newsletter (1984)

This paper is a progress report on an experimental system, the state delta verification system (SDVS), for verifying microcode correctness. The goal of this project is to solve some of the problems, both theoretical and engineering, obstructing the realization of a usable and applicable program for checking proofs of microcode correctness. The ideal result would be a system that could be naturally incorporated into the specification-implementation cycle of, for example, microcoded machine instruction sets.
SIGART(Tutorial Session)
Authors: Ira Goldstein, Gary G. Hendrix
Venue: Proceedings of the 1976 annual conference (1976)

In the effort to construct intelligent computer systems, a primary consideration is how to represent large amounts of knowledge in a fashion that permits their effective use and interaction. Indeed, many researchers in the field of artificial intelligence have come to believe that knowledge representation is the fundamental issue in the attempt to understand intelligence. The presentations in this session explore this issue and describe two current important knowledge representation methodologies: frames and semantic nets.
A structured APL approach to computer aided instruction
Authors: Wilbur R. LePage
Venue: ACM SIGAPL APL Quote Quad (1981)

The APL-based system for Computer Aided Instruction described in this paper is presented as a general purpose system having interest in its own right, and also as an illustration of a &ldquo;structured&rdquo; approach to the solution of a relatively complex computing problem. The system meets the more or less mandatory requirement that neither the student user nor the teacher who creates the CAI instructional material should be required to know APL; but the main features are the ease with which a CAI lesson can be created, edited, and modified by a teacher, the &ldquo;transparency&rdquo; of the APL system with respect to a student user, and a &ldquo;modular&rdquo; design which permits modifications of the system to be made easily. A student employs only one APL function, and there are four functions used in writing the text. Also, in files there are related sets of permanent control functions, and functions and variables related to the text material, which exist in the active workspace only while the system is in use. The system includes a capability for monitoring the progress of students.
Gypsy: A language for specification and implementation of verifiable programs
Authors: Allen L. Ambler, Donald I. Good, James C. Browne, Wilhelm F. Burger, Richard M. Cohen, Charles G. Hoch, Robert E. Wells
Venue: Proceedings of an ACM conference on Language design for reliable software (1977)

An introduction to the Gypsy programming and specification language is given. Gypsy is a high-level programming language with facilities for general programming and also for systems programming that is oriented toward communications processing. This includes facilities for concurrent processes and process synchronization. Gypsy also contains facilities for detecting and processing errors that are due to the actual running of the program in an imperfect environment. The specification facilities give a precise way of expressing the desired properties of the Gypsy programs. All of the features of Gypsy are fully verifiable, either by formal proof or by validation at run time. An overview of the language design and a detailed example program are given.