WorldCat Identities

Schonberg, Edmond

Overview
Works: 23 works in 46 publications in 2 languages and 515 library holdings
Genres: Handbooks and manuals  Academic theses  Technical reports 
Roles: Editor, Author
Publication Timeline
.
Most widely held works by Edmond Schonberg
From linear operators to computational biology : essays in memory of Jacob T. Schwartz by Martin Davis( )

8 editions published between 2012 and 2013 in English and held by 410 WorldCat member libraries worldwide

In his rich and varied career as a mathematician, computer scientist, and educator, Jacob T. Schwartz wrote seminal works in analysis, mathematical economics, programming languages, algorithmics, and computational geometry. In this volume of essays, his friends, students, and collaborators at the Courant Institute of Mathematical Sciences present recent results in some of the fields that Schwartz explored: quantum theory, the theory and practice of programming, program correctness and decision procedures, dextrous manipulation in Robotics, motion planning, and genomics
Ada 2012 reference manual : language and standard libraries : international standard ISO/IEC 8652/2012 (E) by S. Tucker Taft( )

9 editions published between 2012 and 2014 in English and held by 78 WorldCat member libraries worldwide

Annotation
Superconvergence, the Veneziano model and mesons by Edmond Schonberg( )

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

From prototype to efficient implementation : a case study using SETL and C by Edmond Schonberg( Book )

3 editions published between 1985 and 2017 in English and held by 3 WorldCat member libraries worldwide

The efficient termination of Ada tasks in a multiprocessor environment by Susan Flynn Hummel( Book )

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

The efficient termination of Ada tasks in a distributed environment by Courant Institute of Mathematical Sciences( Book )

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

CrossTalk: The Journal of Defense Software Engineering. Volume 21, Number 1( Book )

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

CONTENTS: 1) The Critical Need for Software Engineering Education by Dr. Lyle N. Long: Long describes the need for more dedicated software engineering educational programs and professional software engineering certification programs in the United States. 2) Using Inspections to Teach Requirements Validation by Lulu He, Dr. Jeffrey C. Carver, and Dr. Rayford B. Vaughn: This article describes an experiment conducted in a graduate-level requirements engineering course to provide students a real world experience in requirements validation. 3) Integrating Software Assurance Knowledge Into Conventional Curricula by Dr. Nancy R. Mead, Dr. Dan Shoemaker, and Jeffrey A. Ingalsbe: This article discusses the results of a comparison of the Common Body of Knowledge for Secure Software Assurance with traditional computing disciplines. 4) Software Engineering Continuing Education at a Price You Can Afford by Maj Christopher Bohn, Ph. D.: Maj. Bohn gives detailed information about the Air Force Institute of Technology's Software Professional Development Program. 5) How to Avoid Software Inspection Failure and Achieve Ongoing Benefits by Roger Stewart and Lew Priven: This article describes the proven benefits of inspections and signifies that they are too significant to let them fall by the wayside. 6) Computer Science Education: Where Are the Software Engineers of Tomorrow? by Dr. Robert B.K. Dewar and Dr. Edmond Schonberg: This article briefly examines the set of programming skills that should be part of every software professional's repertoire
The Design of Griffin: A Common Prototyping Language( )

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

This project was the first phase of the development of a language for prototyping large software systems, especially those that will ultimately be implemented in Ada. The Department of Defense has made a commitment to the notion of rapid prototyping as a critical phase in software development that will result in more useful and reliable software systems and lower software maintenance costs. The success and cost-effectiveness of prototyping depends on, among other things, a prototyping language that demonstrates expressiveness, flexibility, and conciseness. Griffin, the language being designed in this project, in intended to meet this need. The Griffin project's approach to language design consists of integrating important language concepts exhibited in various modern programming languages, together with innovation in a number of areas important to large prototyping systems. Griffin features higher-order polymorphic functions, strong typing with type inference, a general tasking and communication facility, an object oriented programming facility, powerful datatypes (such as sets), and support for persistence and transaction based programming. Current efforts are concentrated on integrating the language features into a coherent, robust language design. In the following sections, we provide a brief technical description of some important aspects of Griffin, namely types, persistence, and concurrency
Compilation of array-style programs for distributed memory MIMD machines: A geometric approach by Shemuel Katz( Book )

1 edition published in 1994 in English and held by 1 WorldCat member library worldwide

Distributed memory MIMD (Multiple Instruction Multiple Data) machines are emerging as a cost-effective means of speeding up numerically intensive programs. They scale more easily than other parallel machines. But writing explicitly parallel programs for these machines is both difficult and error prone. Compilers for languages like HPF make the task easier by generating the necessary inter-processor communication from the data distribution directives supplied by the programmer. This dissertation shows that for a large class of array-style programs automatic data distribution can produce a significant speedup on a distributed memory MIMD machine. Array-style programs use array primitives to manipulate entire arrays, rather than looping explicitly over the array elements. APL programs are typically array-style
A program analysis tool evaluating the Ada compiler validation suite by Deborah Rennels( Book )

