WorldCat Identities

Luckham, David C.

Overview
Works: 80 works in 166 publications in 3 languages and 1,540 library holdings
Genres: Programmed instruction 
Roles: Author, Author of introduction, Editor
Classifications: QA76.73.A54, 005.13
Publication Timeline
.
Most widely held works by David C Luckham
ANNA, a language for annotating Ada programs : reference manual by David C Luckham( Book )

18 editions published in 1987 in 4 languages and held by 320 WorldCat member libraries worldwide

This reference manual of ANNA is another volume addressed to the ADA community. ANNA is a language extension of ADA to include facilities for formally specifying the intended behavior of ADA programs. It is designed to meet a perceived need to augment ADA with precise machine-processable annotations so that well established formal methods of specification and documentation can be applied to ADA programs. The current ANNA design includes annotations of all ADA constructs except tasking. Similar extensions for formal specification can be made to other Algol-like languages such as Pascal, PL/1, Concurrent Pascal, and Modula; essentially, these extensions would be subsets of ANNA. The design of ANNA was undertaken from the beginning with four principal considerations: 1. Constructing annotations should be easy for the ADA programmer and should depend as much as possible on notation and concepts of ADA. 2. ANNA should possess language features that are widely used in the specification and documentation of programs. 3. ANNA should provide a framework within which the various established theories of formally specifying programs may be applied to ADA. 4. Annotations should be equally well suited for different possible applications during the life cycle of a program. Such applications include not only testing, debugging and formal verification of a finished program, but also specification of program parts during the earlier stages of requirements analysis and program design
Programming with specifications : an introduction to ANNA, a language for specifying Ada programs by David C Luckham( Book )

10 editions published between 1990 and 2012 in English and Italian and held by 218 WorldCat member libraries worldwide

The power of events : an introduction to complex event processing in distributed enterprise systems by David C Luckham( Book )

15 editions published between 2002 and 2010 in English and held by 215 WorldCat member libraries worldwide

Complex Events Processing technology allows users of a system to specify the information that is of interest to them at any given moment. This text shows how to use the technology to build enterprise IT applications with flexibility
Event processing for business : organizing the real-time enterprise by David C Luckham( Book )

12 editions published in 2012 in English and held by 72 WorldCat member libraries worldwide

"Find out how Events Processing (EP) works and how it can work for you. Business Event Processing: An Introduction and Strategy Guide thoroughly describes what EP is, how to use it, and how it relates to other popular information technology architectures such as Service Oriented Architecture.Explains how sense and response architectures are being applied with tremendous results to businesses throughout the world and shows businesses how they can get started implementing EPShows how to choose business event processing technology to suit your specific business needs and how to keep costs of adopting it downProvides practical guidance on how EP is best integrated into an overall IT strategy and how its architectural styles differ from more conventional approachesThis book reveals how to make the most advantageous use of event processing technology to develop real time actionable management information from the events flowing through your company's networks or resulting from your business activities. It explains to managers and executives what it means for a business enterprise to be event-driven, what business event processing technology is, and how to use it"--
Trigonometry by David C Luckham( Book )

10 editions published between 1960 and 1962 in English and held by 35 WorldCat member libraries worldwide

Analytic trigonometry; a programmed course by David C Luckham( Book )

6 editions published in 1962 in English and held by 30 WorldCat member libraries worldwide

ANNA A Language for Annotating Ada Programs by David C Luckham( )

1 edition published in 1987 in English and held by 23 WorldCat member libraries worldwide

Solid geometry : a programmed course by David C Luckham( Book )

6 editions published in 1962 in English and held by 15 WorldCat member libraries worldwide

On automating the construction of programs by Jack R Buchanan( Book )

3 editions published in 1974 in English and held by 7 WorldCat member libraries worldwide

Solid geometry by David C Luckham( Book )

in English and held by 6 WorldCat member libraries worldwide

Stanford Pascal verifier user manual by D. C Luckham( Book )

2 editions published in 1979 in English and held by 5 WorldCat member libraries worldwide

Refinement theorems in resolution theory by David C Luckham( Book )

2 editions published in 1969 in English and held by 5 WorldCat member libraries worldwide

The paper discusses some basic refinements of the Resolution Principle which are intended to improve the speed and efficiency of theorem-proving programs based on this rule of inference. It is proved that two of the refinements preserve the logical completeness of the proof procedure when used separately, but not when used in conjunction. The results of some preliminary experiments with the refinements are given. (Author)
ADAM, an ADA based language for multi-processing by D. C Luckham( Book )

2 editions published between 1981 and 1983 in English and held by 5 WorldCat member libraries worldwide

