WorldCat Identities

Flon, Lawrence

Overview
Works: 7 works in 21 publications in 1 language and 53 library holdings
Classifications: QA76.6, 001.642
Publication Timeline
Key
Publications about  Lawrence Flon Publications about Lawrence Flon
Publications by  Lawrence Flon Publications by Lawrence Flon
Most widely held works by Lawrence Flon
Fundamental structures of computer science by William Allan Wulf ( Book )
2 editions published in 1981 in Undetermined and English and held by 20 WorldCat member libraries worldwide
On the design and verification of operating systems by Lawrence Flon ( Book )
7 editions published between 1977 and 1981 in English and Undetermined and held by 11 WorldCat member libraries worldwide
This thesis applies and extends mathematical program verification to systems programs. The design methodology is based upon the use of abstract data types and the construction and verification of both specifications and implementations for them. The abstract data type is a means of modularization which encapsulates the representation of a data structure and the algorithms which operate directly upon it. The specification technique appeals to various mathematical structures (e.g. sets and sequences) to describe an abstract state for objects of a given type. The correctness of the formal specifications is cast in terms of the proof of certain invariant properties of the abstract state. An axiomatic proof rule is given to formulate the theorems necessary for proving the invariance of predicates across formal specifications. The applicability of the methodology to operating systems is explored. It is found that a hierarchical decomposition is most amenable to verification, and that the implementation language used is a function of that hierarchy. The example of a process dispatcher module of a hypothetical operating system is used to illustrate the process of design, specification, implementation, and verification using the methodology. Various properties are proven of the abstract specifications, including one representation of the concept of fair service. Programs are then written for the specifications and their correctness is verified
Nondeterminism and the correctness of parallel programs by Lawrence Flon ( Book )
4 editions published in 1977 in English and Undetermined and held by 7 WorldCat member libraries worldwide
This paper presents the weakest preconditions which describe weak correctness, blocking, deadlock, and starvation for nondeterministic programs. A procedure for converting parallel programs to nondeterministic programs is described, and the correctness of various example parallel programs is treated in this manner. Among these are a busy-wait mutual exclusion scheme, and the problem of the Five Dining Philosophers
A survey of some issues concerning abstract data types by Lawrence Flon ( Book )
3 editions published in 1974 in English and held by 6 WorldCat member libraries worldwide
The author attempts in this survey to define the notion of 'abstract data type' and discusses several important issues related to their use in high level languages, including encapsulation, exportation, parameterization, pointers, extent, coercion, assignment, initialization, and literals. The programming languages Algol 68, Simula 67, and PASCAL are chosen as a representative set of type-extendable languages and are compared and contrasted as to their treatment of these issues. Proposals for new languages or facilities made by Liskov, Wulf, and Morris are included in the discussion
Consistent and complete proof rules for the total correctness of parallel programs by Lawrence Flon ( Book )
2 editions published in 1978 in English and held by 4 WorldCat member libraries worldwide
Program design with abstract data types by Lawrence Flon ( Book )
2 editions published in 1975 in English and held by 4 WorldCat member libraries worldwide
Program Design With Abstract Data Types by L Flon ( Book )
1 edition published in 1975 in English and held by 1 WorldCat member library worldwide
This paper explores the use of abstract data types as a modularization and structuring technique in the design of programs, particularly larger programs including compilers and operating systems. The concepts of type and type definition are discussed. Some data structuring mechanisms are generalized and several simple examples are presented. The examples increase in complexity and conclude with the design of a directory system, illustrating the power of data types as a design tool
 
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.64 (from 0.47 for Program De ... to 0.92 for Program de ...)
Languages
English (18)