1 edition published in 1990 in English and held by 1 WorldCat member library worldwide

A practical method for constructing efficient LALR(k) parsers with automatic error recovery by Charles( )

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

A practical framework for LR(k) parsing is introduced. An efficient algorithm incrementally constructs an LALR(k) parser with varying-length lookahead strings, whose symbols are consulted during parsing only when necessary. Currently, effective LR error recovery systems require some user intervention. An effective and fully automated syntactic error recovery method for LR(k) parsers is presented. A generally effective method for compressing LR(k) parsing tables is also presented
The analysis and generation of tests for programming language translators by Deborah J Rennels( Book )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

We first describe the Ada Features Identification System (AFIS), a system which automates test program analysis. AFIS provides three different methods for identifying Ada language features in test programs, ranging from elementary syntactic items to complex context-sensitive combinations of semantic features. Semantic feature combinations are specified by writing program templates in a pattern language which is an extension of Ada, and pattern-matching these templates against test programs
SMARTS, Shared-memory Multiprocessor Ada Run Time Supervisor by Susan Flynn Hummel( Book )

1 edition published in 1989 in English and held by 1 WorldCat member library worldwide

We further reduce the overhead of Ada tasking, by means of micro-tasking, i.e. the explicit scheduling of a family of Ada tasks on a specified number of processors. Thus, Ada tasks are implemented as light weight processes managed by SMARTS, rather than full blown operating systems processes
Efficient loop-level parallelism in Ada by Michael Hind( Book )

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

Parallelism in scientific applications can most often be found at the loop level. Although Ada supports parallelism via the task construct, its coarseness renders it unsuitable for this light-weight parallelism. In this work, we propose Ada constructs to achieve efficient loop-level parallelism in ANSI-Ada. This is accomplished in two steps. First, we present an idiom that allows the specification of light-weight tasks. Second, we give an efficient implementation of this idiom (for a variety of shared memory machines) that is considerably more efficient than a standard Ada task
Taliere: An interactive system for data structuring SETL programs by Robert Michael Straub( Book )

1 edition published in 1988 in English and held by 1 WorldCat member library worldwide

We begin by describing previous work on data structure selection for very high level languages, including the data structure selection performed by the SETL optimizer. We then present a general description of a system for data structure selection for SETL programs. We describe techniques used to obtain useful information from a source program. This includes obtaining symbolic estimates of the execution frequencies of individual program operation, and estimates of the sizes of program objects. The data structures considered by the system are then described. We present a detailed description of the data structure selection algorithm, along with optimizations and heuristics used to improve the execution efficiency of the data structuring system. We conclude with examples comparing choices made by the system with choices made by a competent programmer and speculate on the eventual success of semi-automatic structuring systems
Université de Montpellier. Faculté de droit. La Comptabilité de fait : thèse ... par Edmond Schonberg by Edmond Schonberg( Book )

in French and held by 1 WorldCat member library worldwide

Optimization and garbage collection in Ada programs on shared memory computers by Howard Lawrence Operowsky( Book )

1 edition published in 1989 in English and held by 1 WorldCat member library worldwide

We show that a global optimizer is not required to reduce the overhead of constraint checking in Ada programs. We present a series of data-flow equations for available expressions and use them as the basis for a simple algorithm to eliminate redundant constraint checks. The algorithm is syntax-directed and is executed in a single pass over the source program's abstract syntax tree. No control flow analysis is required. Our algorithm also includes constant propagation using an extended framework and induction variable analysis. Because the algorithm operates on the abstract syntax tree, induction variable analysis is simplified. Although programs with goto statements are not considered, the exit statement is handled fully. We also examine the effects of shared variables and exception handling
A technical tour of ada by Edmond Schonberg( )

1 edition published in 1992 in English and held by 1 WorldCat member library worldwide

Scheduling for horizontal systems : the VLIW paradigm in perspective by Franco Gasperoni( Book )

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

This work focuses on automatic extraction of operation level parallelism from programs originally intended to be sequential. Optimality issues in the framework of very long instruction word architectures and compilers (VLIW) are investigated. Possible advantages of an idealized dynamic scheduler over a purely static one are also explored. More specifically the model and the results of scheduling theory are extended to account for cyclicity and branching capabilities present in sequential programs. The existence of inherent bottlenecks in the VLIW paradigm is substantiated and the advantage of dynamic over static scheduling is demonstrated for certain type of loops. A novel technique for efficient parallelization of straight line loops is presented. A simple scheduling heuristic for arbitrary programs is proven to perform between a constant and a logarithmic factor from appropriately defined optimality criteria. Finally we prove the existence of loops containing branches for which no parallel program can achieve time optimal performance on VLIWs with unlimited resources. The overall aim of the thesis is to identify the family of sequential programs for which the VLIW model of parallel computation is viable
Essays in honor of Jack Schwartz in the year of his 65th birthday( Book )

1 edition published in 1995 in English and held by 1 WorldCat member library worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.50 (from 0.39 for A technica ... to 0.99 for The Design ...)

Languages
English (42)

French (1)