Open Access. Powered by Scholars. Published by Universities.®

Programming languages

Discipline
Institution
Publication Year
Publication
Publication Type
File Type

Articles 31 - 32 of 32

Full-Text Articles in Programming Languages and Compilers

Lazy Evaluation And Nondeterminism Make Backus' Fp-Systems More Practical, Atanas Radenski Jan 1987

Lazy Evaluation And Nondeterminism Make Backus' Fp-Systems More Practical, Atanas Radenski

Mathematics, Physics, and Computer Science Faculty Articles and Research

Backus' FP-systems are made more practical by introducing into them lazy evaluation and nondeterminism. This is done in the framework of a concrete programming language called FP*. From the one hand, this language is almost as mathematical as FP-systems are. From the other hand, it gives the possibility to manage secondary memory and to develop such applications as, for instance, interactive and distributed file systems. Experimental versions of a compiler and an interpreter for the FP* language are implemented.


Specifying And Proving Properties Of Sentinels, Krithivasan Ramamritham, Robert M. Keller Mar 1981

Specifying And Proving Properties Of Sentinels, Krithivasan Ramamritham, Robert M. Keller

All HMC Faculty Publications and Research

This paper presents a technique for specifying and verifying properties of "sentinels," a high-level language construct for synchronizing access to shared resources. Statements in the specification language possess formal temporal semantics. As a prelude to proving the correctness of sentinels, the semantics of constructs used in sentinels is given. The proof technique involves showing that the temporal behavior of a sentinel conforms to that defined by the specification. The methodology is illustrated by applying it to a typical synchronization problem.