DOCSLIB.ORG

Computing with REAL-TIME SYSTEMS

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Computing with REAL-TIME SYSTEMS Volume 2 Proceedings of the Second European Seminar University of Erlangen - Nürnberg Computing with REAL-TIME SYSTEMS Volume 2 Proceedings of the Second European Seminar University of Erlangen - Nürnberg Edited by 1.C. PYLE AERE Harwe/1 and P. ELZER University of Erlangen TRANSCRIPTA BOOKS 30 Crr1ven Street, Strand, London WC2 (t b) Publisher: S. Chomet © Copyright P. ELZER and 1. C. PYLE where not otherwise noted Printed in the United Kingdom by Shortlands Press Ltd, London 2 CONTENTS 5 PREFACE GENERAL CONSIDERATIONS ON REAL-TIME PROGRAMMING 9 Experiences with languages for real-time programming D.R.FROST 15 Standard software versus high-level languages R. C.HUTTY /P.W. HEYWOOD (Speaker) 19 Which programming languages for minicomputers in process control? V.HAASE 23 The influence of the structure of high-level languages on the efficiency of object code G.MUSSTOPF 29 Efficiency of programming in higher-level languages H.MITTENOORF 34 Workshop on general considerations on real-time programming BASIC DESIGN PRINCIPLES OF OPERATING SYSTEMS 39 Adaptive operating systems H.WETTSTEIN 43 Description of operating systems in terms of a virtual machine H-P.ROST 46 Interrupt handling in real-time control systems R.BAUMANN 53 Choosing a standard high-level language for real-time programming M.G. SCHOMBERG, and P.WARD 57 Use of high- and low-level languages in a real-time system J.STENSON 61 Workshop on basic design principles of operating systems COMPONENTS OF REAL-TIME SYSTEMS 65 Basic supervisor facilities for real-time I.C.PYLE 3 70 Software aspects of the UMIST hybrid J. N. HAMBURY 75 Process scheduling by output considerations G. McC. HAWORTH 81 CALAS70 - a real-time operating system based on pseudo­ processors G.HEPKE 84 A dynamic adaptive scheduling scheme for a real-time operating system H. HERBSTREITH 87 Workshop on components of real-time systems SPECIAL SYSTEMS AND SYSTEM FEATURES 91 Simulation du deroulement logique de programmes de commande de spectrometres h. neutrons Ph. BLANCHARD, Ph. LEDEBT, and M.TAESCHNER 96 An implementation of a virtual CAMAC processor A. LANGSFORD 99 An implementation of the assembly language and program assembler for a virtual CAMAC processor V.J.HOWARD 106 System software real-time testing aids W.E. QUILLIN 112 Testing and diagnostic aids for real-time programming E.C.SEDMAN 115 Real-time programming using a real-time language of intermediate level B.EICHENAUER 121 Workshop on special systems and system features 123 CLOSING ADDRESS 125 AUTHOR INDEX 4 PREFACE Following the First European Seminar on Real-Time Programming at Harwell in April 1971, this Second Seminar was held at Uie University of Erlangen, Nürnberg, in April 1972. lt was organised by P. Elzer of the Physikalisches Institut of the University, assisted by Mrs Brehm, with further help from K. Pelz and P. Holleczek. As at the first seminar, special periods were allocated for 'workshop' discussion sessions covering particular areas, and notes on these discussions are included. (The absence of identification of the speakers in these discussions is deliberate, to emphasise that speakers' views are personal and do not necessarily represent those of their institutions.) The papers presented and workshop notes were prepared for publica­ tion by P. Elzer and I. C. Pyle. 5 GENERAL CONSIDERATIONS ON REAL-TIME PROGRAMMING Chairman: Prof. Dr R. LAUBER 7 EDITORS IAN C. PYLE, MA, PhD {Cantab) has been working with computer software since 1956, particularly concerned with programming systems (Hartran on the ICL Atlas Computer), multi-access sys­ tems (HUW on the IBM 360 computer at Harwell), and multi-computer command and control systems. He is now Professor of Computer Science at the University of York. PETER ELZER, MA {Erlangen) has been working with computers since 1966, at the Physics Institute of the University of Erlangen. His early work concerned the development of a programming system for application to nuclear physics experiments. He was one of the initiators of the PEARL project and is now leader of a PEARL implement team at the Physics Institute. Since 1971 he has now been involved with the LTP� project, of which he is now the European Chairman. TRANSCRIPTA BOOKS Experiences with languages for real-time programming D.R. FROST General Electric Co, Phoenix, Arizona, USA Publication rights reserved to D.R. Frost and the General Electric Company At General Electric's Process Computer Opera­ A good programming tool: tion in Phoenix our product consists of real-time 1. Gives the programmer a vocabulary that process data acquisition and control systems, matches his application. with applications including the automation of power 2. Takes care of hardware plants, power distribution, refineries, . chemical. - storage allocation plants; such processes as discrete parts manu­ - controlling peripherals. facturing, steel making; production of cement, 3. Provides non-ferrous metals, paper, textiles, and others. - standard algorithms For these automation systems we provide the - data formats computer and process input;output. We frequently - character codes. provide analysis and programming as well. Since 4. Promotes good design, and allows good economics dictate that we will get no more money design to be maintained as the system for this service than it is worth to our customers, gradually evolves. profitability depends upon our skill in keeping 5. Has self-contained debugging aids, which programming costs down. This paper is about - make mistakes less likely our attempts to lower costs through the use of - make error correction more reliable. higher level programming languages and applica­ 6. Gets rid of 'patches' (machine-oriented tion packages. I will discuss: program corrections] and the dependence 1. What we expect from higher level languages on knowledge of the computer which 'patch­ and application packages. ing' requires. 2. Our specific experiences with these various 7. Aids maintenance of a design as the applica­ types of languages and application packages tion changes. and how successful they have been. 8. Aids maintenance of code as errors are 3. Where we are headed. found and corrected. 4. Lessons we have learned. Good design is probably the biggest cost saver in software production, and good tools encourage good design. An excellent example is the suc­ Expectations cessful language COBOL, which forces the pro­ grammer to define and document his data base. The whole rationale for using higher level (1 suspect that this is actually more a key to languages and application packages is to sa ve sys­ COBOL's success than is its natural English­ tem costs through lowering programming costs. language-like syntax.) There have been many successful tools for various Successful languages and application packages other computer applications: FORTRAN, ALGOL, such as the ones mentioned exist in the compara­ COBOL, LISP, various report generators, sort ti vely orderly world of scientific and business packages, and simulation languages are just a few. data processing. They fit their applications very All of these tools have a common objective: to well. FORTRAN is a good language for mathema­ produce machine-independent source programs. tics and logic. The vocabulary of COBOL Machine independence is often equated with consists of business data processing terms in portability between computers. Yet the truly common use lang before computers. The environ­ important facet of machine independence is not so ment of a sort generator package is orderly files much portability; of more importance, it allows of data. But the term 'real-time programming' the user to implement his solution without all the causes many of us to think simplistically. lt computer-related clutter that gets in his way. makes us believe we will find a single, ultimate To a problem solver this clutter is overhead, with tool for 'real-time programming'. But real-time all of that word's connotation of cost - and he is applications are just as diverse as those for right. He wants independence from the computer. which we use LISP, FORTRAN, and report 9 generators. As a result, we are finding and will In spite of these shortcomings, FORTRAN is in continue to find a multiplicity of 'best' tools for use today. In some companies (and some applica­ real-time systems, depending on the particular tion areas) it is used a great deal. This is applications. possible because of various attempts which have been made to remedy FORTRAN's shortcomings. Good tools for real-time programming must These various attempts ha ve resulted in a provide the same advantages as do existing proliferation of FORTRAN dialects and extensions. successful tools for other applications: We have two ourselves, one predating the 1. Independence from the computer. FORTRAN ANSI standard, the other based on it. 2. A problem-oriented vocabulary. 3. Encouragement of good software design. The real-time problem is solved through provid­ ing a real-time operating system outside of Let us now look at some of the tools that have FORTRAN. System functions or subroutines are been used by employees and customers of General made available to the programmer for interroga­ Electric's Process Computer Operation. ting time, which is kept by the operating system. Data types are augmented by allowing various forms of bit arrays and providing operations to Our experiences work on them. Data communication problems are also handled FORTRAN - a semi-success through various extensions to the language. In one case we changed the meaning of labelled Soon after FORTRAN swept to supremacy as the COMMON to allow more than one common area. earliest and most used mathematical program­ Named system variables are another useful ming language in the United States our customers technique. wanted to use it to program their process appli­ cations. In the early days there was considerable Program organisation is dependent on the avail­ naivete about the usefulness of FORTRAN for able operating system.
Recommended publications
  • A Quick Guide to Southeast Florida's Coral Reefs

    A Quick Guide to Southeast Florida's Coral Reefs

    A Quick Guide to Southeast Florida’s Coral Reefs DAVID GILLIAM NATIONAL CORAL REEF INSTITUTE NOVA SOUTHEASTERN UNIVERSITY Spring 2013 Prepared by the Land-based Sources of Pollution Technical Advisory Committee (TAC) of the Southeast Florida Coral Reef Initiative (SEFCRI) BRIAN WALKER NATIONAL CORAL REEF INSTITUTE, NOVA SOUTHEASTERN Southeast Florida’s coral-rich communities are more valuable than UNIVERSITY the Spanish treasures that sank nearby. Like the lost treasures, these amazing reefs lie just a few hundred yards off the shores of Martin, Palm Beach, Broward and Miami-Dade Counties where more than one-third of Florida’s 19 million residents live. Fishing, diving, and boating help attract millions of visitors to southeast Florida each year (30 million in 2008/2009). Reef-related expen- ditures generate $5.7 billion annually in income and sales, and support more than 61,000 local jobs. Such immense recreational activity, coupled with the pressures of coastal development, inland agriculture, and robust cruise and commercial shipping industries, threaten the very survival of our reefs. With your help, reefs will be protected from local stresses and future generations will be able to enjoy their beauty and economic benefits. Coral reefs are highly diverse and productive, yet surprisingly fragile, ecosystems. They are built by living creatures that require clean, clear seawater to settle, mature and reproduce. Reefs provide safe havens for spectacular forms of marine life. Unfortunately, reefs are vulnerable to impacts on scales ranging from local and regional to global. Global threats to reefs have increased along with expanding ART SEITZ human populations and industrialization. Now, warming seawater temperatures and changing ocean chemistry from carbon dioxide emitted by the burning of fossil fuels and deforestation are also starting to imperil corals.
  • On-Line Computing with a Hierarchy of Processors

    On-Line Computing with a Hierarchy of Processors

    University of Pennsylvania ScholarlyCommons Technical Reports (CIS) Department of Computer & Information Science December 1968 On-Line Computing With a Hierarchy of Processors Richard P. Morton University of Pennsylvania Follow this and additional works at: https://repository.upenn.edu/cis_reports Recommended Citation Richard P. Morton, "On-Line Computing With a Hierarchy of Processors", . December 1968. University of Pennsylvania Department of Computer and Information Science Technical Report No. MS-CIS-69-13. This paper is posted at ScholarlyCommons. https://repository.upenn.edu/cis_reports/804 For more information, please contact [email protected]. On-Line Computing With a Hierarchy of Processors Abstract Time shared computer systems have been based upon the two techniques of multiprogramming and swapping. Multiprogramming is based on restricting each program to a portion of the total computer memory. Swapping requires considerable overhead time for loading and unloading programs. To alleviate the size restriction due to multiprogramming, segmentation is employed, resulting in fact in vastly increased swapping. A new system architecture is proposed for time shared computing that alleviates the high overhead or program size restriction. It utilizes a hierarchy of processors, where each processor is assigned tasks on the basis of four factors: interactive requirements, frequency of use, execution time, and program length. In order to study the hierarchical approach to system architecture, the Moore School Problem Solving Facility (MSPSF) was built and used. The study of the manner of operation and the reactions of the users clarified and defined the Hierarchy of Processors system architecture. The Moore School Problem Solving Facility was implemented on second generation equipment, the IBM 7040, and therefore it is not possible to adequately compare the efficiency with third generation computers operating in a swapping mode.
  • A Politico-Social History of Algolt (With a Chronology in the Form of a Log Book)

    A Politico-Social History of Algolt (With a Chronology in the Form of a Log Book)

    A Politico-Social History of Algolt (With a Chronology in the Form of a Log Book) R. w. BEMER Introduction This is an admittedly fragmentary chronicle of events in the develop­ ment of the algorithmic language ALGOL. Nevertheless, it seems perti­ nent, while we await the advent of a technical and conceptual history, to outline the matrix of forces which shaped that history in a political and social sense. Perhaps the author's role is only that of recorder of visible events, rather than the complex interplay of ideas which have made ALGOL the force it is in the computational world. It is true, as Professor Ershov stated in his review of a draft of the present work, that "the reading of this history, rich in curious details, nevertheless does not enable the beginner to understand why ALGOL, with a history that would seem more disappointing than triumphant, changed the face of current programming". I can only state that the time scale and my own lesser competence do not allow the tracing of conceptual development in requisite detail. Books are sure to follow in this area, particularly one by Knuth. A further defect in the present work is the relatively lesser availability of European input to the log, although I could claim better access than many in the U.S.A. This is regrettable in view of the relatively stronger support given to ALGOL in Europe. Perhaps this calmer acceptance had the effect of reducing the number of significant entries for a log such as this. Following a brief view of the pattern of events come the entries of the chronology, or log, numbered for reference in the text.
  • Security Applications of Formal Language Theory

    Security Applications of Formal Language Theory

    Dartmouth College Dartmouth Digital Commons Computer Science Technical Reports Computer Science 11-25-2011 Security Applications of Formal Language Theory Len Sassaman Dartmouth College Meredith L. Patterson Dartmouth College Sergey Bratus Dartmouth College Michael E. Locasto Dartmouth College Anna Shubina Dartmouth College Follow this and additional works at: https://digitalcommons.dartmouth.edu/cs_tr Part of the Computer Sciences Commons Dartmouth Digital Commons Citation Sassaman, Len; Patterson, Meredith L.; Bratus, Sergey; Locasto, Michael E.; and Shubina, Anna, "Security Applications of Formal Language Theory" (2011). Computer Science Technical Report TR2011-709. https://digitalcommons.dartmouth.edu/cs_tr/335 This Technical Report is brought to you for free and open access by the Computer Science at Dartmouth Digital Commons. It has been accepted for inclusion in Computer Science Technical Reports by an authorized administrator of Dartmouth Digital Commons. For more information, please contact [email protected]. Security Applications of Formal Language Theory Dartmouth Computer Science Technical Report TR2011-709 Len Sassaman, Meredith L. Patterson, Sergey Bratus, Michael E. Locasto, Anna Shubina November 25, 2011 Abstract We present an approach to improving the security of complex, composed systems based on formal language theory, and show how this approach leads to advances in input validation, security modeling, attack surface reduction, and ultimately, software design and programming methodology. We cite examples based on real-world security flaws in common protocols representing different classes of protocol complexity. We also introduce a formalization of an exploit development technique, the parse tree differential attack, made possible by our conception of the role of formal grammars in security. These insights make possible future advances in software auditing techniques applicable to static and dynamic binary analysis, fuzzing, and general reverse-engineering and exploit development.
  • Data Definition Language

    Data Definition Language

    1 Structured Query Language SQL, or Structured Query Language is the most popular declarative language used to work with Relational Databases. Originally developed at IBM, it has been subsequently standard- ized by various standards bodies (ANSI, ISO), and extended by various corporations adding their own features (T-SQL, PL/SQL, etc.). There are two primary parts to SQL: The DDL and DML (& DCL). 2 DDL - Data Definition Language DDL is a standard subset of SQL that is used to define tables (database structure), and other metadata related things. The few basic commands include: CREATE DATABASE, CREATE TABLE, DROP TABLE, and ALTER TABLE. There are many other statements, but those are the ones most commonly used. 2.1 CREATE DATABASE Many database servers allow for the presence of many databases1. In order to create a database, a relatively standard command ‘CREATE DATABASE’ is used. The general format of the command is: CREATE DATABASE <database-name> ; The name can be pretty much anything; usually it shouldn’t have spaces (or those spaces have to be properly escaped). Some databases allow hyphens, and/or underscores in the name. The name is usually limited in size (some databases limit the name to 8 characters, others to 32—in other words, it depends on what database you use). 2.2 DROP DATABASE Just like there is a ‘create database’ there is also a ‘drop database’, which simply removes the database. Note that it doesn’t ask you for confirmation, and once you remove a database, it is gone forever2. DROP DATABASE <database-name> ; 2.3 CREATE TABLE Probably the most common DDL statement is ‘CREATE TABLE’.
  • Origins of Operating Systems OS/360 Martin Grund

    Origins of Operating Systems OS/360 Martin Grund

    Origins of Operating Systems OS/360 Martin Grund HPI Table of Contents ● IBM System 360 ● Functional Structure of OS/360 ● Virtual Machine Time Sharing Juni 2006 Origins of Operating Systems - OS/360 2 Martin Grund Welcome to Big Blue Juni 2006 Origins of Operating Systems - OS/360 3 Martin Grund IBM System 360 ● In 1964 IBM announced the IBM-360 family for computers ● All machines, despite their differences, had the same user instruction set ● Different operating systems available for these machines ● Only midrange and high-end system run OS/360 ● IBM introduced the new term of hardware architecture ● In 1970 IBM announced System 370 with hardware virtual memory support Juni 2006 Origins of Operating Systems - OS/360 4 Martin Grund IBM System 360 ● High-end machines established 32 bit as standard for computers ● Virtual Memory Support – hardware support for dynamic address translation ● Within ten years S/360 achieved standard status ● Flashback prices: ● 1970 – $279/MB hard disk ● 1980 - $35/MB hard disk | $50.000 /MB DRAM Juni 2006 Origins of Operating Systems - OS/360 5 Martin Grund IBM System 360 Specials ● Introduced 8bit entities ● Introduction of 32 or 64 bit floating point words based on a hexadecimal base ● Variable length strings using length field in the first byte ● All registers are universal registers – accumulators as well as address registers ● Registers use 32 bit, 24 bit for addressing -> 16MB Juni 2006 Origins of Operating Systems - OS/360 6 Martin Grund IBM S/360 - Pictures Juni 2006 Origins of Operating Systems -
  • RML Algol 60 Compiler Accepts the Full ASCII Character Set Described in the Manual

    RML Algol 60 Compiler Accepts the Full ASCII Character Set Described in the Manual

    I I I · lL' I I 1UU, Alsol 60 CP/M 5yst.. I I , I I '/ I I , ALGOL 60 VERSION 4.8C REI.!AS!- NOTE I I I I CP/M Vers1on·2 I I When used with CP/M version 2 the Algol Ifste. will accept disk drive Dames extending from A: to P: I I I ASSEMBLY CODE ROUTINES I I .'n1~ program CODE.ALG and CODE.ASe 1s an aid to users who wish ·to add I their own code routines to the runtime system. The program' produc:es an I output file which contains a reconstruction of the INPUT, OUTPUT, IOC and I ERROR tables described in the manual. 1111s file forms the basis of an I assembly code program to which users may edit in their routines... Pat:ts I not required may be removed as desired. The resulting program should I then be assembled and overlaid onto the runtime system" using DDT, the I resulti;lg code being SAVEd as a new runtime system. It 1s important that. I the CODE program be run using the version of the runtimesY$tem to. which I the code routines are to be linked else the tables produced DUly, be·\, I incompatible. - I I I I Another example program supplied. 1. QSORT. the sortiDI pro~edure~, I described in the manual. I I I I I I I I I I , I I I -. I I 'It I I I I I I I I I I I ttKL Aleol 60 C'/M Systea I LONG INTEGER ALGOL Arun-L 1s a version of the RML zao Algol system 1nwh1c:h real variables are represented, DOt in the normal mantissalexponent form but rather as 32 .bit 2 s complement integers.
  • Workplace Learning Connection Annual Report 2019-20

    Workplace Learning Connection Annual Report 2019-20

    2019 – 2020 ANNUAL REPORT SERVING SCHOOLS, STUDENTS, EMPLOYERS, AND COMMUNITIES IN BENTON, CEDAR, IOWA, JOHNSON, JONES, LINN, AND WASHINGTON COUNTIES Connecting today’s students to tomorrow’s careers LINN COUNTY JONES COUNTY IOWA COUNTY CENTER REGIONAL CENTER REGIONAL CENTER 200 West St. 1770 Boyson Rd. 220 Welter Dr. Williamsburg, Iowa 52361 Hiawatha, Iowa 52233 Monticello, Iowa 52310 866-424-5669 319-398-1040 855-467-3800 KIRKWOOD REGIONAL CENTER WASHINGTON COUNTY AT THE UNIVERSITY OF IOWA REGIONAL CENTER 2301 Oakdale Blvd. 2192 Lexington Blvd. Coralville, Iowa 52241 Washington, Iowa 52353 319-887-3970 855-467-3900 BENTON COUNTY CENTER CEDAR COUNTY CENTER 111 W. 3rd St. 100 Alexander Dr., Suite 2 WORKPLACE LEARNING Vinton, Iowa 52349 Tipton, Iowa 52772 CONNECTION 866-424-5669 855-467-3900 2019 – 2020 AT A GLANCE Thank you to all our contributors, supporters, and volunteers! Workplace Learning Connection uses a diverse funding model that allows all partners to sustain their participation in an equitable manner. Whether a partners’ interest are student career development, future workforce development, or regional economic development, all funds provide age-appropriate career awareness and exploration services matching the mission of WLC and our partners. Funding the Connections… 2019 – 2020 Revenue Sources Kirkwood Community College (General Fund) $50,000 7% State and Federal Grants (Kirkwood: Perkins, WTED, IIG) $401,324 54% Grant Wood Area Education Agency $40,000 5% K through 12 School Districts Fees for Services $169,142 23% Contributions,
  • Think Complexity: Exploring Complexity Science in Python

    Think Complexity: Exploring Complexity Science in Python

    Think Complexity Version 2.6.2 Think Complexity Version 2.6.2 Allen B. Downey Green Tea Press Needham, Massachusetts Copyright © 2016 Allen B. Downey. Green Tea Press 9 Washburn Ave Needham MA 02492 Permission is granted to copy, distribute, transmit and adapt this work under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License: https://thinkcomplex.com/license. If you are interested in distributing a commercial version of this work, please contact the author. The LATEX source for this book is available from https://github.com/AllenDowney/ThinkComplexity2 iv Contents Preface xi 0.1 Who is this book for?...................... xii 0.2 Changes from the first edition................. xiii 0.3 Using the code.......................... xiii 1 Complexity Science1 1.1 The changing criteria of science................3 1.2 The axes of scientific models..................4 1.3 Different models for different purposes............6 1.4 Complexity engineering.....................7 1.5 Complexity thinking......................8 2 Graphs 11 2.1 What is a graph?........................ 11 2.2 NetworkX............................ 13 2.3 Random graphs......................... 16 2.4 Generating graphs........................ 17 2.5 Connected graphs........................ 18 2.6 Generating ER graphs..................... 20 2.7 Probability of connectivity................... 22 vi CONTENTS 2.8 Analysis of graph algorithms.................. 24 2.9 Exercises............................. 25 3 Small World Graphs 27 3.1 Stanley Milgram......................... 27 3.2 Watts and Strogatz....................... 28 3.3 Ring lattice........................... 30 3.4 WS graphs............................ 32 3.5 Clustering............................ 33 3.6 Shortest path lengths...................... 35 3.7 The WS experiment....................... 36 3.8 What kind of explanation is that?............... 38 3.9 Breadth-First Search.....................
  • IBM Application System/400 System/38-Compatible COBOL User's Guide and Reference

    IBM Application System/400 System/38-Compatible COBOL User's Guide and Reference

    IBM IBM Application System/400 SC09-1814-00 System/38-Compatible COBOL User’s Guide and Reference Note! Before using this information and the product it supports, be sure to read the general information under “Notices” on page xv. First Edition (June 1994) This edition applies to the System/38-Compatible feature of the IBM* ILE* COBOL/400* licensed program, (Program 5763-CB1), Version 3 Release 0 Modification 5, and to all subsequent releases and modifications until otherwise indi- cated in new editions. Make sure you are using the proper edition for the level of the product. Order publications through your IBM representative or the IBM branch serving your locality. Publications are not stocked at the address given below. A form for readers’ comments is provided at the back of this publication. If the form has been removed, you may address your comments to: IBM Canada Ltd. Laboratory Information Development 2G/345/1150/TOR 1150 Eglinton Avenue East, North York, Ontario, Canada M3C1H7 You can also send your comments by facsimile (attention: RCF Coordinator), or you can send your comments elec- tronically to IBM. See "Communicating your Comments to IBM" for a description of the methods. This page imme- diately precedes the Readers' Comment Form at the back of this publication. When you send information to IBM, you grant IBM a non-exclusive right to use or distribute the information in any way it believes appropriate without incurring any obligation to you. Copyright International Business Machines Corporation 1994. All rights reserved. Note to U.S. Government Users — Documentation related to restricted rights — Use, duplication or disclosure is subject to restrictions set forth in GSA ADP Schedule Contract with IBM Corp.
  • Preparation of Papers for AIAA Technical Conferences

    Preparation of Papers for AIAA Technical Conferences

    NASA KSC – Internship Final Report Unit Testing and Remote Display Development Nicholas Costa Kennedy Space Center Computer Science USRA Summer Session 18 07 2014 NASA Center 1 18/7/2014 NASA KSC – Internship Final Report Unit Testing and Remote Display Development Nicholas Costa Denison University, Granville, Ohio, Abstract The Kennedy Space Center is currently undergoing an extremely interesting transitional phase. The final Space Shuttle mission, STS-135, was completed in July of 2011. NASA is now approaching a new era of space exploration. The development of the Orion Multi- Purpose Crew Vehicle (MPCV) and the Space Launch System (SLS) launch vehicle that will launch the Orion are currently in progress. An important part of this transition involves replacing the Launch Processing System (LPS) which was previously used to process and launch Space Shuttles and their associated hardware. NASA is creating the Spaceport Command and Control System (SCCS) to replace the LPS. The SCCS will be much simpler to maintain and improve during the lifetime of the spaceflight program that it will support. The Launch Control System (LCS) is a portion of the SCCS that will be responsible for launching the rockets and spacecraft. The Integrated Launch Operations Applications (ILOA) group of SCCS is responsible for creating displays and scripts, both remote and local, that will be used to monitor and control hardware and systems needed to launch a spacecraft. It is crucial that the software contained within be thoroughly tested to ensure that it functions as intended. Unit tests must be written in Application Control Language (ACL), the scripting language used by LCS.
  • Coral 66 Language Reference Makrjal

    Coral 66 Language Reference Makrjal

    CORAL 66 LANGUAGE REFERENCE MAKRJAL The Centre for Computing History Nl www.CompuUngHistofy.ofg.uk \/ k > MICRO FOCUS CORAL 66 LANGUAGE REFERENCE MANUAL Version 3 Micro Focus Ltd. Issue 2 March 1982 Not to be copied without the consent of Micro Focus Ltd. This language definition reproduces material from the British Standard BS5905 which is hereby acknowledged as a source. / \ / N Micro Focus Ltd. 58,Acacia Rood, St. Johns Wbod, MICRO FOCUS London NW8 6AG Telephones: 017228843/4/5/6/7 Telex: 28536 MICROFG CX)PYRI(fflT 1981, 1982 by Micro Focus Ltd. ii CORAL 66 LANGUAGE REFERENCE MANUAL AMENDMENT RECORD AMENDMENT DATED INSERTED BY SIGNATURE DATE NUMBER iii PREFACE This manual defines the programming language CORAL 66 as implemented in Version 3 of the CORAL compilers known as RCC80 and RCC86. Now that British Standard BS5905 has become the main source for CORAL implementation its structure and style have been adopted. Con5)ared to previous version's of the RCC compilers. Version 3 incorporates 'TABLE' and 'OVERLAY', and allows additional forms of Real numbers in line with the British Standard. Coiiq}iler error reporting has been .modified slightly - in particular all error messages now have identifying numbers and are listed in appendices to the operating manuals. Micro Focus has now assumed direct responsibility for production of all RCC CORAL manuals and believes that this will offer users a better service than has been possible in the past. iv AUDIENCE This manual is intended as a description of CORAL 66 for reference and assumes familiarity with use of the language.