DOCSLIB.ORG

OMG Sysml™ Requirements Traceability

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
OMG Sysml™ Requirements Traceability OMG SysML™ Requirements Traceability (informative) This document has been published as OMG document ptc/07-03-09 so it can be referenced by Annex E of the OMG SysML™ specification. This document describes the requirements tracability matrix (RTM) that shows how SysML satisfies the requirements in Sec- tions 6.5 (Mandatory) and 6.6 (Optional) of the UML for SE RFP (OMG document ad/03-03-41). The matrix includes col- umns that correspond to those identified in the first paragraph of Section 6.5 of the RFP and are restated here. The text requirement statement is included in the RFP and was excluded from this document due to space limitations. a) The UML for SE requirement number. b) The UML for SE requirement name (or other letter designator). Note: The reader should refer to the UML for SE RFP for the specific text of the requirement, since there was inadequate room in the table to repeat it here. c) Describes whether the proposed solution is a full or partial satisfaction of the requirement, or whether there is no solution provided. The section header rows that do not have a text requirement are marked N/A. d) A description of how SysML addresses the requirement. Note: In some cases, there may be other SysML solutions to satisfy the requirement, but the intent was to describe at least one solution. e) The specific UML and SysML metaclasses that address the requirement. f) Reference to the applicable chapter in the SysML specification which addresses e) above. This diagram element tables in the chapter describe the concrete syntax (symbols) that show how the solution to the requirement is represented in diagrams. The usage examples in the chapters along with sample problem in “Annex B: Sample Problem” describe how the solution to the requirement is used in representative examples. Note: The reference to a chapter may require reference to a corresponding chapter in the UML specification. For example, when the blocks chapter is referenced, this may include a combination of the SysML blocks chapter and the UML classes and composite structure chapters. Table E.1 - Requirement Traceability matrix UML for Requirement Compl Requirement Satisfaction Metaclass SysML Ver # SE Req't name (Y/N, Extension Diagram # Partial) Chapter 6.5 Mandatory Requirements 6.5.1 Structure N/A Structure diagrams include block Structural definition, internal block, and Constructs package diagrams 6.5.1.1 System Y Block composition (black or SysML::Block, Blocks 1.0 hierarchy white diamond) in a block UML::Association, definition diagram and parts in SysML::Block internal block diagrams are the Property primary mechanisms for representing system hierarchy. OMG SysMLTM Adopted Specification 1 a. Subsystem Y Typically represented by a set of SysML::Block, Blocks 1.0 (logical or logical or physical parts in an SysML::Block physical) internal block diagram that Property realize one or more system operations. The corresponding sequence diagram and activity diagram with swim lanes can represent a hybrid of structure and behavior. b. Hardware Y Represented by a block or part. SysML::Block, Blocks 1.0 (i.e., electrical, SysML::Block mechanical, Property optical) c. Software Y Represented by a block or part or SysML::Block, Blocks 1.0 a UML component. SysML::Block Property, UML::Component d. Data Y Represented by a block or part. SysML::Block, Blocks 1.0 Refer to input/output SysML::Block requirements in 6.5.2.1.1 and Property, 6.5.2.5 for data flows. SysML::ValueType, UML::DataType e. Manual Y Represented by a block or part. SysML::Block, Blocks 1.0 procedure Can also be represented by the SysML::Block standard UML stereotype Property, <<document>>. UML::Document f. User/person Y Represented by a block or part. SysML::Block, Blocks 1.0 External users are also SysML::Block represented as actors in a use Property case diagram. g. Facility Y Represented by a block or part. SysML::Block, Blocks 1.0 SysML::Block Property h. Natural Y Represented by a block or part. SysML::Block, Blocks 1.0 object SysML::Block Property i. Node Y Represented by a block or part. SysML::Block, Blocks 1.0 SysML::Block Property 6.5.1.2 Environment Y Environment is one or more SysML::Block, Blocks, 1.0 entities that are external to the SysML::Block system of interest and can be Property Use Case represented as a block or part of a broader context. Also, represented as actors in use cases. 2 OMG SysMLTM Adopted Specification 6.5.1.3 System Internal block diagram shows SysML::Block, Blocks 1.0 inter- connections using parts, ports, SysML::Block connection and connectors. Property, UML Association, UML::Connector: SysML::Nested ConnectorEnd 6.5.1.3.1 Port Y A port defines an interaction SysML::Standard Ports and 1.0 point on a block or part that Port, Flows enables the user to specify what can flow in/out of the block/part UML::Interface, (flow port) or what services the SysML::FlowPort, block/part requires or provides SysML::Flow (Standard Port). Ports are Specification, connected using connectors. SysML::Flow Property 6.5.1.3.2 System Y The enclosing block for an SysML::Block Blocks, Ports 1.0 boundary internal block diagram and its and Flows ports. SysML::Standard Port, SysML::FlowPort 6.5.1.3.3 Connection Y A connector binds two ports to UML::Association, Blocks 1.0 support interconnection. A UML::Connector, connector can be typed by an SysML::Nested association. A logical connector ConnectorEnd can be allocated to a more complex physical path depicting a set of parts, ports, and connectors (refer to allocation). Note: A connector has limited decomposition capability at this time. 6.5.1.4 Deployment of Y A structural allocation SysML::Allocation, Allocations 1.0 components to relationship enables the SysML::Allocated, nodes allocation (deployment) of one UML::Named structural element to another. Element a. Y Software part, block or SysML::Allocation, Allocations 1.0 component deployed to a SysML::Allocated, hardware part or block SysML::Block, (processor or storage device). SysML::Block Property, UML::Component b. Y Generalized deployment SysML::Allocation, Allocations 1.0 relationship between a deployed SysML::Allocated, element and its host. SysML::Block, SysML::Block Property OMG SysMLTM Adopted Specification 3 c Y Deployed element and host can SysML::Block, Allocations 1.0 be decomposed using blocks and SysML::Block parts. Property 6.5.2 Behavior N/A Behavior diagrams include Behavioral activity, sequence, and state Constructs machine diagrams. Communication diagrams, interaction overview diagrams, and timing diagrams are interaction diagrams that are not included in SysML. Use case diagrams are also viewed as a behavior diagram in that they represent the functionality in terms of the usages of the system, but do not depict temporal relationships and associated control flow or input/output flow. 6.5.2.1 Functional A behavior is the generalized UML::Behavior Activities Transformation form of a function with inputs of Inputs to and output parameters. Activity is Outputs a subclass of behavior. 6.5.2.1.1 Input/Output Y Inputs and outputs can be UML::Parameter, Activities, 1.0 represented as parameters of UML::ObjectNode, Ports and activities, object nodes flowing SysML::ItemFlow Flows between action nodes, and as item flows between parts in an internal block diagram. Note: Object nodes are more precisely represented by pins on action nodes. a Y Parameters, object nodes, and SysML::Block, Activities, 1.0 item properties are typed by UML::Parameter, Ports and classifiers (blocks or value types) UML::ObjectNode, Flows that can have properties. SysML::ItemFlow b Y The classifiers that represent the SysML::Block, Activities, 1.0 things that flow (type of UML::Parameter, Ports and parameter, object node, and item UML::ObjectNode, Flows, Blocks property) can be decomposed and SysML::ItemFlow specialized. c Y "ItemFlows" associate the things SysML::Block, Activities, 1.0 that flow with the connectors that UML::Parameter, Ports and bind the ports. The parameters UML::ObjectNode, Flows and object nodes are bound to SysML::ItemFlow the corresponding activities and actions. 4 OMG SysMLTM Adopted Specification 6.5.2.1.2 System store Partial Stored items can be represented SysML::Block, Blocks, 1.0 as parts of a block, and also SysML::Block Activities represented in an activity Property, diagram as object nodes or central buffer nodes. UML::ObjectNode UML::Central BufferNode a Partial Object nodes in an activity UML::ObjectNode, Activities 1.0 diagram can represent depletable UML::DataStore stores, and a data store node can Node represent non-depletable stores. b Y A stored item can be the same SysML::Block, Blocks, 1.0 type of classifier as an input or SysML::Block Activities output in both an internal block Property, diagram and an activity diagram. UML::ObjectNode, The classifier supports different UML::DataStore roles (store vs. flow). Node 6.5.2.1.3 Function Y Activity specifies a generic UML::Activity Activities, 1.0 subclass of behavior that is used Interactions, to represent a function definition State in activity diagrams, sequence Machines diagrams, and state-machine diagrams. Activities contain CallBehaviorActions that call (invoke) other activities to support execution of the generic behaviors. a Y Behaviors and the associated UML::Behavior Activities, 1.0 parameters are named (i.e., name Interactions of activity and activity parameter node). State Machines b Y The action semantics define UML::CreateObject Activities, 1.0 different types of actions that Action, Interactions include CreateObject, UML::DeleteObject DestroyObject, Action, the various State ReadStructuralFeature (monitor), object modification Machines and WriteStructurealFeature actions in UML, (update). A CallBehavior action monitoring with is a generalized action that can UML::AcceptEvent call any behavior (activity, Action interaction, state).
Load more

