1,205 papers · page 58 of 61
Icon is a new programming language that includes a goal-directed expression evaluation mechanism.This mechanism is based on generators--expressions that are capable of producing more than one value.If the value produced by a generator does not lead to a successful result, the gen…
Parallelism gleaned from concurrent evaluation of subexpressions in a multiprocessor designed for parallel evaluation of recursive programs can lead to the generation of unnecessary computations.Even when these unnecessary computations do not threaten to overwhelm the system, it …
PDS is a set of procedures that provides a machine-independent method of file specification.PDS provides capabilities beyond those provided by many vendorsupplied systems.In addition, because PDS is portable, additional capabilities, such as protection schemes, file usage statist…
A space-efficient strategy for storing attributes during evaluation of an attribute grammar is presented.Attributes are classified as either one-pass or multipass.One-pass attributes are stored on a pushdown stack, and their storage is freed when no longer needed.Examination of e…
article Free Access Share on Compilation of Acyclic Smooth Programs for Parallel Execution Authors: Otto C. Juelich Missile Systems Division, Rockwell International, Columbus, OH Missile Systems Division, Rockwell International, Columbus, OHView Profile , Clinton R. Foulk Departm…
Although determinisitic pushdown automata and LR(k) parsers are formally equivalent, the latter (unlike the former) stack one symbol for each input symbol read.By relaxing this requirement, we obtain a class of LR parsers that can perform finite state recognition locally without …
A simple linear time and space algorithm that transforms a standardized tree representation of an arithmetic expression lacking operator precedence information into a tree containing it is presented.The approach has applications in modularizing compilers, since the transformation…
The combination of coroutines with recursive procedures is characteristic of many modern higher level languages offering advanced control structures (e.g., SIMULA-67, SL5, or INTERLISP). We say a language has block-structured coroutines (BSCRs) when static nesting considerations …
article An Exercise in Program Explanation Share on Author: Jayadev Misra Department of Computer Sciences, College of Natural Sciences, The University of Texas at Austin, Austin, TX Department of Computer Sciences, College of Natural Sciences, The University of Texas at Austin, A…
A program notation without variables is proposed.The state of a computation is recorded as a set of "associons."Each associon is a tuple of names representing a relation between the entities with those names.The state of the computation can be changed by the creation of new assoc…
SETL is a very-high-level programming language supporting set-theoretic syntax and semantics.It allows algorithms to be programmed rapidly and succinctly without requiring data-structure declarations to be supplied.Such declarations can be manually specified later, without recodi…
article Free Access Share on A Statement-Oriented Approach to Data Abstraction Author: J. Steensgaard-Madsen DIKU, Sigurdsgade 41, DK-2200 Copenhagen N, Denmark DIKU, Sigurdsgade 41, DK-2200 Copenhagen N, DenmarkView Profile Authors Info & Claims ACM Transactions on Programming L…
A new approach to information flow in sequential and parallel programs is presented. Flow proof rules that capture the information flow semantics of a variety of statements are given and used to construct program flow proofs. The method is illustrated by examples. The application…
An axiomatic proof system is presented for proving partial correctness and absence of deadlock (and failure) of communicating sequential processes. The key (meta) rule introduces cooperation between proofs, a new concept needed to deal with proofs about synchronization by message…
The empirical testing of error repair schemes for skeletons of source programs in a block-structured language leads to the problem of generating balanced parenthesis strings in a uniform random manner. An efficient generator which works from left to right must compute the correct…
In a recent paper C.A.R. Hoare outlined a language for concurrent programming. Guarded commands and nondeterminism are two features of the language. This paper points out two problems that arise in connection with these features and addresses one of them.
Automatic storage management requires that one identify storage unreachable by a user's program and return it to free status. One technique maintains a count of the references from user's programs to each cell, since a count of zero implies the storage is unreachable. Reentrant s…
Two approaches to the development of efficient and correct iterative programs are contrasted: the construction of an iterative program and a proof of its correctness using invariant assertions of loops, and the construction and proof of a recursive program with a subsequent trans…