Extensible control structures

Prenner, Charles J.

doi:10.1145/800021.808301

Cited by 4 publications

(1 citation statement)

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These synch functions, the code for which will be synthesized by SYNVER, provide the only means by which processes may communicate. Synch functions may be either monitor procedures [Hoare74]; calls on Prenner's control interpreter [Pren73], or procedures utilizing Dijkstra's P and V operations [Steele75]. Both SAL and the verification technique are independent of the choice of synchronization primitives used, i.e., SYNVER can synthesize synch functions which utilize any of these various sets of lower level primitives.…”

Section: Overview Of the Synver Systemmentioning

confidence: 99%

Verifying formal specifications of synchronous processes

Griffiths¹,

Prenner²

1976

Proceedings of the 3rd ACM SIGACT-SIGPLAN Symposium on Principles on Programming Languages - POPL '76

Self Cite

View full text Add to dashboard Cite

SYNVER is an automatic programming system for the synthesis of solutions to problems of synchronization among concurrent processes from specifications written in a high level assertion language (SAL). The correctness of the solutions constructed by SYNVER follows from the soundness of the synthesizer itself and from a verification phase which is applied to the specifications. This verification phase is the main topic of this paper. To provide context for the verification the paper includes a discussion of synchronization problems and a brief overview of both the SYNVER system and the SAL specification language. A formal definition of the correctness of a SAL specification is then presented along with algorithms which may be used to determine if a given specification is correct.

show abstract

Section: Overview Of the Synver Systemmentioning

confidence: 99%

Verifying formal specifications of synchronous processes

Griffiths¹,

Prenner²

1976

Proceedings of the 3rd ACM SIGACT-SIGPLAN Symposium on Principles on Programming Languages - POPL '76

Self Cite

View full text Add to dashboard Cite

show abstract

Control extension in a recursive language

Lindstrom

1973

BIT

View full text Add to dashboard Cite

Abstract.Techniques for language extension are of interest today as a means for language design experimentation without language proliferation. Attention thus far has been focused on methods for data structure definition and manipulation. The problem of program control extensibility has been recognized by workers in the field but less thoroughly treated. This paper outlines an approach to control extensibility applicable on the source language level to appropriate programming languages.Using the recursive language LISP as an example, extensions are defined that provide call by name function parameters, generator functions (as in IPL-V), nondeterministic functions, and general coroutines. LISP facilitates this exercise by features including dynamic scope of variables, source programs manipulatable as data, simplicity of program state representations, and control over context of function evaluation. The results of this paper suggest criteria for evaluating base languages in extensible programming systems, as well as a possible insight into formal program analysis. I. Language extension. A. Rationale.Unlike natural languages, new programming languages are tantalizingly easy to create. Our appetite for new languages is whetted by the continual development of new programming problems, new modes of computing, and new computing environments. What language today is suitable for the interactive development of a system modeling urban growth to be run on a distributed computer network ?New languages cannot be welcomed, however, if their new power comes at the cost of isolation from existing languages. The concept of extensible language systems ([4], [5]) is an approach to the orderly absorption of new languages. In such systems a base language L B is equipped with a definitional component L D in which extensions are defined mapping a new language L N into L B. Brown has surveyed these systems recently [2].B. Objectives.

show abstract

A model and stack implementation of multiple environments

1973

View full text Add to dashboard Cite

Many control and access environment structures require that storage for a procedure activation exist at times when control is not nested within the procedure activated. This is straightforward to implement by dynamic storage allocation with linked blocks for each activation, but rather expensive in both time and space. This paper presents an implementation technique using a single stack to hold procedure activation storage which allows retention of that storage for durations not necessarily tied to control flow. The technique has the property that, in the simple case, it runs identically to the usual automatic stack allocation and deallocation procedure. Applications of this technique to multitasking, coroutines, backtracking, label-valued variables, and functional arguments are discussed. In the initial model, a single real processor is assumed, and the implementation assumes multiple-processes coordinate by passing control explicitly to one another. A multiprocessor implementation requires only a few changes to the basic technique, as described.This paper presents a new approach to the analysis of performance of the various key-to-address transformation methods. In this approach the keys in a file are assumed to have been selected from the key space according to a certain probabilistic selection algorithm. All files with the same number of keys selected from this key space will be suitably weighted in accordance with the algorithm, and the average performance of the transformation methods on these files will be used as the potential of these methods. Using this analysis, methods with the same overall performance can be classified and key distributions partial to certain transformations can be identified. All this can be done analytically. The approach is applied to a group of transformation methods using files whose keys are selected randomly.

show abstract

Extensible control structures

Cited by 4 publications

References 2 publications

Verifying formal specifications of synchronous processes

Verifying formal specifications of synchronous processes

Control extension in a recursive language

A model and stack implementation of multiple environments

Contact Info

Product

Resources

About