Recommended publications
  • A Hybrid Static Type Inference Framework with Neural
    HiTyper: A Hybrid Static Type Inference Framework with Neural Prediction Yun Peng Zongjie Li Cuiyun Gao∗ The Chinese University of Hong Kong Harbin Institute of Technology Harbin Institute of Technology Hong Kong, China Shenzhen, China Shenzhen, China [email protected] [email protected] [email protected] Bowei Gao David Lo Michael Lyu Harbin Institute of Technology Singapore Management University The Chinese University of Hong Kong Shenzhen, China Singapore Hong Kong, China [email protected] [email protected] [email protected] ABSTRACT also supports type annotations in the Python Enhancement Pro- Type inference for dynamic programming languages is an impor- posals (PEP) [21, 22, 39, 43]. tant yet challenging task. By leveraging the natural language in- Type prediction is a popular task performed by most attempts. formation of existing human annotations, deep neural networks Traditional static type inference techniques [4, 9, 14, 17, 36] and outperform other traditional techniques and become the state-of- type inference tools such as Pytype [34], Pysonar2 [33], and Pyre the-art (SOTA) in this task. However, they are facing some new Infer [31] can predict sound results for the variables with enough challenges, such as fixed type set, type drift, type correctness, and static constraints, e.g., a = 1, but are unable to handle the vari- composite type prediction. ables with few static constraints, e.g. most function arguments. To mitigate the challenges, in this paper, we propose a hybrid On the other hand, dynamic type inference techniques [3, 37] and type inference framework named HiTyper, which integrates static type checkers simulate the workflow of functions and solve types inference into deep learning (DL) models for more accurate type according to input cases and typing rules.
    [Show full text]
  • ACDT: Architected Composite Data Types Trading-In Unfettered Data Access for Improved Execution
    ACDT: Architected Composite Data Types Trading-in Unfettered Data Access for Improved Execution Andres Marquez∗, Joseph Manzano∗, Shuaiwen Leon Song∗, Benoˆıt Meistery Sunil Shresthaz, Thomas St. Johnz and Guang Gaoz ∗Pacific Northwest National Laboratory fandres.marquez,joseph.manzano,[email protected] yReservoir Labs [email protected] zUniversity of Delaware fshrestha,stjohn,[email protected] Abstract— reduction approaches associated with improved data locality, obtained through optimized data and computation distribution. With Exascale performance and its challenges in mind, one ubiquitous concern among architects is energy efficiency. In the SW-stack we foresee the runtime system to have a Petascale systems projected to Exascale systems are unsustainable particular important role to contribute to the solution of the at current power consumption rates. One major contributor power challenge. It is here where the massive concurrency is to system-wide power consumption is the number of memory managed and where judicious data layouts [11] and data move- operations leading to data movement and management techniques ments are orchestrated. With that in mind, we set to investigate applied by the runtime system. To address this problem, we on how to improve efficiency of a massively multithreaded present the concept of the Architected Composite Data Types adaptive runtime system in managing and moving data, and the (ACDT) framework. The framework is made aware of data trade-offs an improved data management efficiency requires. composites, assigning them a specific layout, transformations Specifically, in the context of run-time system (RTS), we and operators. Data manipulation overhead is amortized over a explore the power efficiency potential that data compression larger number of elements and program performance and power efficiency can be significantly improved.
    [Show full text]
  • Evaluating Variability Modeling Techniques for Supporting Cyber-Physical System Product Line Engineering
    This paper will be presented at System Analysis and Modeling (SAM) Conference 2016 (http://sdl-forum.org/Events/SAM2016/index.htm) Evaluating Variability Modeling Techniques for Supporting Cyber-Physical System Product Line Engineering Safdar Aqeel Safdar 1, Tao Yue1,2, Shaukat Ali1, Hong Lu1 1Simula Research Laboratory, Oslo, Norway 2 University of Oslo, Oslo, Norway {safdar, tao, shaukat, honglu}@simula.no Abstract. Modern society is increasingly dependent on Cyber-Physical Systems (CPSs) in diverse domains such as aerospace, energy and healthcare. Employing Product Line Engineering (PLE) in CPSs is cost-effective in terms of reducing production cost, and achieving high productivity of a CPS development process as well as higher quality of produced CPSs. To apply CPS PLE in practice, one needs to first select an appropriate variability modeling technique (VMT), with which variabilities of a CPS Product Line (PL) can be specified. In this paper, we proposed a set of basic and CPS-specific variation point (VP) types and modeling requirements for proposing CPS-specific VMTs. Based on the proposed set of VP types (basic and CPS-specific) and modeling requirements, we evaluated four VMTs: Feature Modeling, Cardinality Based Feature Modeling, Common Variability Language, and SimPL (a variability modeling technique dedicated to CPS PLE), with a real-world case study. Evaluation results show that none of the selected VMTs can capture all the basic and CPS-specific VP and meet all the modeling requirements. Therefore, there is a need to extend existing techniques or propose new ones to satisfy all the requirements. Keywords: Product Line Engineering, Variability Modeling, and Cyber- Physical Systems 1 Introduction Cyber-Physical Systems (CPSs) integrate computation and physical processes and their embedded computers and networks monitor and control physical processes by often relying on closed feedback loops [1, 2].
    [Show full text]
  • UML Profile for Communicating Systems a New UML Profile for the Specification and Description of Internet Communication and Signaling Protocols
    UML Profile for Communicating Systems A New UML Profile for the Specification and Description of Internet Communication and Signaling Protocols Dissertation zur Erlangung des Doktorgrades der Mathematisch-Naturwissenschaftlichen Fakultäten der Georg-August-Universität zu Göttingen vorgelegt von Constantin Werner aus Salzgitter-Bad Göttingen 2006 D7 Referent: Prof. Dr. Dieter Hogrefe Korreferent: Prof. Dr. Jens Grabowski Tag der mündlichen Prüfung: 30.10.2006 ii Abstract This thesis presents a new Unified Modeling Language 2 (UML) profile for communicating systems. It is developed for the unambiguous, executable specification and description of communication and signaling protocols for the Internet. This profile allows to analyze, simulate and validate a communication protocol specification in the UML before its implementation. This profile is driven by the experience and intelligibility of the Specification and Description Language (SDL) for telecommunication protocol engineering. However, as shown in this thesis, SDL is not optimally suited for specifying communication protocols for the Internet due to their diverse nature. Therefore, this profile features new high-level language concepts rendering the specification and description of Internet protocols more intuitively while abstracting from concrete implementation issues. Due to its support of several concrete notations, this profile is designed to work with a number of UML compliant modeling tools. In contrast to other proposals, this profile binds the informal UML semantics with many semantic variation points by defining formal constraints for the profile definition and providing a mapping specification to SDL by the Object Constraint Language. In addition, the profile incorporates extension points to enable mappings to many formal description languages including SDL. To demonstrate the usability of the profile, a case study of a concrete Internet signaling protocol is presented.
    [Show full text]
  • Data Types and Variables
    Color profile: Generic CMYK printer profile Composite Default screen Complete Reference / Visual Basic 2005: The Complete Reference / Petrusha / 226033-5 / Chapter 2 2 Data Types and Variables his chapter will begin by examining the intrinsic data types supported by Visual Basic and relating them to their corresponding types available in the .NET Framework’s Common TType System. It will then examine the ways in which variables are declared in Visual Basic and discuss variable scope, visibility, and lifetime. The chapter will conclude with a discussion of boxing and unboxing (that is, of converting between value types and reference types). Visual Basic Data Types At the center of any development or runtime environment, including Visual Basic and the .NET Common Language Runtime (CLR), is a type system. An individual type consists of the following two items: • A set of values. • A set of rules to convert every value not in the type into a value in the type. (For these rules, see Appendix F.) Of course, every value of another type cannot always be converted to a value of the type; one of the more common rules in this case is to throw an InvalidCastException, indicating that conversion is not possible. Scalar or primitive types are types that contain a single value. Visual Basic 2005 supports two basic kinds of scalar or primitive data types: structured data types and reference data types. All data types are inherited from either of two basic types in the .NET Framework Class Library. Reference types are derived from System.Object. Structured data types are derived from the System.ValueType class, which in turn is derived from the System.Object class.
    [Show full text]
  • DRAFT1.2 Methods
    HL7 v3.0 Data Types Specification - Version 0.9 Table of Contents Abstract . 1 1 Introduction . 2 1.1 Goals . 3 DRAFT1.2 Methods . 6 1.2.1 Analysis of Semantic Fields . 7 1.2.2 Form of Data Type Definitions . 10 1.2.3 Generalized Types . 11 1.2.4 Generic Types . 12 1.2.5 Collections . 15 1.2.6 The Meta Model . 18 1.2.7 Implicit Type Conversion . 22 1.2.8 Literals . 26 1.2.9 Instance Notation . 26 1.2.10 Typus typorum: Boolean . 28 1.2.11 Incomplete Information . 31 1.2.12 Update Semantics . 33 2 Text . 36 2.1 Introduction . 36 2.1.1 From Characters to Strings . 36 2.1.2 Display Properties . 37 2.1.3 Encoding of appearance . 37 2.1.4 From appearance of text to multimedial information . 39 2.1.5 Pulling the pieces together . 40 2.2 Character String . 40 2.2.1 The Unicode . 41 2.2.2 No Escape Sequences . 42 2.2.3 ITS Responsibilities . 42 2.2.4 HL7 Applications are "Black Boxes" . 43 2.2.5 No Penalty for Legacy Systems . 44 2.2.6 Unicode and XML . 47 2.3 Free Text . 47 2.3.1 Multimedia Enabled Free Text . 48 2.3.2 Binary Data . 55 2.3.3 Outstanding Issues . 57 3 Things, Concepts, and Qualities . 58 3.1 Overview of the Problem Space . 58 3.1.1 Concept vs. Instance . 58 3.1.2 Real World vs. Artificial Technical World . 59 3.1.3 Segmentation of the Semantic Field .
    [Show full text]
  • Csci 555: Functional Programming Functional Programming in Scala Functional Data Structures
    CSci 555: Functional Programming Functional Programming in Scala Functional Data Structures H. Conrad Cunningham 6 March 2019 Contents 3 Functional Data Structures 2 3.1 Introduction . .2 3.2 A List algebraic data type . .2 3.2.1 Algebraic data types . .2 3.2.2 ADT confusion . .3 3.2.3 Using a Scala trait . .3 3.2.3.1 Aside on Haskell . .4 3.2.4 Polymorphism . .4 3.2.5 Variance . .5 3.2.5.1 Covariance and contravariance . .5 3.2.5.2 Function subtypes . .6 3.2.6 Defining functions in companion object . .7 3.2.7 Function to sum a list . .7 3.2.8 Function to multiply a list . .9 3.2.9 Function to remove adjacent duplicates . .9 3.2.10 Variadic function apply ................... 11 3.3 Data sharing . 11 3.3.1 Function to take tail of list . 12 3.3.2 Function to drop from beginning of list . 13 3.3.3 Function to append lists . 14 3.4 Other list functions . 15 3.4.1 Tail recursive function reverse . 15 3.4.2 Higher-order function dropWhile . 17 3.4.3 Curried function dropWhile . 17 3.5 Generalizing to Higher Order Functions . 18 3.5.1 Fold Right . 18 3.5.2 Fold Left . 22 3.5.3 Map . 23 1 3.5.4 Filter . 25 3.5.5 Flat Map . 26 3.6 Classic algorithms on lists . 27 3.6.1 Insertion sort and bounded generics . 27 3.6.2 Merge sort . 29 3.7 Lists in the Scala standard library .
    [Show full text]
  • Ata Lements for Mergency Epartment Ystems
    D ata E lements for E mergency D epartment S ystems Release 1.0 U.S. DEPARTMENT OF HEALTH AND HUMAN SERVICES CDCCENTERS FOR DISEASE CONTROL AND PREVENTION D ata E lements for E mergency D epartment S ystems Release 1.0 National Center for Injury Prevention and Control Atlanta, Georgia 1997 Data Elements for Emergency Department Systems, Release 1.0 (DEEDS) is the result of contributions by participants in the National Workshop on Emergency Department Data, held January 23-25, 1996, in Atlanta, Georgia, subsequent review and comment by individuals who read Release 1.0 in draft form, and finalization by a multidisciplinary writing committee. DEEDS is a set of recommendations published by the National Center for Injury Prevention and Control of the Centers for Disease Control and Prevention: Centers for Disease Control and Prevention David Satcher, MD, PhD, Director National Center for Injury Prevention and Control Mark L. Rosenberg, MD, MPP, Director Division of Acute Care, Rehabilitation Research, and Disability Prevention Richard J. Waxweiler, PhD, Director Acute Care Team Daniel A. Pollock, MD, Leader Production services were provided by the staff of the Office of Communication Resources, National Center for Injury Prevention and Control, and the Management Analysis and Services Office: Editing Valerie R. Johnson Cover Design and Layout Barbara B. Lord Use of trade names is for identification only and does not constitute endorsement by the U.S. Department of Health and Human Services. This document and subsequent revisions can be found at the National Center for Injury Prevention and Control Web site: http://www.cdc.gov/ncipc/pub-res/deedspage.htm Suggested Citation: National Center for Injury Prevention and Control.
    [Show full text]
  • Fundamental Programming Concepts
    APPENDIX A Fundamental Programming Concepts The following information is for readers who are new to programming and need a primer on some fundamental programming concepts. If you have programmed in another language, chances are the concepts presented in this appendix are not new to you. You should, however, review the material briefly to become familiar with the C# syntax. Working with Variables and Data Types Variables in programming languages store values that can change while the program executes. For example, if you wanted to count the number of times a user tries to log in to an application, you could use a variable to track the number of attempts. A variable is a memory location where a value is stored. Using the variable, your program can read or alter the value stored in memory. Before you use a variable in your program, however, you must declare it. When you declare a variable, the compiler also needs to know what kind of data will be stored at the memory location. For example, will it be numbers or letters? If the variable will store numbers, how large can a number be? Will the variable store decimals or only whole numbers? You answer these questions by assigning a data type to the variable. A login counter, for example, only needs to hold positive whole numbers. The following code demonstrates how you declare a variable named counter in C# with an integer data type: int counter; Specifying the data type is referred to as strong typing. Strong typing results in more efficient memory management, faster execution, and compiler type checking, all of which reduces runtime errors.
    [Show full text]
  • (Paper 3. Sec 3.1) Data Representation with Majid Tahir
    Computer Science 9608 (Paper 3. Sec 3.1) Data Representation with Majid Tahir Syllabus Content: 3.1 Data representation 3.1.1 User-defined data types why user-defined types are necessary, define and use non-composite types: enumerated, pointer define and use composite data types: set, record and class/object choose and design an appropriate user-defined data type for a given problem User defined Data Type You have already met a variety of built-in data types with integers, strings, chars and more. But often these limited data types aren't enough and a programmer wants to build their own data types. Just as an integer is restricted to "a whole number from - 2,147,483,648 through 2,147,483,647", user-defined data types have limits placed on their use by the programmer. A user defined data type is a feature in most high level programming languages which allows a user (programmer) to define data type according to his/her own requirements There are two categories of user defined data types.: 1. Non-composite data type a. Enumerated data type b. Pointer data type 2. Composite a. Record data type b. Set data type c. Objects and classes Non-composite user-defined data type: A non-composite data type is defined without referencing another data type. They don’t combine different built-in data types in one data type. Non-Composite data types are: www.majidtahir.com Contact: +923004003666 Email: [email protected] 1 Computer Science 9608 (Paper 3. Sec 3.1) Data Representation with Majid Tahir Enumerated data type Pointers An enumerated data type defines a list of possible values.
    [Show full text]
  • Fast Run-Time Type Checking of Unsafe Code
    Fast Run-time Type Checking of Unsafe Code Stephen Kell Computer Laboratory, University of Cambridge 15 JJ Thomson Avenue Cambridge CB3 0FD United Kingdom fi[email protected] Abstract In return, unsafe languages offer several benefits: avoid- Existing approaches for detecting type errors in unsafe lan- ance of certain run-time overheads; a wide range of possi- guages work by changing the toolchain’s source- and/or ble optimisations; enough control of binary interfaces for binary-level contracts, or by imposing up-front proof obli- efficient communication with the operating system or re- gations. While these techniques permit some degree of mote processes. These are valid trades, but have so far come compile-time checking, they hinder use of libraries and are at a high price: of having no machine-assisted checking of not amenable to gradual adoption. This paper describes type- or memory-correctness beyond the limited efforts of libcrunch, a system for binary-compatible run-time type the compiler. Various tools have been developed to offer checking of unmodified unsafe code using a simple yet flex- stronger checks, but have invariably done so by abandon- ible language-independent design. Using a series of experi- ing one or more of unsafe languages’ strengths. Existing dy- ments and case studies, we show our prototype implemen- namic analyses [Burrows et al. 2003; ?] offer high run-time tation to have acceptably low run-time overhead , and to be overhead, while tools based on conservative static analy- easily applicable to real applications written in C without ses [?] are unduly restrictive. Hybrid static/dynamic systems source-level modification.
    [Show full text]
  • Datapath for Buildgates Synthesis and Cadence PKS
    Datapath for BuildGates Synthesis and Cadence PKS Product Version 5.0.13 December 2003 2000-2003 Cadence Design Systems, Inc. All rights reserved. Printed in the United States of America. Cadence Design Systems, Inc., 555 River Oaks Parkway, San Jose, CA 95134, USA Trademarks: Trademarks and service marks of Cadence Design Systems, Inc. (Cadence) contained in this document are attributed to Cadence with the appropriate symbol. For queries regarding Cadence’s trademarks, contact the corporate legal department at the address shown above or call 1-800-862-4522. All other trademarks are the property of their respective holders. Restricted Print Permission: This publication is protected by copyright and any unauthorized use of this publication may violate copyright, trademark, and other laws. Except as specified in this permission statement, this publication may not be copied, reproduced, modified, published, uploaded, posted, transmitted, or distributed in any way, without prior written permission from Cadence. This statement grants you permission to print one (1) hard copy of this publication subject to the following conditions: 1. The publication may be used solely for personal, informational, and noncommercial purposes; 2. The publication may not be modified in any way; 3. Any copy of the publication or portion thereof must include all original copyright, trademark, and other proprietary notices and this permission statement; and 4. Cadence reserves the right to revoke this authorization at any time, and any such use shall be discontinued immediately upon written notice from Cadence. Disclaimer: Information in this publication is subject to change without notice and does not represent a commitment on the part of Cadence.
    [Show full text]