DOCSLIB.ORG

PL/I List Processing • PL/I Language Lacked FaciliEs for TreaNg Linked Lists HAROLD LAWSON,JR

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
PL/I List Processing • PL/I Language Lacked Facili�Es for Trea�Ng Linked Lists HAROLD LAWSON,JR The Birth of the Pointer Variable Based upon: Experiences and Reflec;ons of a Computer Pioneer Harold “Bud” Lawson FELLOW FELLOW and LIFE MEMBER IEEE COMPUTER SOCIETY CHARLES BABBAGE COMPUTER PIONEER FELLOW Overlapping Phases • Phase 1 (1959-1974) – Computer Industry • Phase 2 (1974-1996) - Computer-Based Systems • Phase 3 (1996-Present) – Complex Systems • Dedicated to all the talented colleagues that I have worked with during my career. • We have had fun and learned from each other. • InteresMng ReflecMons and Happenings are indicated in Red. Computer Industry (1959 to 1974) • Summer 1958 - US Census Bureau • 1959 Temple University (Introduc;on to IBM 650 (Drum Machine)) • 1959-61 Employed at Remington-Rand Univac • 1961-67 Employed at IBM • 1967-69 Part Time Consultant (Professor) • 1969-70 Employed at Standard Computer Corporaon • 1971-73 Consultant to Datasaab, Linköping • 1973-… Consultant .. Expert Witness.. Rear Admiral Dr. Grace Murray Hopper (December 9, 1906 – January 1, 1992) Minted the word “BUG” – During her Mme as Programmer of the MARK I Computer at Harvard Minted the word “COMPILER” with A-0 in 1951 Developed Math-MaMc and FlowmaMc and inspired the Development of COBOL Grace loved US Navy Service – The oldest acMve officer, reMrement at 80. From Grace I learned that it is important to queson the status-quo, to seek deeper meaning and explore alterna5ve ways of doing things. 1980 – Honarary Doctor The USS Linköpings Universitet Hopper Univac Compiler Technology of the 1950’s Grace Hopper’s Early Programming Languages Math-MaMc FlowmaMc The UNIVAC II Core Memory 2K Words of 12 Decimal Digits/Characters Up to 10 Tape Drives Powerful Intuive InstrucMon Set Off line Typewriter/Punch Card to Tape and Printer The COBOL Implementaon • Grace insisted that we view the compiler as a data processing system • The compiler was implemented in FlowmaMc!!!!! and had approximately 60 passes • I did the inial parser, the code generator and part of the I/O • I called the code generator DUZ (DUZ does everything) • Developed Generalized Algorithms for Decimal Alignment • A parallel implementaMon was done at RCA in Camden, New Jersey • December 1960 - first me the same program compiled-executed on two machines • Seminar 1999 – CHM (Stanford University) with Howard Bromberg Grace was not a very “manageable” person and ofen in conflict with Corporate management. She returned to full-;me Navy service at the Pentagon. Several members of her Automac Programming Department lef Sperry Univac. An important WWII slang term crept into our department vocabulary somemes spelled In tradi;onal Military slang dang back to the Second World War, a blivit was defined as "ten pounds of shit in a five pound bag" (a proverbial descrip;on of anything ugly or unmanageable); it was applied to an unmanageable situaon, a crucial but substandard or damaged tool, or a self-important person. Blivit Avoidance – Finding a limited number of driving concepts and principles that guide thinking, influence decision making and provide a controlled means of ac;ng. The Use of Chain List Matrices for the Analysis MY FIRST PROFESSIONAL PUBLICATION Of COBOL Data Structures H. W. Lawson, Jr. IBM CorporaMon Poughkeepsie, N. Y. THE ANALYSIS, reducMon, and verificaMon • Based on my Univac Experiences of the data hierarchy ulized in COBOL presents a major problem for implementors of the language. The use of • Referred to by Don Knuth – chain list matrices, to be presented in this paper, provides a significant aid in reducing the me required to process the variably structured data elements in a The Art of Computer Programming: COBOL program. Chain list matrices have been developed to provide a means of classifying and Fundamental Algorithms relang the elements of a tree structure. Offered will be definions of tree terminology such as nodes, branches, • First PublicaMon- Algorithms for MulM-Linked roots, leaves, subtrees, branching raos, etc. Examples that explain the structure and meaning of arbitrary order, level order, and subtree order chain list Data Structures matrices will also be presented. 1962 ACM Na5onal Conference Syracuse, New York Provided a good basis for my eventual work on The Pointer Variable. My Time at IBM 1961-67 • Research in Compiler-Compiler techniques, in par;cular SLANG (Systems Language) based upon instrumented Backus-Nauer Form (BNF) notaon. • System/360 announced in 1963. PL/I specified. • Member of the PL/I Language Board and assigned to develop a List-Processing facility for PL/I. • The Birth of the Pointer Variable. • Represented PL/I on the OS/360 Change Control Board and observed the Entropy as the OS implementaon deteriorated. • Manager of Advanced Technology at the New York Programming Center. Start of my interest in Microprogramming and Computer Architecture. An InteresMng and Important SLANG Colleague Don Estridge (1937 – 1985) • Made important contribu;ons to SLANG • A very impulsive person • Led a group of 4 (including me) that implemented a FORTRAN compiler in SLANG over a weekend • Called “the father of the PC era” – as an IBM Vice President - led IBM into the PC market • Made Microsof and Bill Gates what they became as a result of the 1980 agreement. • Tragically died in a crash at Dallas Airport together with his wife. The Pointer Variable - 1964 PL/I List Processing • PL/I Language lacked facili;es for treang linked lists HAROLD LAWSON,JR. • Customer demand to write Graphics Driver rou;nes in PL/I Interna>onal Business Machines Corp., – Especially GM Research Laboratories New York, N. Y. • Plan to implement PL/I (H-level) compiler in PL/I The concepts of list processing have been • Developed the concepts of the Pointer Variable and Based introduced into the PL/I language. With these new facilies, it is possible to write Variables to flexibly treat linked lists. PL/I procedures that operate on simple and complex data list organizaMons. Most • Feedback from Don Knuth and Doug McIlroy. list-processing languages have suffered from their inability to deal directly with • Tried to restart the defini;on and implementaon of PL/I – complex data structures and/or from Would have made PL/I less complex and more useful. their inability to perform the complete range of programming language • Developed a PL/I subset as a Systems Programming operaons upon the data list structures. These two problems have been Language. Implemented and used internally by IBM eliminated in the list-processing facilies • of PL/I. The basic concepts of list PL/I used to implement the Mul;cs OS at MIT processing and the philosophy of the PL/I • Bell Labs backed out of the MIT cooperaon and built Unix language extensions are discussed. In and C heavily using pointers and the Mul;cs concepts. addion, several detailed list-processing examples are provided. • Concepts further implemented in amongst others Pascal, C, C++, Ada, Fortran, COBOL and PL/M. Communicaons of the ACM • When used properly – a powerful programming facility Volunme 10 / Number 6 / June, 1967 used by most all programmers but when not used properly can lead to chaos. • Awarded the IEEE Computer Society Charles Babbage Computer Pioneer Award in 2000 OS/360 – The Black Hole of Complexity • Started with reasonable concepts and Documented in the principles – coding conven;ons Mythical Man Month • As implementaon proceeded more and more projects requested excep;ons • The document pile grow rapidly out of control – nobody read anymore • A cast of about one thousand from around the world joined the deteriorang effort • Every release solved some problems but introduced many more • A root cause – the mismatch between the instruc;on set and the performance goals of the system sofware • The unnecessary complexity created many Dr. Fred Brooks jobs for consul;ng companies • Fred in retrospect stated that OS/360 should have been implemented in PL/I (like Mul;cs) Microprogramming and Computer Architecture • From 1965-67 I was manager of Advanced Technology at the New York Programming Center • One interes;ng aspect of System/360 was the use of microprograms to provide compability between series members. • Several research groups and companies became interested in exploi;ng microprogram capabili;es and this became the focus of my group of six researchers • We developed the no;on of T-Machine and E-Machine architectures • T-Machines implemented microcode to support compilers • E-Machines provided via microcode the run-;me execu;on environments for compiled code • During this ;me, I taught a graduate course at New York University on Programming Languages and Compilers • It was impossible to convince IBM to change direc;ons and so the fruits of our research would not be used - The march into the black hole of complexity proceeded in an accelerated manner. ES EVM ЕС ЭВМ, Единая система электронных вычислительных машин “Unified System of Electronic Computers” In the mid-1970s at the height of the Cold War, the US Government gave the go-ahead to IBM to license 360 technology (including OS/360) to the Soviet Union. There were about 15000 computer developed in Russia and other Eastern Block countries. They never mastered the complexity of OS/360. This probably set Soviet Computer Technology back at least 20 years. This was most likely the inten;on: Export your complexity to your Enemy!!! Note: Several prior Soviet Machines where explicitly addressing the hardware-sofware relaonship in a manner similar to the Burroughs Machines, T and E Machines and the plans for the Datasaab FCPU The March into the Black Hole of Complexity •The IBM System 360 (Plus and Minus) •The Hardware-So‰ware Mismatch and Aempts to Improve •The Birth of the Microprocessor •Early System Sowares for Microprocessors •The Gates- Estridge Agreement in 1980 •The Cemenng of the X86 Instrucon Set •The FuncMonality – Hardware Spiral (WINTEL) •Middleware hides Complexity – it does not remove it •The Market Impact of Inexpensive PC’s and the Internet We Build Ever Increasing Complex SoOware Systems on Hardware that Does not Support the Reduc5on of SoOware Complexity Perhaps it will require a melt down of the Internet before ac5on is taken to improve upon the situa5on Rebirth of the Computer Industry, Communicaons of the ACM, June 2002/Vol.
Load more

