1,205 papers · page 57 of 61
A technique for solving synchronization problems in distributed programs is described.Use of this technique in environments in which processes may fail is discussed.The technique can be used to solve synchronization problems directly, to implement new synchronization mechanisms (…
A variety of matters related to formal differentiation are considered.First, an algebraic approach to formal differentiation of a class of set theoretic expressions is suggested.Then the application of formal .differentiationto loop fusion is discussed.Finally, formal differentia…
Statistical measurements of the behavior of LISP programs have shown a marked asymmetry in the distribution of their data structures (binary trees).On the basis of a statistical model for such a distribution, we evaluate the expected storage cost of a representation of binary tre…
The use of "default reductions" in implementing LR parsers is considered in conjunction with the desire to decrease the number of states of the parser by making use of "don't-care" (also called "inessential" ) error entries.Default reductions are those which are performed indepen…
Many portable compilers generate an intermediate code that is subsequently translated into the target machine's assembly language.In this paper a stack-machine-based intermediate code suitable for algebraic languages (e.g., PASCAL, C, FORTRAN) and most byte-addressed mini-and mic…
Our earlier work on abstract data types is extended by the answers to a number of questions on the power and limitations of algebraic specification techniques and by an algebraic treatment of parameterized data types like sets-of-( ) and stacks-of-().The "hidden function" problem…
Reynolds' technique for deriving interpreters is extended to derive compilers from continuation semantics.The technique starts by eliminating h-variables from the semantic equations through the introduction of special-purpose combinators.The semantics of a program phrase may be r…
The data-flow architecture is intended to support large scientific computations, and VAL is an algebraic, procedural language for use on a data-flow computer.VAL is apt for numerical computations but requires an error monitoring feature that can be used to diagnose and correct er…
Syntactic DefinitionsIn view of the proliferation of notations for defining the syntax of programming languages, it has been suggested that a simple notation should be adopted as a standard.However, any notation adopted as a standard should also be as versatile as possible.For th…
The development of the algebraic approach to reasoning about functional programs that was introduced by Backus in his Turing Award Lecture is furthered.Precise definitions for the foundations on which the algebra is based are given, and some new expansion theorems that broaden th…
~While-least-cost~ error correction is fundamentally important to context-free language processing, it is inefficient w'Qhemdone globally.A locally least-cost repair method has been devised to model error recovery in conventional-~o-mpile]ts.The principles of this recovery techni…
article Free Access Share on A Multiprocessing Approach to Compile-Time Symbol Resolution Authors: F. André Institut de recherche en informatique et systèmes aléatoires (IRISA), Campus de Beaulieu, Avenue du General Leclerc, 35042--Rennes Cédex, France Institut de recherche en in…
A new proposal for synchronization and communication in parallel programs is presented.The proposal synthesizes and extends aspects of procedures, coroutines, critical regions, messages, and monitors.It provides a single notation for parallel programming with or without shared va…
A survey of various results concerning Hoare's approach to proving partial and total correctness of programs is presented.Emphasis is placed on the soundness and completeness issues.Various proof systems for while programs, recursive procedures, local variable declarations, and p…
The design of languages for programming complex discrete-event simulations, with a conventional global notion of simulation time, is considered.An example language is described in which the main objects dealt with are concrete manifestations of phases of activity conceptually und…
article Free Access Share on The Programming Language Aspects of ThingLab, a Constraint-Oriented Simulation Laboratory Author: Alan Borning Department of Computer Science, FR-35, University of Washington, Seattle, WA Department of Computer Science, FR-35, University of Washington…
InputInput tools, originally introduced as a language model for interactive systems and based on high-level, input-driven objects, have been developed into a model for communicating parallel processes, called the input tool process model (ITP).In this model every process contains…
Text is not the only data that needs editing.For example, interactive debuggers edit data structures internal to running programs.This paper describes eds, a generalized editor that allows users to edit arbitrary data structures.Examples show eds maintaining simple databases, edi…
A compiler-based system DAISTS that combines a data-abstraction implementation language (derived from the SIMULA class) with specification by algebraic axioms is described.The compiler, presented with two independent syntactic objects in the axioms and implementing code, compiles…
We consider three kinds of mathematical objects which can be designated as the "meaning" or "semantics" of programs: binary relations between initial and final states, binary relations on predicates (partial-correctness semantics), and functionals from predicates to predicates (p…