Modelica Change Proposal MCP-0027 Units of Literal Constants Authors: Francesco Casella, Martin Sjölund Status: In Development version v3
|
|
- Lionel Crawford
- 5 years ago
- Views:
Transcription
1 Modelica Change Proposal MCP-0027 Units of Literal Constants Authors: Francesco Casella, Martin Sjölund Status: In Development version v3 Summary Units of literal Real constants are unspecified in the Modelica 3.4. Some tools interpret this as having unit, which prevents strong unit checking of physical s containing non-dimensional literal constants. The goal of this proposal is to clarify this aspect and make stronger unit checking possible. Revisions Date v3 Oct 19, 2017 v2 May 19, 2017 v1 Dec 11, 2016 Short description of revision Revised at 95 th Design Meeting in Linkoping Revised at 94 th Design Meeting, based on output of discussion at 92 nd Design Meeting Francesco Casella. Prepared with suggestions from Martin Sjolund, for presentation at the 92 nd Design Meeting Contributor License Agreement All authors of this MCP or their organizations have signed the Modelica Contributor License Agreement Table of Contents 1. Rationale Issues with the existing MSL Proposed Changes in Specification Backwards Compatibility Tool Implementation Experience with Prototype... 5
2 MCP 0027 UnitsLiteralConstants In Development v Rationale The Modelica Specification 3.4 does not define what the unit attribute of literal Real constants is. This makes it impossible to perform unit checking of s containing non-dimensional numerical factors. Consider the following example, based on the well-known Torricelli s law: Modelica.SIunits.Velocity v; Modelica.SIunits.Acceleration g = ; Modelica.SIunits.Height h; v = sqrt(2.0*g*h); If the literal constant 2.0 had unit 1, then it would be possible to check that both the left-hand side and right-hand side of the have unit m/s, so that the is dimensionally consistent. Otherwise, no checking is possible. If one writes a dimensionally incorrect such as v = 2.0*g*h; it is only possible to detect the dimensionally inconsistence if 2.0 has dimension 1, otherwise nothing can be said about that, since not all terms in the would have well-specified dimensions. In fact, a modeller is most likely going to write: or v = 2*g*h; v = sqrt(2*g*h); using Integer literal constants. In this case, the same considerations stated above apply, once the Integer constant 2 has been converted to the Real constant 2.0, according to the rules stated in Section With this proposal, one should not write expressions mixing literal and non-literal terms, when the literal term is assumed to have a dimensions other than 1, e.g.: Modelica.SIunits.Voltage v; v = 4*i; which may be considered as a bad modelling style, as the preferred way to write physical s is to first define a physical variable or parameter that has value 4 in SI units and then use it in the instead of the literal constant, e.g.: Modelica.SIunits.Voltage v; parameter Modelica.SIunits.Resistance R = 4; v = R*i;
3 MCP 0027 UnitsLiteralConstants In Development v1 3 However, there are a few cases in which it is not possible to assume that a literal constant has dimention 1, otherwise the result would be unintendedly dimensionally inconsistent. In all these cases, the unit of the literal constant is kept to the default value for the Real type, that is,. a) Equations or assignments in the form <variable> = <expr>; or <variable>:=<expr>;, where <expr> is an expression containing only literal constants, arithmetic operators (excluding operator overloading), and built-in mathematical functions This includes all binding s such as Modelica.SIunits.Voltage v = 3; constant Modelica.SIunits.Acceleration g = ; parameter Modelica.SIunits.Length L = sqrt(2)*14.5; and all s and assignments such as v = 3; a := T := whose straightforward interpretation is that the literals in the expressions have unit=, so that the s and assignment are not dimensionally inconsistent. b) relations Relations in conditions or assertions are often written by indicating the limit value with a literal constant or literal expression, e.g. when F > 100 then... if T > then... assert(1e6 <= p, Pressure too low ); These cases should also obviously not trigger unit checking warning, so the literal constants have unit= here as well. c) the constant is zero If one writes Modelica.SIunits.MassFlowRate mflow[:]; Modelica.SIunits.Current i1, i2, i3; 0 = sum(mflow); i1 + i2 + i3 = 0; then obviously the s are dimensionally consistent no matter what the unit of the non-literal side is. In order to avoid triggering unit checking warnings, one should assume that the literal constant 0.0 has unit=. This is also needed to correctly deal with s such as Boolean on; Modelica.SIunits.Voltage V; Modelica.SIunits.Resistance R; i = if on then v/r else 0;
4 MCP 0027 UnitsLiteralConstants In Development v Issues with the existing MSL. The Modelica.Electrical.Analog.Ideal.IdealNode contains the following code: Boolean off(start=true) "Switching state"; protected Real s(start=0, final unit="1") "Auxiliary variable for actual position on the ideal diode characteristic"; /* s = 0: knee point s < 0: below knee point, conducting s > 0: above knee point, locking */ constant Modelica.SIunits.Voltage unitvoltage=1; constant Modelica.SIunits.Current unitcurrent=1; v = (s*unitcurrent)*(if off then 1 else Ron) + Vknee; i = (s*unitvoltage)*(if off then Goff else 1) + Goff*Vknee; LossPower = v*i; The current proposal would lead to the assumption that 1 has unit 1 in the conditional expressions, leading to dimensionally inconsistent s. On the other hand one could argue that writing those s as: constant Modelica.SIunits.Resistance unitresistance = 1; constant Modelica.SIunits.Resistance unitconductance = 1; V = (s*unitcurrent)*(if off then unitresistance else Ron) + Vknee; i = (s*unitvoltage)*(if off then Goff else unitconductance) + Goff*Vknee; would actually be more elegant and correct. This formulation would be dimensionally consistent according to the current proposal. We think this small update in the MSL is worth carrying out. 3. Proposed Changes in Specification The precise text of the proposed changes with respect to Modelica Specification 3.4 is found in the accompanying document MCP_0027_UnitsLiteralConstants_SpecChanges.pdf. 4. Backwards Compatibility The proposed MCP only clarifies a currently ambiguous point, i.e., what is the unit of literal Real constants. Some Modelica tools may take some implicit assumptions on this, but that is not standardized, and in the opinion of the authors of this MCP too lax, also. As unit checking typically only gives a warning in Modelica tools, there should be no serious problems of backwards compatibility. The proposal is 100% backwards compatible, in thee sense that the validity of a Modelica model is not formally constrained or restricted by unit consistency. Anyway, this proposal requires as few as possible modifications to the existing code bases (in particular the MSL) to ensure that unit checking is only affected positively, i.e., reducing the likelihood that a dimensionally incorrect model passes unit checking, whithout at the same time increasing the likelihood that existing correct models get diagnosed as not dimensionally consistent by unit checking. In particular, there are just a few places in the MSL where literal constants have been used in expressions, meaning a quantity with dimensions, e.g., if off then 1 else Ron, where 1 means
5 MCP 0027 UnitsLiteralConstants In Development v1 5 1 Ohm. These cases can be spotted easily because they will generate an additional warning when the new rules are used, and should be corrected as suggested at the end of Section Tool Implementation 5.1 Experience with Prototype As of today, there are no test implementations yet. However, the proposal could be implemented and tested in OpenModelica very quickly, as it is only a minor addition to the existing type checking mechanism. It will then be possible to automatically check the impact of this MCP on the MSL and on a large number of open source Modelica libraries for which OpenModelica coverage is ran on a nightly basis.
Programming Languages Third Edition
Programming Languages Third Edition Chapter 12 Formal Semantics Objectives Become familiar with a sample small language for the purpose of semantic specification Understand operational semantics Understand
More informationModelica Change Proposal MCP-0021 Component Iterators Status: Under Evaluation , version v2, #1848
Modelica Change Proposal MCP-0021 Component Iterators Status: Under Evaluation 2015-12-08, version v2, #1848 Summary It is proposed to generalize iterator expressions so that a class name can be used as
More informationNote that in this definition, n + m denotes the syntactic expression with three symbols n, +, and m, not to the number that is the sum of n and m.
CS 6110 S18 Lecture 8 Structural Operational Semantics and IMP Today we introduce a very simple imperative language, IMP, along with two systems of rules for evaluation called small-step and big-step semantics.
More informationIntroduction to Axiomatic Semantics
Introduction to Axiomatic Semantics Meeting 10, CSCI 5535, Spring 2009 Announcements Homework 3 due tonight Homework 2 is graded 13 (mean), 14 (median), out of 21 total, but Graduate class: final project
More informationSemantics. There is no single widely acceptable notation or formalism for describing semantics Operational Semantics
There is no single widely acceptable notation or formalism for describing semantics Operational Describe the meaning of a program by executing its statements on a machine, either simulated or actual. The
More informationFlow Control. So Far: Writing simple statements that get executed one after another.
Flow Control So Far: Writing simple statements that get executed one after another. Flow Control So Far: Writing simple statements that get executed one after another. Flow control allows the programmer
More informationCS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University
9/5/6 CS Introduction to Computing II Wayne Snyder Department Boston University Today: Arrays (D and D) Methods Program structure Fields vs local variables Next time: Program structure continued: Classes
More informationAXIOMS OF AN IMPERATIVE LANGUAGE PARTIAL CORRECTNESS WEAK AND STRONG CONDITIONS. THE AXIOM FOR nop
AXIOMS OF AN IMPERATIVE LANGUAGE We will use the same language, with the same abstract syntax that we used for operational semantics. However, we will only be concerned with the commands, since the language
More informationChapter 3. Describing Syntax and Semantics ISBN
Chapter 3 Describing Syntax and Semantics ISBN 0-321-49362-1 Chapter 3 Topics Describing the Meanings of Programs: Dynamic Semantics Copyright 2015 Pearson. All rights reserved. 2 Semantics There is no
More informationOperational Semantics. One-Slide Summary. Lecture Outline
Operational Semantics #1 One-Slide Summary Operational semantics are a precise way of specifying how to evaluate a program. A formal semantics tells you what each expression means. Meaning depends on context:
More informationAxioms: Semantics Aspects of C++ Concepts
Doc no: N2887=09-0077 Date: 2009-06-21 Project: ISO/IEC JTC1/SC22/WG21 Reply-To: Gabriel Dos Reis gdr@cs.tamu.edu Axioms: Semantics Aspects of C++ Concepts Gabriel Dos Reis Bjarne Stroustrup Alisdair Meredith
More informationInteraction Design. Task Analysis & Modelling
Interaction Design Task Analysis & Modelling This Lecture Conducting task analysis Constructing task models Understanding the shortcomings of task analysis Task Analysis for Interaction Design Find out
More informationSemantics of programming languages
Semantics of programming languages Informatics 2A: Lecture 28 Mary Cryan School of Informatics University of Edinburgh mcryan@inf.ed.ac.uk 21 November 2018 1 / 18 Two parallel pipelines A large proportion
More informationLecture 1 Contracts. 1 A Mysterious Program : Principles of Imperative Computation (Spring 2018) Frank Pfenning
Lecture 1 Contracts 15-122: Principles of Imperative Computation (Spring 2018) Frank Pfenning In these notes we review contracts, which we use to collectively denote function contracts, loop invariants,
More informationThese are notes for the third lecture; if statements and loops.
These are notes for the third lecture; if statements and loops. 1 Yeah, this is going to be the second slide in a lot of lectures. 2 - Dominant language for desktop application development - Most modern
More informationCSc 520 Principles of Programming Languages
CSc 520 Principles of Programming Languages 50: Semantics Introduction Christian Collberg collberg@cs.arizona.edu Department of Computer Science University of Arizona Copyright c 2005 Christian Collberg
More informationLecture Notes on Contracts
Lecture Notes on Contracts 15-122: Principles of Imperative Computation Frank Pfenning Lecture 2 August 30, 2012 1 Introduction For an overview the course goals and the mechanics and schedule of the course,
More informationHow to Improve FMI Compliance
1 FMI Cross Check: How to Improve FMI Compliance Revisions: 28.07.15 V3.1 with all ticket changes proposed for voting at Steering Committee meeting (AJ) accepted by Steering Committee 28.7.2015 19.06.15
More informationRationale for TR Extension to the programming language C. Decimal Floating-Point Arithmetic
Rationale for TR 24732 Extension to the programming language C Decimal Floating-Point Arithmetic Contents 1 Introduction... 1 1.1 Background... 1 1.2 The Arithmetic Model...3 1.3 The Encodings... 3 2 General...
More informationIntroduction to Programming in C Department of Computer Science and Engineering. Lecture No. #44. Multidimensional Array and pointers
Introduction to Programming in C Department of Computer Science and Engineering Lecture No. #44 Multidimensional Array and pointers In this video, we will look at the relation between Multi-dimensional
More informationCMSC 330: Organization of Programming Languages. Formal Semantics of a Prog. Lang. Specifying Syntax, Semantics
Recall Architecture of Compilers, Interpreters CMSC 330: Organization of Programming Languages Source Scanner Parser Static Analyzer Operational Semantics Intermediate Representation Front End Back End
More informationSystem Verilog Tagged Unions and Pattern Matching
System Verilog Tagged Unions and Pattern Matching (An extension to System Verilog 3.1 proposed to Accellera) Bluespec, Inc. Contact: Rishiyur S. Nikhil, CTO, Bluespec, Inc. 200 West Street, 4th Flr., Waltham,
More informationIndustrial Evaluation of an Efficient Equation Model Debugger in OpenModelica
Industrial Evaluation of an Efficient Equation Model Debugger in OpenModelica Åke Kinnander Siemens Turbo Machinery AB Finspång, Sweden ake.kinnander@outlook.com Martin Sjölund Dept. Computer and Information
More informationProgramming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur
Programming in C++ Prof. Partha Pratim Das Department of Computer Science and Engineering Indian Institute of Technology, Kharagpur Lecture 04 Programs with IO and Loop We will now discuss the module 2,
More informationSystem Verilog Tagged Unions and Pattern Matching
System Verilog Tagged Unions and Pattern Matching (An extension to System Verilog 3.1 proposed to Accellera) Bluespec, Inc. Contact: Rishiyur S. Nikhil, CTO, Bluespec, Inc. 200 West Street, 4th Flr., Waltham,
More informationSemantics via Syntax. f (4) = if define f (x) =2 x + 55.
1 Semantics via Syntax The specification of a programming language starts with its syntax. As every programmer knows, the syntax of a language comes in the shape of a variant of a BNF (Backus-Naur Form)
More informationLecture 1 Contracts : Principles of Imperative Computation (Fall 2018) Frank Pfenning
Lecture 1 Contracts 15-122: Principles of Imperative Computation (Fall 2018) Frank Pfenning In these notes we review contracts, which we use to collectively denote function contracts, loop invariants,
More informationRationale for TR Extension to the programming language C. Decimal Floating-Point Arithmetic
WG14 N1161 Rationale for TR 24732 Extension to the programming language C Decimal Floating-Point Arithmetic Contents 1 Introduction... 1 1.1 Background... 1 1.2 The Arithmetic Model... 3 1.3 The Encodings...
More information1 of 5 3/28/2010 8:01 AM Unit Testing Notes Home Class Info Links Lectures Newsgroup Assignmen [Jump to Writing Clear Tests, What about Private Functions?] Testing The typical approach to testing code
More information(Refer Slide Time: 00:03:51)
Computer Graphics Prof. Sukhendu Das Dept. of Computer Science and Engineering Indian Institute of Technology, Madras Lecture 17 Scan Converting Lines, Circles and Ellipses Hello and welcome everybody
More informationModelicaML: Getting Started Issue April 2012
ModelicaML: Getting Started Issue 1.6.5 13. April 2012 Wladimir Schamai EADS Innovation Works (Hamburg, Germany) Linkoping University (Linkoping, Sweden) Abstract: This document provides a short introduction
More informationSoftware Testing: A Craftsman s Approach, 4 th Edition. Chapter 5 Boundary Value Testing
Chapter 5 Boundary Value Testing Functional Testing The rationale for referring to specification-based testing as functional testing is likely due to the abstraction that any program can be viewed as a
More informationNumerical Modelling in Fortran: day 2. Paul Tackley, 2017
Numerical Modelling in Fortran: day 2 Paul Tackley, 2017 Goals for today Review main points in online materials you read for homework http://www.cs.mtu.edu/%7eshene/courses/cs201/notes/intro.html More
More informationPrinceton University. Computer Science 217: Introduction to Programming Systems. Data Types in C
Princeton University Computer Science 217: Introduction to Programming Systems Data Types in C 1 Goals of C Designers wanted C to: Support system programming Be low-level Be easy for people to handle But
More informationSoftware Quality. Chapter What is Quality?
Chapter 1 Software Quality 1.1 What is Quality? The purpose of software quality analysis, or software quality engineering, is to produce acceptable products at acceptable cost, where cost includes calendar
More informationFundamental Concepts. Chapter 1
Chapter 1 Fundamental Concepts This book is about the mathematical foundations of programming, with a special attention on computing with infinite objects. How can mathematics help in programming? There
More informationThe C++ Programming Language, Core Working Group. Title: Unary Folds and Empty Parameter Packs (revision 1)
1 Document number: P0036 Date: 2015-09-10 Project: The C++ Programming Language, Core Working Group Title: Unary Folds and Empty Parameter Packs (revision 1) Revises: N4358 Reply-to: Thibaut Le Jehan lejehan.thibaut@gmail.com
More informationHardware versus software
Logic 1 Hardware versus software 2 In hardware such as chip design or architecture, designs are usually proven to be correct using proof tools In software, a program is very rarely proved correct Why?
More informationCS 142 Style Guide Grading and Details
CS 142 Style Guide Grading and Details In the English language, there are many different ways to convey a message or idea: some ways are acceptable, whereas others are not. Similarly, there are acceptable
More informationLECTURE 16. Functional Programming
LECTURE 16 Functional Programming WHAT IS FUNCTIONAL PROGRAMMING? Functional programming defines the outputs of a program as a mathematical function of the inputs. Functional programming is a declarative
More information1. Integers. 9 * celsius / Celsius to Fahrenheit. Precedence. (9 * celsius / 5) + 32
1. Integers Evaluation of Arithmetic Expressions, Associativity and Precedence, Arithmetic Operators, Domain of Types int, unsigned int 1 Celsius to Fahrenheit // Program: fahrenheit.cpp // Convert temperatures
More informationChapter 3. Describing Syntax and Semantics
Chapter 3 Describing Syntax and Semantics Chapter 3 Topics Introduction The General Problem of Describing Syntax Formal Methods of Describing Syntax Attribute Grammars Describing the Meanings of Programs:
More informationA macro- generator for ALGOL
A macro- generator for ALGOL byh.leroy Compagnie Bull-General Electric Paris, France INTRODUCfION The concept of macro-facility is ambiguous, when applied to higher level languages. For some authorsl,2,
More informationLogic Programming Paradigm
Logic Programming Paradigm Sample Courseware Logic Programming Paradigm Logic programming offers a formalism for specifying a computation in terms of logical relations between entities. A logic program
More informationCMSC131. Library Classes
CMSC131 Designing Classes Library Classes Due to Java being 100% object-oriented, all code must live inside a class but there is some functionality/information that might be best kept in a more central
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ October 13, 2004 Lambda Calculus and Type
More informationSoftware Paradigms (Lesson 6) Logic Programming
Software Paradigms (Lesson 6) Logic Programming Table of Contents 1 Introduction... 2 2 Facts... 3 3 Predicates (Structured Terms)... 4 3.1 General Structures... 4 3.2 Predicates (Syntax)... 4 3.3 Simple
More informationDecision Structures CSC1310. Python Programming, 2/e 1
Decision Structures CSC1310 Python Programming, 2/e 1 Simple Decisions Decision structures, which are statements that allow a program to execute different sequences of instructions for different cases,
More informationFormal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5
Formal Methods of Software Design, Eric Hehner, segment 1 page 1 out of 5 [talking head] Formal Methods of Software Engineering means the use of mathematics as an aid to writing programs. Before we can
More informationMidterm 2 Solutions. CS70 Discrete Mathematics and Probability Theory, Spring 2009
CS70 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 2 Solutions Note: These solutions are not necessarily model answers. Rather, they are designed to be tutorial in nature, and sometimes
More informationAlgebraic Specifications
Object-Oriented Design Lecture 2 CSU 370 Fall 2007 (Pucella) Tuesday, Sep 11, 2007 Algebraic Specifications Last time I said a word about the abstraction barrier, separating the clients from the implementors.
More informationCITS5501 Software Testing and Quality Assurance Formal methods
CITS5501 Software Testing and Quality Assurance Formal methods Unit coordinator: Arran Stewart May 1, 2018 1 / 49 Sources Pressman, R., Software Engineering: A Practitioner s Approach, McGraw-Hill, 2005
More informationFortgeschrittene objektorientierte Programmierung (Advanced Object-Oriented Programming)
2014-03-07 Preface Fortgeschrittene objektorientierte Programmierung (Advanced Object-Oriented Programming) Coordinates: Lecturer: Web: Studies: Requirements: No. 185.211, VU, 3 ECTS Franz Puntigam http://www.complang.tuwien.ac.at/franz/foop.html
More information6.170 Lecture 6 Procedure specifications MIT EECS
6.170 Lecture 6 Procedure specifications MIT EECS Outline Satisfying a specification; substitutability Stronger and weaker specifications Comparing by hand Comparing via logical formulas Comparing via
More informationControl Structures. Lecture 4 COP 3014 Fall September 18, 2017
Control Structures Lecture 4 COP 3014 Fall 2017 September 18, 2017 Control Flow Control flow refers to the specification of the order in which the individual statements, instructions or function calls
More informationModel-Based Dynamic Optimization with OpenModelica and CasADi
Model-Based Dynamic Optimization with OpenModelica and CasADi Alachew Shitahun PELAB Programming Environment Lab, Dept. Computer Science Linköping University, SE-581 83 Linköping, Sweden Vitalij Ruge Mathematics
More informationChapter 3: Describing Syntax and Semantics. Introduction Formal methods of describing syntax (BNF)
Chapter 3: Describing Syntax and Semantics Introduction Formal methods of describing syntax (BNF) We can analyze syntax of a computer program on two levels: 1. Lexical level 2. Syntactic level Lexical
More informationSt. MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad
St. MARTIN S ENGINEERING COLLEGE Dhulapally, Secunderabad-00 014 Subject: PPL Class : CSE III 1 P a g e DEPARTMENT COMPUTER SCIENCE AND ENGINEERING S No QUESTION Blooms Course taxonomy level Outcomes UNIT-I
More informationCOSC252: Programming Languages: Semantic Specification. Jeremy Bolton, PhD Adjunct Professor
COSC252: Programming Languages: Semantic Specification Jeremy Bolton, PhD Adjunct Professor Outline I. What happens after syntactic analysis (parsing)? II. Attribute Grammars: bridging the gap III. Semantic
More informationCS 3360 Design and Implementation of Programming Languages. Exam 1
1 Spring 2017 (Thursday, March 9) Name: CS 3360 Design and Implementation of Programming Languages Exam 1 This test has 8 questions and pages numbered 1 through 7. Reminders This test is closed-notes and
More informationCOP4020 Programming Languages. Functional Programming Prof. Robert van Engelen
COP4020 Programming Languages Functional Programming Prof. Robert van Engelen Overview What is functional programming? Historical origins of functional programming Functional programming today Concepts
More informationEquality for Abstract Data Types
Object-Oriented Design Lecture 4 CSU 370 Fall 2008 (Pucella) Tuesday, Sep 23, 2008 Equality for Abstract Data Types Every language has mechanisms for comparing values for equality, but it is often not
More informationPROCESS SPECIFICATION
MODULE 6 PROCESS SPECIFICATIO OBJECTIVE QUESTIOS There are 4 alternative answers to each question. One of them is correct. Pick the correct answer. Do not guess. A key is given at the end of the module
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationAn Annotated Language
Hoare Logic An Annotated Language State and Semantics Expressions are interpreted as functions from states to the corresponding domain of interpretation Operators have the obvious interpretation Free of
More informationPython Class-Lesson1 Instructor: Yao
Python Class-Lesson1 Instructor: Yao What is Python? Python is an interpreted, object-oriented, high-level programming language with dynamic semantics. Its high-level built in data structures, combined
More information14.1 Encoding for different models of computation
Lecture 14 Decidable languages In the previous lecture we discussed some examples of encoding schemes, through which various objects can be represented by strings over a given alphabet. We will begin this
More informationLambda Calculus and Type Inference
Lambda Calculus and Type Inference Björn Lisper Dept. of Computer Science and Engineering Mälardalen University bjorn.lisper@mdh.se http://www.idt.mdh.se/ blr/ August 17, 2007 Lambda Calculus and Type
More informationCS 11 Haskell track: lecture 1
CS 11 Haskell track: lecture 1 This week: Introduction/motivation/pep talk Basics of Haskell Prerequisite Knowledge of basic functional programming e.g. Scheme, Ocaml, Erlang CS 1, CS 4 "permission of
More information! Use of formal notations. ! in software system descriptions. ! for a broad range of effects. ! and varying levels of use. !
What Are Formal Methods? David S. Rosenblum ICS 221 Winter 2001! Use of formal notations! first-order logic, state machines, etc.! in software system descriptions! system models, constraints, specifications,
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 16 Cutting Plane Algorithm We shall continue the discussion on integer programming,
More informationTyping Control. Chapter Conditionals
Chapter 26 Typing Control 26.1 Conditionals Let s expand our language with a conditional construct. We can use if0 like before, but for generality it s going to be more convenient to have a proper conditional
More informationAn Object Oriented Programming with C
An Object Oriented Programming with C By Tanmay Kasbe Dr. Ravi Singh Pippal IDEA PUBLISHING WWW.ideapublishing.in i Publishing-in-support-of, IDEA PUBLISHING Block- 9b, Transit Flats, Hudco Place Extension
More informationMainline Functional Testing Techniques
Mainline Functional Testing Techniques (4 flavors) Equivalence Partitions (another 4 flavors) Special Value Testing Output Domain (Range) Checking Decision Table Based Testing (aka Cause and Effect Graphs
More informationChapter 3. Describing Syntax and Semantics ISBN
Chapter 3 Describing Syntax and Semantics ISBN 0-321-49362-1 Chapter 3 Topics Introduction The General Problem of Describing Syntax Formal Methods of Describing Syntax Attribute Grammars Describing the
More informationSoftware Design and Analysis for Engineers
Software Design and Analysis for Engineers by Dr. Lesley Shannon Email: lshannon@ensc.sfu.ca Course Website: http://www.ensc.sfu.ca/~lshannon/courses/ensc251 Simon Fraser University Slide Set: 9 Date:
More informationChapter 3. Describing Syntax and Semantics
Chapter 3 Describing Syntax and Semantics Chapter 3 Topics Introduction The General Problem of Describing Syntax Formal Methods of Describing Syntax Attribute Grammars Describing the Meanings of Programs:
More informationEverything you did not want to know about least squares and positional tolerance! (in one hour or less) Raymond J. Hintz, PLS, PhD University of Maine
Everything you did not want to know about least squares and positional tolerance! (in one hour or less) Raymond J. Hintz, PLS, PhD University of Maine Least squares is used in varying degrees in -Conventional
More information3. Logical Values. Our Goal. Boolean Values in Mathematics. The Type bool in C++
Our Goal 3. Logical Values Boolean Functions; the Type bool; logical and relational operators; shortcut evaluation int a; std::cin >> a; if (a % 2 == 0) std::cout
More information3. Logical Values. Boolean Functions; the Type bool; logical and relational operators; shortcut evaluation
140 3. Logical Values Boolean Functions; the Type bool; logical and relational operators; shortcut evaluation Our Goal 141 int a; std::cin >> a; if (a % 2 == 0) std::cout
More informationDr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008
MATH-LITERACY MANUAL Dr. Relja Vulanovic Professor of Mathematics Kent State University at Stark c 2008 1 Real Numbers 1.1 Sets 1 1.2 Constants and Variables; Real Numbers 7 1.3 Operations with Numbers
More informationCSE 341 Section Handout #6 Cheat Sheet
Cheat Sheet Types numbers: integers (3, 802), reals (3.4), rationals (3/4), complex (2+3.4i) symbols: x, y, hello, r2d2 booleans: #t, #f strings: "hello", "how are you?" lists: (list 3 4 5) (list 98.5
More informationSubject: Scheduling Region Questions and Problems of new SystemVerilog commands
Subject: Scheduling Region Questions and Problems of new SystemVerilog commands I have read and re-read sections 14-17 of the SystemVerilog 3.1 Standard multiple times and am still confused about exactly
More informationThe syntax and semantics of Beginning Student
The syntax and semantics of Beginning Student Readings: HtDP, Intermezzo 1 (Section 8). We are covering the ideas of section 8, but not the parts of it dealing with section 6/7 material (which will come
More informationThe syntax and semantics of Beginning Student
The syntax and semantics of Beginning Student Readings: HtDP, Intermezzo 1 (Section 8). We are covering the ideas of section 8, but not the parts of it dealing with section 6/7 material (which will come
More informationSample Question Paper. Software Testing (ETIT 414)
Sample Question Paper Software Testing (ETIT 414) Q 1 i) What is functional testing? This type of testing ignores the internal parts and focus on the output is as per requirement or not. Black-box type
More informationCS 112 Introduction to Computing II. Wayne Snyder Computer Science Department Boston University
CS 112 Introduction to Computing II Wayne Snyder Department Boston University Today: Java basics: Compilation vs Interpretation Program structure Statements Values Variables Types Operators and Expressions
More informationIRAM Memo Introducing Associated Arrays in CLASS
IRAM Memo 2015-4 Introducing Associated Arrays in CLASS S. Bardeau 1, J. Pety 1,2 1. IRAM (Grenoble) 2. Observatoire de Paris January, 28 th 2016 Version 1.0 Abstract The concept of Associated Arrays is
More information3. Logical Values. Our Goal. Boolean Values in Mathematics. The Type bool in C++
Our Goal 3. Logical Values Boolean Functions; the Type bool; logical and relational operators; shortcut evaluation int a; std::cin >> a; if (a % 2 == 0) std::cout
More informationSemantics of programming languages
Semantics of programming languages Informatics 2A: Lecture 27 John Longley School of Informatics University of Edinburgh jrl@inf.ed.ac.uk 21 November, 2011 1 / 19 1 2 3 4 2 / 19 Semantics for programming
More information3. Logical Values. Our Goal. Boolean Values in Mathematics. The Type bool in C++
148 Our Goal 149 3. Logical Values Boolean Functions; the Type bool; logical and relational operators; shortcut evaluation int a; std::cin >> a; if (a % 2 == 0) std::cout
More informationOhio Tutorials are designed specifically for the Ohio Learning Standards to prepare students for the Ohio State Tests and end-ofcourse
Tutorial Outline Ohio Tutorials are designed specifically for the Ohio Learning Standards to prepare students for the Ohio State Tests and end-ofcourse exams. Math Tutorials offer targeted instruction,
More informationCS112 Lecture: Exceptions and Assertions
Objectives: CS112 Lecture: Exceptions and Assertions 1. Introduce the concepts of program robustness and reliability 2. Introduce exceptions 3. Introduce assertions Materials: 1. Online Java documentation
More informationSemantics of programming languages
Semantics of programming languages Informatics 2A: Lecture 27 Alex Simpson School of Informatics University of Edinburgh als@inf.ed.ac.uk 18 November, 2014 1 / 18 Two parallel pipelines A large proportion
More informationHandout 9: Imperative Programs and State
06-02552 Princ. of Progr. Languages (and Extended ) The University of Birmingham Spring Semester 2016-17 School of Computer Science c Uday Reddy2016-17 Handout 9: Imperative Programs and State Imperative
More informationLecture Notes on Induction and Recursion
Lecture Notes on Induction and Recursion 15-317: Constructive Logic Frank Pfenning Lecture 7 September 19, 2017 1 Introduction At this point in the course we have developed a good formal understanding
More informationConcurrent Reading and Writing of Clocks
[1]1 27 Concurrent Reading and Writing of Clocks Leslie Lamport April 1, 1988, revised November 20, 1990 Systems Research Center DEC s business and technology objectives require a strong research program.
More informationRecall from previous lecture
Recall from previous lecture Understanding customer requirements is critical to success of any software development effort Major process tasks: Requirements elicitation/analysis Drafting a requirements
More informationECE 3574: Applied Software Design: Unit Testing using Catch. Chris Wyatt
ECE 3574: Applied Software Design: Unit Testing using Catch Chris Wyatt The goal of today s meeting it to learn about a very important part of programming, testing. Unit tests Integration tests Testing
More informationProgramming Languages Third Edition. Chapter 7 Basic Semantics
Programming Languages Third Edition Chapter 7 Basic Semantics Objectives Understand attributes, binding, and semantic functions Understand declarations, blocks, and scope Learn how to construct a symbol
More information