Recommended publications
  • Systems Programming in C++ Practical Course
    Systems Programming in C++ Practical Course Summer Term 2019 Course Goals Learn to write good C++ • Basic syntax • Common idioms and best practices Learn to implement large systems with C++ • C++ standard library and Linux ecosystem • Tools and techniques (building, debugging, etc.) Learn to write high-performance code with C++ • Multithreading and synchronization • Performance pitfalls 1 Formal Prerequisites Knowledge equivalent to the lectures • Introduction to Informatics 1 (IN0001) • Fundamentals of Programming (IN0002) • Fundamentals of Algorithms and Data Structures (IN0007) Additional formal prerequisites (B.Sc. Informatics) • Introduction to Computer Architecture (IN0004) • Basic Principles: Operating Systems and System Software (IN0009) Additional formal prerequisites (B.Sc. Games Engineering) • Operating Systems and Hardware oriented Programming for Games (IN0034) 2 Practical Prerequisites Practical prerequisites • No previous experience with C or C++ required • Familiarity with another general-purpose programming language Operating System • Working Linux operating system (e.g. Ubuntu) • Basic experience with Linux (in particular with shell) • You are free to use your favorite OS, we only support Linux 3 Lecture & Tutorial • Lecture: Tuesday, 14:00 – 16:00, MI 02.11.018 • Tutorial: Friday, 10:00 – 12:00, MI 02.11.018 • Discuss assignments and any questions • First two tutorials are additional lectures • Everything will be in English • Attendance is mandatory • Announcements on the website 4 Assignments • Brief non-coding quizzes
    [Show full text]
  • Kednos PL/I for Openvms Systems User Manual
    ) Kednos PL/I for OpenVMS Systems User Manual Order Number: AA-H951E-TM November 2003 This manual provides an overview of the PL/I programming language. It explains programming with Kednos PL/I on OpenVMS VAX Systems and OpenVMS Alpha Systems. It also describes the operation of the Kednos PL/I compilers and the features of the operating systems that are important to the PL/I programmer. Revision/Update Information: This revised manual supersedes the PL/I User’s Manual for VAX VMS, Order Number AA-H951D-TL. Operating System and Version: For Kednos PL/I for OpenVMS VAX: OpenVMS VAX Version 5.5 or higher For Kednos PL/I for OpenVMS Alpha: OpenVMS Alpha Version 6.2 or higher Software Version: Kednos PL/I Version 3.8 for OpenVMS VAX Kednos PL/I Version 4.4 for OpenVMS Alpha Published by: Kednos Corporation, Pebble Beach, CA, www.Kednos.com First Printing, August 1980 Revised, November 1983 Updated, April 1985 Revised, April 1987 Revised, January 1992 Revised, May 1992 Revised, November 1993 Revised, April 1995 Revised, October 1995 Revised, November 2003 Kednos Corporation makes no representations that the use of its products in the manner described in this publication will not infringe on existing or future patent rights, nor do the descriptions contained in this publication imply the granting of licenses to make, use, or sell equipment or software in accordance with the description. Possession, use, or copying of the software described in this publication is authorized only pursuant to a valid written license from Kednos Corporation or an anthorized sublicensor.
    [Show full text]
  • Bjarne Stroustrup
    Bjarne Stroustrup 52 Riverside Dr. #6A +1 979 219 5004 NY, NY 10024 [email protected] USA www.stroustrup.com Education Ph.D. in Computer Science, University of Cambridge, England, 1979 Ph.D. Thesis: Communication and Control in Distributed Computer Systems Thesis advisor: David Wheeler Cand.Scient. in Mathematics with Computer Science, Aarhus University, Denmark, 1975 Thesis advisor: Brian H. Mayoh Research Interests Distributed Systems, Design, Programming techniques, Software development tools, and Programming Languages Professional Experience Technical Fellow, Morgan Stanley, New York, January 2019 – present Managing Director, Division of Technology and Data, Morgan Stanley, New York, January 2014 – present Visiting Professor, Columbia University, New York, January 2014 – present Visiting Professor in the Computer Lab and Fellow of Churchill College, Cambridge University, Spring 2012 Visiting Professor in the Computer Science Department, Princeton University, Fall 2011 The College of Engineering Chair Professor in Computer Science, Department of Computer Science, Texas A&M University, October 2002 – January 2014 Department Head, AT&T Laboratories – Research, Florham Park, New Jersey, July 1995 – October 2002 Distinguished Member of Technical Staff, AT&T Bell Laboratories, Murray Hill, NJ, June 1987 – July 1995 Member of Technical Staff, AT&T Bell Laboratories, Murray Hill, NJ, March 1979 – June 1987 Honors & Awards 2019: Honorary doctor of University Carlos III in Madrid, Spain. 1 2018: The John Scott Legacy Medal and Premium from The Franklin Institute and the City Council of Philadelphia to men and women whose inventions improved the comfort, welfare, and happiness of human kind in a significant way. 2018: The Computer Pioneer Award from The IEEE Computer Society For bringing object- oriented programming and generic programming to the mainstream with his design and implementation of the C++ programming language.
    [Show full text]
  • Awards Handbook
    AWARDS HANDBOOK Recognizing Technical Achievement and Service Revised October 2011 IEEE COMPUTER SOCIETY AWARDS HANDBOOK Recognizing Technical Achievement and Service October 2011 For further information about the Awards Program contact the Awards Administrator at IEEE Computer Society 2001 L Street N.W., Suite 700 Washington, DC 20036-4928 Phone: (202) 371-0101 Fax: (202) 728-9614 [email protected] Table of Contents 1. INTRODUCTION ............................................................................... 1 2. AWARDS COMMITTEE STRUCTURE AND RESPONSIBILITIES 2.1 Awards Committee Membership ............................................. 2 2.2 Awards Subcommittees ........................................................... 2 2.3 Awards Committee General Responsibilities .......................... 3 2.4 Nomination Solicitations .......................................................... 3 2.5 Confidentiality of Nominees' Identities and Committee Deliberations ............................................................................ 3 2.6 Conflict of Interest .................................................................... 4 2.7 Awards Handbook ................................................................... 4 2.8 Publicity for Granted Awards ................................................... 4 3. ADMINISTRATION OF AWARDS 3.1 Who May Nominate? ............................................................... 5 3.2 How To Nominate .................................................................... 5 3.3 Schedule of Nomination
    [Show full text]
  • The People Who Invented the Internet Source: Wikipedia's History of the Internet
    The People Who Invented the Internet Source: Wikipedia's History of the Internet PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 22 Sep 2012 02:49:54 UTC Contents Articles History of the Internet 1 Barry Appelman 26 Paul Baran 28 Vint Cerf 33 Danny Cohen (engineer) 41 David D. Clark 44 Steve Crocker 45 Donald Davies 47 Douglas Engelbart 49 Charles M. Herzfeld 56 Internet Engineering Task Force 58 Bob Kahn 61 Peter T. Kirstein 65 Leonard Kleinrock 66 John Klensin 70 J. C. R. Licklider 71 Jon Postel 77 Louis Pouzin 80 Lawrence Roberts (scientist) 81 John Romkey 84 Ivan Sutherland 85 Robert Taylor (computer scientist) 89 Ray Tomlinson 92 Oleg Vishnepolsky 94 Phil Zimmermann 96 References Article Sources and Contributors 99 Image Sources, Licenses and Contributors 102 Article Licenses License 103 History of the Internet 1 History of the Internet The history of the Internet began with the development of electronic computers in the 1950s. This began with point-to-point communication between mainframe computers and terminals, expanded to point-to-point connections between computers and then early research into packet switching. Packet switched networks such as ARPANET, Mark I at NPL in the UK, CYCLADES, Merit Network, Tymnet, and Telenet, were developed in the late 1960s and early 1970s using a variety of protocols. The ARPANET in particular led to the development of protocols for internetworking, where multiple separate networks could be joined together into a network of networks. In 1982 the Internet Protocol Suite (TCP/IP) was standardized and the concept of a world-wide network of fully interconnected TCP/IP networks called the Internet was introduced.
    [Show full text]
  • Chapter 4 Introduction to UNIX Systems Programming
    Chapter 4 Introduction to UNIX Systems Programming 4.1 Introduction Last chapter covered how to use UNIX from from a shell program using UNIX commands. These commands are programs that are written in C that interact with the UNIX environment using functions called Systems Calls. This chapter covers this Systems Calls and how to use them inside a program. 4.2 What is an Operating System An Operating System is a program that sits between the hardware and the application programs. Like any other program it has a main() function and it is built like any other program with a compiler and a linker. However it is built with some special parameters so the starting address is the boot address where the CPU will jump to start the operating system when the system boots. Draft An operating system typically offers the following functionality: ● Multitasking The Operating System will allow multiple programs to run simultaneously in the same computer. The Operating System will schedule the programs in the multiple processors of the computer even when the number of running programs exceeds the number of processors or cores. ● Multiuser The Operating System will allow multiple users to use simultaneously in the same computer. ● File system © 2014 Gustavo Rodriguez-Rivera and Justin Ennen,Introduction to Systems Programming: a Hands-on Approach (V2014-10-27) (systemsprogrammingbook.com) It allows to store files in disk or other media. ● Networking It gives access to the local network and internet ● Window System It provides a Graphical User Interface ● Standard Programs It also includes programs such as file utilities, task manager, editors, compilers, web browser, etc.
    [Show full text]
  • Lecture 24 Systems Programming in C
    Lecture 24 Systems Programming in C A process is a currently executing instance of a program. All programs by default execute in the user mode. A C program can invoke UNIX system calls directly. A system call can be defined as a request to the operating system to do something on behalf of the program. During the execution of a system call , the mode is change from user mode to kernel mode (or system mode) to allow the execution of the system call. The kernel, the core of the operating system program in fact has control over everything. All OS software is trusted and executed without any further verification. All other software needs to request kernel mode using specific system calls to create new processes and manage I/O. A high level programmer does not have to worry about the mode change from user-mode to kernel-mode as it is handled by a predefined library of system calls. Unlike processes in user mode, which can be replaced by another process at any time, a process in kernel mode cannot be arbitrarily replaced by another process. A process in kernel mode can only be suspended by an interrupt or exception. A C system call software instruction generates an OS interrupt commonly called the operating system trap . The system call interface handles these interruptions in a special way. The C library function passes a unique number corresponding to the system call to the kernel, so kernel can determine the specific system call user is invoking. After executing the kernel command the operating system trap is released and the system returns to user mode.
    [Show full text]
  • R00456--FM Getting up to Speed
    GETTING UP TO SPEED THE FUTURE OF SUPERCOMPUTING Susan L. Graham, Marc Snir, and Cynthia A. Patterson, Editors Committee on the Future of Supercomputing Computer Science and Telecommunications Board Division on Engineering and Physical Sciences THE NATIONAL ACADEMIES PRESS Washington, D.C. www.nap.edu THE NATIONAL ACADEMIES PRESS 500 Fifth Street, N.W. Washington, DC 20001 NOTICE: The project that is the subject of this report was approved by the Gov- erning Board of the National Research Council, whose members are drawn from the councils of the National Academy of Sciences, the National Academy of Engi- neering, and the Institute of Medicine. The members of the committee responsible for the report were chosen for their special competences and with regard for ap- propriate balance. Support for this project was provided by the Department of Energy under Spon- sor Award No. DE-AT01-03NA00106. Any opinions, findings, conclusions, or recommendations expressed in this publication are those of the authors and do not necessarily reflect the views of the organizations that provided support for the project. International Standard Book Number 0-309-09502-6 (Book) International Standard Book Number 0-309-54679-6 (PDF) Library of Congress Catalog Card Number 2004118086 Cover designed by Jennifer Bishop. Cover images (clockwise from top right, front to back) 1. Exploding star. Scientific Discovery through Advanced Computing (SciDAC) Center for Supernova Research, U.S. Department of Energy, Office of Science. 2. Hurricane Frances, September 5, 2004, taken by GOES-12 satellite, 1 km visible imagery. U.S. National Oceanographic and Atmospheric Administration. 3. Large-eddy simulation of a Rayleigh-Taylor instability run on the Lawrence Livermore National Laboratory MCR Linux cluster in July 2003.
    [Show full text]
  • 8297 SYSTEMS PROGRAMMER 1 Nature of Work Under General
    8297 SYSTEMS PROGRAMMER 1 Nature of Work Under general supervision, an employee in this class performs work of considerable difficulty to provide software support through installing and maintaining software systems such as TSO, IMS, TMS, SAS, CICS, WYLBUR, or other major subsystems. Work includes monitoring, debugging, updating and controlling software packages which interface with application programs of the various users. The incumbent works closely with higher level Systems Programmers on the more complex aspects of installations to assure compatibility with existing software/hardware environment. The incumbent participates in self-study and on-the-job training to improve skills in complex systems programming. An irregular work schedule and on-call duty is required of the position. May function as a consultant in the choice of installation and implementation of office automation equipment and software; the assignments involve multiple application, multiple platforms and complex, interdepartmental communications. Performs related work as required. Distinguishing Characteristics Systems Programmer 1 provides software support for systems which affect a large percentage of the user community. Errors in judgment at this level could affect a number of user operations for a period of time; however, the central mainframe system would continue to operate. Systems Programmer 2 provides support for major software systems; errors in judgment at this level could shut-down the entire central mainframe system. Examples of Work Installs and maintains systems software packages or data base management and data communications systems. Receives advanced training to improve techniques and methodologies used in support of complex host resident software packages. Monitors computer performance to identify, correct and/or improve the operational efficiency of the hardware/software configuration.
    [Show full text]
  • Frederick Phillips Brooks, Jr
    Frederick Phillips Brooks, Jr. Biography Frederick P. Brooks, Jr., was born in 1931 in Durham NC, and grew up in Greenville NC. He received an A.B. summa cum laude in physics from Duke and a Ph.D. in computer science from Harvard, under Howard Aiken, the inventor of the early Harvard computers. He joined IBM, working in Poughkeepsie and Yorktown, NY, 1956-1965. He was an architect of the Stretch and Harvest computers and then was the project manager for the development of IBM's System/360 family of computers and then of the Operating System/360 software. For this work he received a National Medal of Technology jointly with Bob O. Evans and Erich Bloch Brooks and Dura Sweeney in 1957 patented an interrupt system for the IBM Stretch computer that introduced most features of today's interrupt systems. He coined the term computer architecture. His System/360 team first achieved strict compatibility, upward and downward, in a computer family. His early concern for word processing led to his selection of the 8-bit byte and the lowercase alphabet for the System/360, engineering of many new 8-bit input/output devices, and introduction of a character-string datatype in the PL/I programming language. In 1964 he founded the Computer Science Department at the University of North Carolina at Chapel Hill and chaired it for 20 years. Currently, he is Kenan Professor of Computer Science. His principal research is in real-time, three-dimensional, computer graphics—“virtual reality.” His research has helped biochemists solve the structure of complex molecules and enabled architects to “walk through” structures still being designed.
    [Show full text]
  • Computer Society Awards
    COMPUTER SOCIETY AWARDS The Computer Society awards program continues to honor technical achievements, education, innovation, and service to the computer profession and to the society. Please visit the society’s awards homepage for more information about our awards program and to obtain nomination forms: The awards program is reviewed continuously as possibilities of new awards are investigated, changes to existing ones are considered, and possible sponsors are sought. Suggestions from volunteers and members are welcomed and encouraged. http://awards.computer.org/ana CONTACT: Rich Belgard 2012 Awards Committee Chair c/o IEEE Computer Society 2001 L St., NW Ste #700 Washington, DC 20036-4910 Phone: 1-202-371-0101 Fax: 1-202-728-9614 email: [email protected] Computer Society Awards Program History The evolution of the society's awards program dates back at least to 1954 with the formation of an ad hoc Awards Committee, reported in the September, 1954 issue of the IRE Transactions in Electronic Computers. Full committee status was provided in 1955 with the revised PGEC bylaws, approved by the IRE Executive Committee, 7 June 1955, and published in the September 1955 issue of the Transactions. Early activities concentrated on interactions with IRE award programs and Fellows activities, with the latter eventually becoming a separate committee. The main awards activity and the program as we practice it today started with the initiation of the W. Wallace McDowell Award in the 1965-66 periods under the chairmanship of Ralph J. Preiss and J.C. Logue. Subsequently, in 1973 Joe Logue initiated the Honor Roll Award. The Eckert-Mauchly award, administered jointly with ACM, was the first presented in 1979, culminating the efforts of Oscar N.
    [Show full text]
  • Blueprint for an Embedded Systems Programming Language
    Blueprint for an Embedded Systems Programming Language Paul Soulier Depeng Li Dept. of Information and Computer Sciences Dept. of Information and Computer Sciences University of Hawaii, Manoa University of Hawaii, Manoa Honolulu, Hawaii 96822 Honolulu, Hawaii 96822 Email: [email protected] Email: [email protected] Abstract Given the significant role embedded systems have, the implications of faulty software is clearly evident. Embedded systems have become ubiquitous and are However, software logic errors are not the only manner found in numerous application domains such as sen- in which a system can malfunction. The Stuxnet virus sor networks, medical devices, and smart appliances. [14] is an example of a failure caused by a malicious Software flaws in such systems can range from minor software attack that ultimately caused an industrial nuisances to critical security failures and malfunc- control system to destroy itself. As Internet connectiv- tions. Additionally, the computational power found in ity becomes increasingly common in embedded sys- these devices has seen tremendous growth and will tems, they too will be susceptible to software-based likely continue to advance. With increasingly powerful security exploits. hardware, the ability to express complex ideas and Many areas of software development have benefitted concepts in code becomes more important. Given the from the improvements made to programming lan- importance of developing safe and secure software guages. Modern languages are more capable of detect- for these applications, it is interesting to observe that ing errors at compile-time through their type system the vast majority of software for these devices is and many of the low-level and error prone aspects of written in the C programming language —an inher- programming have been abstracted away.
    [Show full text]