The Adam compiler has been used to build an Ada compiler for most of the July 1980 Ada language design including task types and rendezvous constructs. This was achieved by implementing algorithms translating Ada tasking into Adam parallel processing as a preprocessor to the Adam compiler. This present Ada compiler, which has been operational since December 1980, uses a procedure call implementation of tasking (due to Haberman and Nassi and to Stevenson). It can be easily modified to other implementations. Compilation of Ada tasking into a high level target language such as Adam facilitates studying questions of correctness and efficiency of various compilation algorithms, and code optimizations specific to tasking, e.g. elimination of unnecessary thread of control
Automatic program verificatin III : a methodology for verifying programs by Friedrich W. v Henke( Book )

3 editions published in 1974 in English and Undetermined and held by 5 WorldCat member libraries worldwide

The paper investigates methods for applying an on-line interactive verification system designed to prove properties of PASCAL programs. The methodology is intended to provide techniques for developing a debugged and verified version starting from a program, that (a) is possibly unfinished in some respects, (b) may not satisfy the given specifications, e.g., may contain bugs, (c) may have incomplete documentation, (d) may be written in non-standard ways, e.g., may depend on user- defined data structures. The methodology involves (1) interactive application of a verification condition generator, an algebraic simplifier and a theorem-prover; (2) techniques for describing data structures, type constraints, and properties of programs and subprograms (i.e. lower level procedures); (3) the use of (abstract) data types in structuring programs and proofs
Automatic program verification V : verification-oriented proof rules for arrays, records and pointers by David C Luckham( Book )

3 editions published in 1976 in English and Undetermined and held by 4 WorldCat member libraries worldwide

A practical method is presented for automating in a uniform way the verification of Pascal programs that operate on the standard Pascal data structures ARRAY. RECORD, and POINTER. New assertion language primitives are introduced for describing computational effects of operations on these data structures. Axioms defining the semantics of the new primitives are given. Proof rules for standard Pascal operations on pointer variables are then defined in terms of the extended assertion language. Similar rules for records and arrays are special cases. An extensible axiomatic rule for the Pascal memory allocation operation, NEW, is also given. These rules have been implemented in the Stanford Pascal program verifier. Examples illustrating the verification of programs which operate on list structures implemented with pointers and records are discussed. These include programs with side-effects
Hardware design and simulation in VAL/VHDL by Alec G Stanculescu( Book )

1 edition published in 1991 in English and held by 4 WorldCat member libraries worldwide

Automatic program verification by Shirō Igarashi( Book )

3 editions published in 1973 in English and held by 4 WorldCat member libraries worldwide

Defining the semantics of programming languages by axioms and rules of inference yields a deduction system within which proofs may be given that programs satisfy specifications. The deduction system herein is shown to be consistent and also deductive complete with respect to Hoare's system. A subgoaler for the deductive system is described whose input is a significant subset of Pascal Programs plus inductive assertions. The output is a set of verification conditions or lemmas to be proved. Several non-trivial arithmetic and sorting programs have been shown to satisfy specifications by using an interactive theorem prover to automatically generate proofs of the verification conditions. Additional components for a more powerful verification system are under construction. (Author)
ADA exceptions specification and proof techniques by David C Luckham( Book )

1 edition published in 1980 in English and held by 3 WorldCat member libraries worldwide

A method of documenting exception propagation and handling in Ada programs is proposed. Exception propagation declarations are introduced as a new component of Ada specifications. This permits documentation of those exceptions that can be propagated by a subprogram. Exception handlers are documented by entry assertions. Axioms and proof rules for Ada exceptions are given. These rules are simple extensions of previous rules for Pascal and define an axiomatic semantics of Ada exceptions. As a result, Ada programs specified according to the method can be analysed by formal proof techniques for consistency with their specifications, even if they employ exception propagation and handling to achieve required results (i.e. non error situations). Example verifications are given. (Author)
Automatic program verification IV : proof of termination within a weak logic of programs by David C Luckham( Book )

2 editions published in 1975 in Undetermined and English and held by 3 WorldCat member libraries worldwide

A weak logic of programs is a formal system in which statements that mean 'the program halts' cannot be expressed. In order to prove termination, we would usually have to use a stronger logical system. In this paper we show how we can prove termination of both iterative and recursive programs within a weak logic by adding pieces of code and placing restrictions on loop invariants and entry conditions. Thus, most of the existing verifiers which are based on a weak logic of programs can be used to prove termination of programs without any modification. We give examples of proofs of termination and of accurate bounds on computation time that were obtained using the Stanford Pascal program verifier. (Author)
Hardware Design and Simulation in Val/Vhdl by Larry M Augustin( )

2 editions published in 1991 in English and held by 0 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.63 (from 0.35 for Analytic t ... to 0.89 for ANNA A Lan ...)

ANNA, a language for annotating Ada programs : reference manual
Alternative Names
David Luckham American computer scientist

Luckham, David.

Languages
Covers
The power of events : an introduction to complex event processing in distributed enterprise systemsEvent processing for business : organizing the real-time enterpriseHardware design and simulation in VAL/VHDL