Program manual : NOR network transduction based on error-compensation : (Reference manual of NOR network transduction programs NETTRA-EL, NETTRA-E2, and NETTRA-E3) /

"Work supported in part by the National Science Foundation under Grant no. GJ-40221."

YAQ : a 360 assembler version of the algorithm Aq and comparison with other PL/I programs /

"UILU-ENG 77 1724."

Data dependence in ordinary programs /

Thesis (M. S.)--University of Illinois at Urbana-Champaign.

NOR network transduction by generalized gate merging and substitution procedures : (principles of NOR network transduction programs NETTRA-G3 and NETTRA-G4) /

Includes bibliographical references.

NOR network transduction procedures based on connectable and disconnectable conditions : principles of NOR network transduction programs NETTRA-G1 and NETTRA-G2 /

Bibliography: p. 63.

Program manual of programs for minimal covering problems : ILLOD-MINIC-B, ILLOD-MINIC-BP, ILLOD-MINIC-BS, ILLOD-MINIC-BA, ILLOD-MINIC-BG /

Includes bibliography references.

The evolution of programs : program abstraction and instantiation /

"NSF-MCS-79-04897."

Transportation of higher-level language programs: exemplified by an ALGOL 68 transportation representation /

Includes bibliographical references.

Measuring the knowledge-content of programs /

Bibliography: p. 41.

NBS minimal BASIC test programs : version 2, user's manual /

Item 247

A theory for execution-time derivation in real-time programs

We provide an abstract command language for real-time programs and outline how a partial correctness semantics can be used to compute execution times. The notions of a timed command, refinement of a timed command, the command traversal condition, and the worst-case and best-case execution time of a command are formally introduced and investigated with the help of an underlying weakest liberal precondition semantics. The central result is a theory for the computation of worst-case and best-case execution times from the underlying semantics based on supremum and infimum calculations. The framework is applied to the analysis of a message transmitter program and its implementation. (c) 2005 Elsevier B.V. All rights reserved.

Progress in deriving concurrent programs: Emphasizing the role of stable guards

We present some techniques to obtain smooth derivations of concurrent programs that address both safety and progress in a formal manner. Our techniques form an extension to the calculational method of Feijen and van Casteren using a UNITY style progress logic. We stress the role of stable guards, and we illustrate the derivation techniques on some examples in which progress plays an essential role.

An experiment in the design of distributed programs

This paper describes an experiment in the design of distributed programs. It is based on the theory of Owicki and Gries extended with rules for reasoning about message passing. The experiment is designed to test the effectiveness of the extended theory for designing distributed programs.

Termination of real-time programs: Definitely, definitely not, or maybe

Real-time control programs are often used in contexts where (conceptually) they run forever. Repetitions within such programs (or their specifications) may either (i) be guaranteed to terminate, (ii) be guaranteed to never terminate (loop forever), or (iii) may possibly terminate. In dealing with real-time programs and their specifications, we need to be able to represent these possibilities, and define suitable refinement orderings. A refinement ordering based on Dijkstra's weakest precondition only copes with the first alternative. Weakest liberal preconditions allow one to constrain behaviour provided the program terminates, which copes with the third alternative to some extent. However, neither of these handles the case when a program does not terminate. To handle this case a refinement ordering based on relational semantics can be used. In this paper we explore these issues and the definition of loops for real-time programs as well as corresponding refinement laws.

A state-of-practice questionnaire on verification and validation for concurrent programs

Research in verification and validation (V&V) for concurrent programs can be guided by practitioner information. A survey was therefore run to gain state-of-practice information in this context. The survey presented in this paper collected state-of-practice information on V&V technology in concurrency from 35 respondents. The results of the survey can help refine existing V&V technology by providing a better understanding of the context of V&V technology usage. Responses to questions regarding the motivation for selecting V&V technologies can help refine a systematic approach to V&V technology selection.