The Formal Verification of a Distributed Realtime System. Lecture 2: Overview

Size: px
Start display at page:

Download "The Formal Verification of a Distributed Realtime System. Lecture 2: Overview"

Transcription

1 Single ECU Distributed System Notation Wolfgang Paul {sknapp, Institute for Computer Architecture and Parallel Computing, Saarland University Lecture 2: Overview March 19, 2007

2 Overview Single ECU Distributed System Notation Overview Guideline This lecture: proceed in bottom-up style construct a single ECU first connect single ECUs to distributed system argue about the distributed system based on [KP06a]

3 Guideline Single ECU Distributed System Notation Overview Guideline 1 Single ECU Instruction Set Architecture (ISA) VAMP Verification Generic Device Theory Memory Management The high-level Programming Language C0 C0 with Inline Assembler Communicating Virtual Machines 2 Distributed System Introduction to the Distributed System Serial Interfaces FlexRay-Like Interfaces Integrating Devices into the ISA Worst Case Execution Time Distributed OSEKtime-Like Operating System AutoFocus Task Model 3 Notation

4 Guideline Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM 1 Single ECU Instruction Set Architecture (ISA) VAMP Verification Generic Device Theory Memory Management The high-level Programming Language C0 C0 with Inline Assembler Communicating Virtual Machines 2 Distributed System Introduction to the Distributed System Serial Interfaces FlexRay-Like Interfaces Integrating Devices into the ISA Worst Case Execution Time Distributed OSEKtime-Like Operating System AutoFocus Task Model 3 Notation

5 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM Instruction Set Architecture (ISA) Outline specification of a DLX instruction set: consider interrupt handling based on [MP00]

6 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM VAMP Verification Verification of complex processors: scheduling functions considering internal and external interrupts Example: verified architecture micro processor (VAMP) see [BJK + 03]

7 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM Generic Device Theory Introduce generic device theory: specification integration into the processor design

8 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM Memory Management Extend the processor with memory management units (MMUs): enable hardware support for virtual machine simulation [DHP05] required for multi processing operating system kernels

9 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM The high-level programming language C0 Introduction to the C0 semantics: like PASCAL with C syntax Formal correctness proof for a compiler: from C0 to the DLX instruction set [LPP05]

10 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM C0 with Inline Assembler Extend C0 by inline assembler calls: call resulting language C0 A define semantics

11 Single ECU Distributed System Notation ISA VAMP Devices MMU C0 C0 A CVM Communicating Virtual Machines Generic operating system kernel CVM [GHLP05]: abbreviation for communicating virtual machines multi processing operating system kernel providing library of functions for: process management inter-process communication... implement CVM prove correctness

12 Guideline Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM 1 Single ECU Instruction Set Architecture (ISA) VAMP Verification Generic Device Theory Memory Management The high-level Programming Language C0 C0 with Inline Assembler Communicating Virtual Machines 2 Distributed System Introduction to the Distributed System Serial Interfaces FlexRay-Like Interfaces Integrating Devices into the ISA Worst Case Execution Time Distributed OSEKtime-Like Operating System AutoFocus Task Model 3 Notation

13 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM Introduction to the Distributed System Introduction to the distributed System: short outline fix some notation

14 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM Serial Interfaces Data transmission: local oscillators having almost equal clock frequencies no guarantee that setup and hold times of registers are met use serial interfaces review correctness proof from [BBG + 05]

15 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM FlexRay-Like Interfaces Construct specific I/O device: FlexRay-like interface called f-interface [Fle06] argue about: message broadcast local clock synchronization

16 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM Integrating Devices into the ISA Integrate a f-interface into the ISA: using techniques from [HIP05] define instructions getting interrupted by the timer interrupt easy on gate-level (constant number of hardware cycles) execution time of an instruction depends on cache hits memory hierarchy is invisible on ISA level end up with non-deterministic model

17 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM Worst Case Execution Time Pervasive correctness proofs for real-time system: worst case execution time (WCET) analysis done on register transfer level (RTL) classical program correctness proofs done on the ISA level hardware correctness proofs results first published in [KP06b]

18 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM Distributed OSEKtime-Like operating system OSEKtime-like [OSE01b] operating system called OLOS [Kna05]: realtime operating system: user processes are compiled C0 programs communication via FTCom-like [OSE01a] local message buffers specification given by distributed model called DOLOS

19 Single ECU Distributed System Notation DIST Serial f-interface ISA & Devices WCET DOLOS AFTM AutoFocus Task Model Introduce automaton-theoretic model called AutoFocus task model (AFTM): based on execution semantic of the AutoFocus [Aut] CASE tool first reported in [BBG + 06]

20 Guideline Single ECU Distributed System Notation 1 Single ECU Instruction Set Architecture (ISA) VAMP Verification Generic Device Theory Memory Management The high-level Programming Language C0 C0 with Inline Assembler Communicating Virtual Machines 2 Distributed System Introduction to the Distributed System Serial Interfaces FlexRay-Like Interfaces Integrating Devices into the ISA Worst Case Execution Time Distributed OSEKtime-Like Operating System AutoFocus Task Model 3 Notation

21 Notation Single ECU Distributed System Notation Given bit string a = a[n 1 : 0] {0, 1} n of length n. Denote natural number with binary representation a by: n 1 X a = a i 2 i i=0 Given natural numbers x {0,..., 2 n 1}. Denote binary representation of x with length n by bin n(x) {0, 1} n : bin n(x) = x Denote n bit binary addition function by + n : {0, 1} n {0, 1} n {0, 1} n a + n b = bin n( a + b mod 2 n )

22 Notation Single ECU Distributed System Notation Given bit string a = a[n 1 : 0] {0, 1} n of length n. Denote natural number with binary representation a by: n 1 X a = a i 2 i i=0 Given natural numbers x {0,..., 2 n 1}. Denote binary representation of x with length n by bin n(x) {0, 1} n : bin n(x) = x Denote n bit binary addition function by + n : {0, 1} n {0, 1} n {0, 1} n a + n b = bin n( a + b mod 2 n )

23 Notation Single ECU Distributed System Notation Given bit string a = a[n 1 : 0] {0, 1} n of length n. Denote natural number with binary representation a by: n 1 X a = a i 2 i i=0 Given natural numbers x {0,..., 2 n 1}. Denote binary representation of x with length n by bin n(x) {0, 1} n : bin n(x) = x Denote n bit binary addition function by + n : {0, 1} n {0, 1} n {0, 1} n a + n b = bin n( a + b mod 2 n )

24 Noation Single ECU Distributed System Notation Given bit x {0, 1} and natural number n, a and b. Denote bit string concatenation by : {0, 1} a {0, 1} b {0, 1} a+b, e.g.: bin 4(3) 10 = = = 14 Denote bit string where x is replicated n times by x n : x n = x... x

25 Noation Single ECU Distributed System Notation Given bit x {0, 1} and natural number n, a and b. Denote bit string concatenation by : {0, 1} a {0, 1} b {0, 1} a+b, e.g.: bin 4(3) 10 = = = 14 Denote bit string where x is replicated n times by x n : x n = x... x

26 Single ECU Distributed System Notation AutoFocus Project. S. Beyer, P. Böhm, M. Gerke, M. Hillebrand, T. In der Rieden, S. Knapp, D. Leinenbach, and W.J. Paul. Towards the Formal Verification of Lower System Layers in Automotive Systems. In 23nd IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD 2005), 2 5 October 2005, San Jose, CA, USA, Proceedings, pages IEEE, J. Botaschanjan, M. Broy, A. Gruler, A. Harhurin, S. Knapp, L. Kof, W. Paul, and M. Spichkova. On the Correctness of Upper Layers of Automotive Systems To appear. Sven Beyer, Christian Jacobi, Daniel Kröning, Dirk Leinenbach, and Wolfgang Paul. Instantiating uninterpreted functional units and memory system: Functional verification of the VAMP. In Proc. of the 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), Lecture Notes in Computer Science (LNCS), pages Springer, Iakov Dalinger, Mark Hillebrand, and Wolfgang Paul. On the Verification of Memory Management Mechanisms. In Proceedings of the 13th Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME 2005), volume 3725 of LNCS, pages Springer, FlexRay Consortium Mauro Gargano, Mark Hillebrand, Dirk Leinenbach, and Wolfgang Paul. On the Correctness of Operating System Kernels. In J. Hurd and T. F. Melham, editors, 18th International Conference on Theorem Proving in Higher Order Logics (TPHOLs 2005), volume 3603 of LNCS, pages Springer, Mark Hillebrand, Thomas In der Rieden, and Wolfgang Paul. Dealing with I/O Devices in the Context of Pervasive System Verification. In ICCD 05, pages IEEE Computer Society, Towards the Verification of Functional and Timely Behavior of an ecall Implementation.

27 Single ECU Distributed System Notation Master s thesis, Universität des Saarlandes, and Wolfgang Paul. Pervasive Verification of Distributed Real-Time Systems To appear. and Wolfgang Paul. Realistic Worst Case Execution Time Analysis in the Context of Pervasive System Verification. In Program Analysis and Compilation, Theory and Practice: Essays Dedicated to Reinhard Wilhelm, volume 4444, Dirk Leinenbach, Wolfgang Paul, and Elena Petrova. Towards the Formal Verification of a C0 Compiler: Code Generation and Implementation Correctness. In Bernhard Aichernig and Bernhard Beckert, editors, 3rd International Conference on Software Engineering and Formal Methods (SEFM 2005), 5-9 September 2005, Koblenz, Germany, pages 2 11, Silvia M. Müller and Wolfgang J. Paul. Computer Architecture: Complexity and Correctness. Springer, OSEK group. Fault Tolerant Communication (OSEK/VDX), OSEK group. Time-Triggered Operating System (OSEK/VDX),

The Formal Verification of a Distributed Realtime System. Lecture 6: Memory Management

The Formal Verification of a Distributed Realtime System. Lecture 6: Memory Management PM Simulation Wolfgang Paul {sknapp, wjp}@wjpserver.cs.uni-sb.de Institute for Computer Architecture and Parallel Computing, Saarland University Lecture 6: Memory Management March 19, 2007 Overview PM

More information

13 AutoFocus 3 - A Scientific Tool Prototype for Model-Based Development of Component-Based, Reactive, Distributed Systems

13 AutoFocus 3 - A Scientific Tool Prototype for Model-Based Development of Component-Based, Reactive, Distributed Systems 13 AutoFocus 3 - A Scientific Tool Prototype for Model-Based Development of Component-Based, Reactive, Distributed Systems Florian Hölzl and Martin Feilkas Institut für Informatik Technische Universität

More information

Pervasive Verification of an OS Microkernel

Pervasive Verification of an OS Microkernel Pervasive Verification of an OS Microkernel Inline Assembly, Memory Consumption, Concurrent Devices Eyad Alkassar,, Wolfgang J. Paul, Artem Starostin,, and Alexandra Tsyban Computer Science Department

More information

Verifying the entire hardware of distributed real time systems

Verifying the entire hardware of distributed real time systems Verifying the entire hardware of distributed real time systems W. Paul Universität Saarbrücken wiss. Gesamtprojektleiter bmb+f Projekt Verisoft www.verisoft.de You all know how to design hardware... Hardware

More information

ait: WORST-CASE EXECUTION TIME PREDICTION BY STATIC PROGRAM ANALYSIS

ait: WORST-CASE EXECUTION TIME PREDICTION BY STATIC PROGRAM ANALYSIS ait: WORST-CASE EXECUTION TIME PREDICTION BY STATIC PROGRAM ANALYSIS Christian Ferdinand and Reinhold Heckmann AbsInt Angewandte Informatik GmbH, Stuhlsatzenhausweg 69, D-66123 Saarbrucken, Germany info@absint.com

More information

FlexRay for Avionics: Automatic Verification with Parametric Physical Layers

FlexRay for Avionics: Automatic Verification with Parametric Physical Layers FlexRay for Avionics: Automatic Verification with Parametric Physical Layers Michael Gerke, Rüdiger Ehlers, Bernd Finkbeiner, and Hans-Jörg Peter Reactive Systems Group, Saarland University, 66123 Saarbrücken,

More information

Pervasive Compiler Verification From Verified Programs to Verified Systems

Pervasive Compiler Verification From Verified Programs to Verified Systems Electronic Notes in Theoretical Computer Science 217 (2008) 23 40 www.elsevier.com/locate/entcs Pervasive Compiler Verification From Verified Programs to Verified Systems Dirk Leinenbach 1,2,3 German Research

More information

Towards A Formal Theory of On Chip Communications in the ACL2 Logic

Towards A Formal Theory of On Chip Communications in the ACL2 Logic (c) Julien Schmaltz, ACL2 2006, San José August 15-16 p. 1/37 Towards A Formal Theory of On Chip Communications in the ACL2 Logic Julien Schmaltz Saarland University - Computer Science Department Saarbrücken,

More information

Completing the Automated Verification of a Small Hypervisor - Assembler Code Verification

Completing the Automated Verification of a Small Hypervisor - Assembler Code Verification Completing the Automated Verification of a Small Hypervisor - Assembler Code Verification Wolfgang Paul, Sabine Schmaltz, and Andrey Shadrin Saarland University, Germany {wjp,sabine,shavez}(at)wjpserver.cs.uni-saarland.de

More information

Data-Flow Based Detection of Loop Bounds

Data-Flow Based Detection of Loop Bounds Data-Flow Based Detection of Loop Bounds Christoph Cullmann and Florian Martin AbsInt Angewandte Informatik GmbH Science Park 1, D-66123 Saarbrücken, Germany cullmann,florian@absint.com, http://www.absint.com

More information

Correct Microkernel Primitives

Correct Microkernel Primitives Electronic Notes in Theoretical Computer Science 217 (2008) 169 185 www.elsevier.com/locate/entcs Correct Microkernel Primitives Artem Starostin a,1 Alexandra Tsyban a,2 a Computer Science Department,

More information

Formal Pervasive Verification of a Paging Mechanism

Formal Pervasive Verification of a Paging Mechanism Formal Pervasive Verification of a Paging Mechanism Eyad Alkassar, Norbert Schirmer, and Artem Starostin Computer Science Department - Saarland University {eyad,nschirmer,starostin}@wjpserver.cs.uni-sb.de

More information

The Impact of Write Back on Cache Performance

The Impact of Write Back on Cache Performance The Impact of Write Back on Cache Performance Daniel Kroening and Silvia M. Mueller Computer Science Department Universitaet des Saarlandes, 66123 Saarbruecken, Germany email: kroening@handshake.de, smueller@cs.uni-sb.de,

More information

A Partial Correctness Proof for Programs with Decided Specifications

A Partial Correctness Proof for Programs with Decided Specifications Applied Mathematics & Information Sciences 1(2)(2007), 195-202 An International Journal c 2007 Dixie W Publishing Corporation, U. S. A. A Partial Correctness Proof for Programs with Decided Specifications

More information

How useful is the UML profile SPT without Semantics? 1

How useful is the UML profile SPT without Semantics? 1 How useful is the UML profile SPT without Semantics? 1 Susanne Graf, Ileana Ober VERIMAG 2, avenue de Vignate - F-38610 Gières - France e-mail:{susanne.graf, Ileana.Ober}@imag.fr http://www-verimag.imag.fr/~{graf,iober}

More information

Integrating a Verified Compiler and a Verified Garbage Collector

Integrating a Verified Compiler and a Verified Garbage Collector Saarland University Faculty of Natural Sciences and Technology I Department of Computer Science Master s Thesis Integrating a Verified Compiler and a Verified Garbage Collector submitted by Mikhail Kovalev

More information

OSEK/VDX. Time-Triggered Operating System. Version 1.0. July 24 th 2001

OSEK/VDX. Time-Triggered Operating System. Version 1.0. July 24 th 2001 OSEK/VDX Version 1.0 July 24 th 2001 This document is an official release. The OSEK group retains the right to make changes to this document without notice and does not accept any liability for errors.

More information

Pervasive Compiler Verification From Verified Programs to Verified Systems

Pervasive Compiler Verification From Verified Programs to Verified Systems SSV 2008 Pervasive Compiler Verification From Verified Programs to Verified Systems Dirk Leinenbach 1,2,3 German Research Center for Artificial Intelligence (DFKI) P.O. Box 15 11 50 66041 Saarbrücken,

More information

Proof Pearl: The Termination Analysis of Terminator

Proof Pearl: The Termination Analysis of Terminator Proof Pearl: The Termination Analysis of Terminator Joe Hurd Computing Laboratory Oxford University joe.hurd@comlab.ox.ac.uk Abstract. Terminator is a static analysis tool developed by Microsoft Research

More information

FlexRay The Hardware View

FlexRay The Hardware View A White Paper Presented by IPextreme FlexRay The Hardware View Stefan Schmechtig / Jens Kjelsbak February 2006 FlexRay is an upcoming networking standard being established to raise the data rate, reliability,

More information

Computer Architecture

Computer Architecture Computer Architecture Springer-Verlag Berlin Heidelberg GmbH Silvia M. Mueller Wolfgang J. Paul Computer Architecture Complexity and Correctness With 214 Figures and 185 Tables Springer Silvia Melitta

More information

Seminar Software Quality and Safety

Seminar Software Quality and Safety Seminar Software Quality and Safety SCADE a model-driven Software Development Environment by Dominik Protte Software Engineering Group Universität Paderborn Motivation Many safety-critical components in

More information

COMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University

COMP 763. Eugene Syriani. Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science. McGill University Eugene Syriani Ph.D. Student in the Modelling, Simulation and Design Lab School of Computer Science McGill University 1 OVERVIEW In the context In Theory: Timed Automata The language: Definitions and Semantics

More information

ARTIST-Relevant Research from Linköping

ARTIST-Relevant Research from Linköping ARTIST-Relevant Research from Linköping Department of Computer and Information Science (IDA) Linköping University http://www.ida.liu.se/~eslab/ 1 Outline Communication-Intensive Real-Time Systems Timing

More information

Communication Networks for the Next-Generation Vehicles

Communication Networks for the Next-Generation Vehicles Communication Networks for the, Ph.D. Electrical and Computer Engg. Dept. Wayne State University Detroit MI 48202 (313) 577-3855, smahmud@eng.wayne.edu January 13, 2005 4 th Annual Winter Workshop U.S.

More information

A High Integrity Distributed Deterministic Java Environment. WORDS 2002 January 7, San Diego CA

A High Integrity Distributed Deterministic Java Environment. WORDS 2002 January 7, San Diego CA A High Integrity Distributed Deterministic Java Environment WORDS 2002 January 7, San Diego CA João Ventura Skysoft Portugal SA Fridtjof Siebert & Andy Walter aicas GmbH James Hunt Forschungszentrum Informatik

More information

FROM TIME-TRIGGERED TO TIME-DETERMINISTIC REAL-TIME SYSTEMS

FROM TIME-TRIGGERED TO TIME-DETERMINISTIC REAL-TIME SYSTEMS FROM TIME-TRIGGERED TO TIME-DETERMINISTIC REAL-TIME SYSTEMS Peter Puschner and Raimund Kirner Vienna University of Technology, A-1040 Vienna, Austria {peter, raimund}@vmars.tuwien.ac.at Abstract Keywords:

More information

Driving the standard for optimized embedded systems

Driving the standard for optimized embedded systems TM Driving the standard for optimized embedded systems By Michael O Donnell he embedded engineering community has recognized OSEK/VDX as an optimal standard for creating embedded applications. Its primary

More information

Syllabi of the Comprehensive Examination in Computer Science

Syllabi of the Comprehensive Examination in Computer Science Syllabi of the Comprehensive Examination in Computer Science The material of the comprehensive examination is drawn mostly from the undergraduate curriculum at Kuwait University and is updated to reflect

More information

Static Program Analysis

Static Program Analysis Static Program Analysis Lecture 1: Introduction to Program Analysis Thomas Noll Lehrstuhl für Informatik 2 (Software Modeling and Verification) noll@cs.rwth-aachen.de http://moves.rwth-aachen.de/teaching/ws-1415/spa/

More information

Analyzing Robustness of UML State Machines

Analyzing Robustness of UML State Machines Analyzing Robustness of UML State Machines Reinhard von Hanxleden Department of Computer Science and Applied Mathematics Real-Time Systems and Embedded Systems Group Christian-Albrecht Universität zu Kiel

More information

The Implications of Optimality Results for Incremental Model Synchronization for TGGs Holger Giese, Stephan Hildebrandt

The Implications of Optimality Results for Incremental Model Synchronization for TGGs Holger Giese, Stephan Hildebrandt The Implications of Optimality Results for Incremental Model Synchronization for TGGs Bi-directional transformations (BX) Theory and Applications Across Disciplines (13w5115) December 1-6, 2013 Holger

More information

Fault tolerant TTCAN networks

Fault tolerant TTCAN networks Fault tolerant TTCAN networks B. MŸller, T. FŸhrer, F. Hartwich, R. Hugel, H. Weiler, Robert Bosch GmbH TTCAN is a time triggered layer using the CAN protocol to communicate in a time triggered fashion.

More information

Timing Definition Language (TDL) Concepts, Code Generation and Tools

Timing Definition Language (TDL) Concepts, Code Generation and Tools Timing Definition Language (TDL) Concepts, Code Generation and Tools Wolfgang Pree Embedded Software & Systems Research Center Department of Computer Sciences Univ. Salzburg Overview Motivation Timing

More information

Model-Based Design of Automotive RT Applications

Model-Based Design of Automotive RT Applications Model-Based Design of Automotive RT Applications Presentation Modeling approach Modeling concept Realization in tool chain Use cases Challenges in the automotive environment The automotive electronics

More information

Model Checking the FlexRay Physical Layer Protocol

Model Checking the FlexRay Physical Layer Protocol Model hecking the FlexRay Physical Layer Protocol Michael Gerke, Rüdiger Ehlers, Bernd Finkbeiner, and Hans-Jörg Peter Reactive Systems Group Saarland University 66123 Saarbrücken, Germany {gerke ehlers

More information

A Reliable Gateway for In-vehicle Networks

A Reliable Gateway for In-vehicle Networks Proceedings of the 17th World Congress The International Federation of Automatic Control A Reliable Gateway for In-vehicle Networks S. H. Seo*, J. H. Kim*, T. Y. Moon* S. H. Hwang**, K. H. Kwon*, J. W.

More information

Better Avionics Software Reliability by Code Verification

Better Avionics Software Reliability by Code Verification Better Avionics Software Reliability by Code Verification A Glance at Code Verification Methodology in the Verisoft XT Project Christoph Baumann 1, Bernhard Beckert 2, Holger Blasum 3, and Thorsten Bormer

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

Complexity Theory VU , SS General Information. Reinhard Pichler

Complexity Theory VU , SS General Information. Reinhard Pichler Complexity Theory Complexity Theory VU 181.142, SS 2018 1. General Information Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 06 March, 2018 Reinhard

More information

ONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES *

ONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES * ONE-STACK AUTOMATA AS ACCEPTORS OF CONTEXT-FREE LANGUAGES * Pradip Peter Dey, Mohammad Amin, Bhaskar Raj Sinha and Alireza Farahani National University 3678 Aero Court San Diego, CA 92123 {pdey, mamin,

More information

A Scalable Multiprocessor for Real-time Signal Processing

A Scalable Multiprocessor for Real-time Signal Processing A Scalable Multiprocessor for Real-time Signal Processing Daniel Scherrer, Hans Eberle Institute for Computer Systems, Swiss Federal Institute of Technology CH-8092 Zurich, Switzerland {scherrer, eberle}@inf.ethz.ch

More information

instruction fetch memory interface signal unit priority manager instruction decode stack register sets address PC2 PC3 PC4 instructions extern signals

instruction fetch memory interface signal unit priority manager instruction decode stack register sets address PC2 PC3 PC4 instructions extern signals Performance Evaluations of a Multithreaded Java Microcontroller J. Kreuzinger, M. Pfeer A. Schulz, Th. Ungerer Institute for Computer Design and Fault Tolerance University of Karlsruhe, Germany U. Brinkschulte,

More information

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

Static Program Analysis

Static Program Analysis Static Program Analysis Thomas Noll Software Modeling and Verification Group RWTH Aachen University https://moves.rwth-aachen.de/teaching/ss-18/spa/ Preliminaries Outline of Lecture 1 Preliminaries Introduction

More information

Static Memory and Timing Analysis of Embedded Systems Code

Static Memory and Timing Analysis of Embedded Systems Code Static Memory and Timing Analysis of Embedded Systems Code Christian Ferdinand Reinhold Heckmann Bärbel Franzen AbsInt Angewandte Informatik GmbH Science Park 1, D-66123 Saarbrücken, Germany Phone: +49-681-38360-0

More information

Timing analysis and timing predictability

Timing analysis and timing predictability Timing analysis and timing predictability Architectural Dependences Reinhard Wilhelm Saarland University, Saarbrücken, Germany ArtistDesign Summer School in China 2010 What does the execution time depends

More information

Formal Specification and Verification of ARM6 M.J.C. Gordon Computer Laboratory University of Cambridge

Formal Specification and Verification of ARM6 M.J.C. Gordon Computer Laboratory University of Cambridge Formal Specification and Verification of ARM6 M.J.C. Gordon Computer Laboratory University of Cambridge Final Report to EPSRC on grant GR/N13135 The titles of the sections that follow are taken from: NOTES

More information

Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection

Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection Precise and Efficient FIFO-Replacement Analysis Based on Static Phase Detection Daniel Grund 1 Jan Reineke 2 1 Saarland University, Saarbrücken, Germany 2 University of California, Berkeley, USA Euromicro

More information

2. Introduction to Software for Embedded Systems

2. Introduction to Software for Embedded Systems 2. Introduction to Software for Embedded Systems Lothar Thiele ETH Zurich, Switzerland 2-1 Contents of Lectures (Lothar Thiele) 1. Introduction to Embedded System Design 2. Software for Embedded Systems

More information

A Programming Language Based Analysis of Operand Forwarding

A Programming Language Based Analysis of Operand Forwarding A Programming Language Based Analysis of Operand Forwarding Lennart Beringer Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh Mayfield Road, Edinburgh EH3 9JZ,

More information

A Mechanism for Sequential Consistency in a Distributed Objects System

A Mechanism for Sequential Consistency in a Distributed Objects System A Mechanism for Sequential Consistency in a Distributed Objects System Cristian Ţăpuş, Aleksey Nogin, Jason Hickey, and Jerome White California Institute of Technology Computer Science Department MC 256-80,

More information

Embedding Cryptol in Higher Order Logic

Embedding Cryptol in Higher Order Logic Embedding Cryptol in Higher Order Logic Joe Hurd Computer Laboratory Cambridge University joe.hurd@cl.cam.ac.uk 10 March 2007 Abstract This report surveys existing approaches to embedding Cryptol programs

More information

TIMES A Tool for Modelling and Implementation of Embedded Systems

TIMES A Tool for Modelling and Implementation of Embedded Systems TIMES A Tool for Modelling and Implementation of Embedded Systems Tobias Amnell, Elena Fersman, Leonid Mokrushin, Paul Pettersson, and Wang Yi Uppsala University, Sweden. {tobiasa,elenaf,leom,paupet,yi}@docs.uu.se.

More information

A Simpl Shortest Path Checker Verification

A Simpl Shortest Path Checker Verification A Simpl Shortest Path Checker Verification Christine Rizkallah Max-Planck-Institut für Informatik, Saarbrücken, Germany Abstract. Verification of complex algorithms with current verification tools in reasonable

More information

Timing Analysis on Complex Real-Time Automotive Multicore Architectures

Timing Analysis on Complex Real-Time Automotive Multicore Architectures 2 nd Workshop on Mapping Applications to MPSoCs St. Goar, June 2009 Timing Analysis on Complex Real-Time Automotive Multicore Architectures Mircea Negrean Simon Schliecker Rolf Ernst Technische Universität

More information

Distributed IMA with TTEthernet

Distributed IMA with TTEthernet Distributed IMA with thernet ARINC 653 Integration of thernet Georg Gaderer, Product Manager Georg.Gaderer@tttech.com October 30, 2012 Copyright TTTech Computertechnik AG. All rights reserved. Introduction

More information

Modeling with the Timing Definition Language (TDL)

Modeling with the Timing Definition Language (TDL) Modeling with the Timing Definition Language (TDL) W. Pree, J. Templ Automotive Software Workshop San Diego (ASWSD 2006) on Model-Driven Development of Reliable Automotive Services San Diego, CA (USA)

More information

HIERARCHICAL DESIGN. RTL Hardware Design by P. Chu. Chapter 13 1

HIERARCHICAL DESIGN. RTL Hardware Design by P. Chu. Chapter 13 1 HIERARCHICAL DESIGN Chapter 13 1 Outline 1. Introduction 2. Components 3. Generics 4. Configuration 5. Other supporting constructs Chapter 13 2 1. Introduction How to deal with 1M gates or more? Hierarchical

More information

Outline HIERARCHICAL DESIGN. 1. Introduction. Benefits of hierarchical design

Outline HIERARCHICAL DESIGN. 1. Introduction. Benefits of hierarchical design Outline HIERARCHICAL DESIGN 1. Introduction 2. Components 3. Generics 4. Configuration 5. Other supporting constructs Chapter 13 1 Chapter 13 2 1. Introduction How to deal with 1M gates or more? Hierarchical

More information

In March 2007, over 200 developers met in Stuttgart for the. control algorithms that have become increasingly faster are

In March 2007, over 200 developers met in Stuttgart for the. control algorithms that have become increasingly faster are FlexRay is Driving Partners demonstrate successful system development at the FlexRay Symposium In March 2007, over 200 developers met in Stuttgart for the FlexRay Symposium sponsored by Vector Informatik.

More information

Design For High Performance Flexray Protocol For Fpga Based System

Design For High Performance Flexray Protocol For Fpga Based System IOSR Journal of VLSI and Signal Processing (IOSR-JVSP) e-issn: 2319 4200, p-issn No. : 2319 4197 PP 83-88 www.iosrjournals.org Design For High Performance Flexray Protocol For Fpga Based System E. Singaravelan

More information

Product Information Embedded Operating Systems

Product Information Embedded Operating Systems Product Information Embedded Operating Systems Table of Contents 1 Operating Systems for ECUs... 3 2 MICROSAR.OS The Real-Time Operating System for the AUTOSAR Standard... 3 2.1 Overview of Advantages...

More information

Automatic Qualification of Abstract Interpretation-based Static Analysis Tools. Christian Ferdinand, Daniel Kästner AbsInt GmbH 2013

Automatic Qualification of Abstract Interpretation-based Static Analysis Tools. Christian Ferdinand, Daniel Kästner AbsInt GmbH 2013 Automatic Qualification of Abstract Interpretation-based Static Analysis Tools Christian Ferdinand, Daniel Kästner AbsInt GmbH 2013 2 Functional Safety Demonstration of functional correctness Well-defined

More information

Introduction to Verilog HDL

Introduction to Verilog HDL Introduction to Verilog HDL Ben Abdallah Abderazek National University of Electro-communications, Tokyo, Graduate School of information Systems May 2004 04/09/08 1 What you will understand after having

More information

FIXED PRIORITY SCHEDULING ANALYSIS OF THE POWERTRAIN MANAGEMENT APPLICATION EXAMPLE USING THE SCHEDULITE TOOL

FIXED PRIORITY SCHEDULING ANALYSIS OF THE POWERTRAIN MANAGEMENT APPLICATION EXAMPLE USING THE SCHEDULITE TOOL FIXED PRIORITY SCHEDULING ANALYSIS OF THE POWERTRAIN MANAGEMENT APPLICATION EXAMPLE USING THE SCHEDULITE TOOL Jens Larsson t91jla@docs.uu.se Technical Report ASTEC 97/03 DoCS 97/82 Department of Computer

More information

Improving Timing Analysis for Matlab Simulink/Stateflow

Improving Timing Analysis for Matlab Simulink/Stateflow Improving Timing Analysis for Matlab Simulink/Stateflow Lili Tan, Björn Wachter, Philipp Lucas, Reinhard Wilhelm Universität des Saarlandes, Saarbrücken, Germany {lili,bwachter,phlucas,wilhelm}@cs.uni-sb.de

More information

Timing Analysis of Distributed End-to-End Task Graphs with Model-Checking

Timing Analysis of Distributed End-to-End Task Graphs with Model-Checking Timing Analysis of Distributed End-to-End Task Graphs with Model-Checking Zonghua Gu Department of Computer Science, Hong Kong University of Science and Technology Abstract. Real-time embedded systems

More information

Model Based Development of Embedded Control Software

Model Based Development of Embedded Control Software Model Based Development of Embedded Control Software Part 4: Supported Target Platforms Claudiu Farcas Credits: MoDECS Project Team, Giotto Department of Computer Science cs.uni-salzburg.at Current execution

More information

Real-Time Component Software. slide credits: H. Kopetz, P. Puschner

Real-Time Component Software. slide credits: H. Kopetz, P. Puschner Real-Time Component Software slide credits: H. Kopetz, P. Puschner Overview OS services Task Structure Task Interaction Input/Output Error Detection 2 Operating System and Middleware Application Software

More information

Using Time Division Multiplexing to support Real-time Networking on Ethernet

Using Time Division Multiplexing to support Real-time Networking on Ethernet Using Time Division Multiplexing to support Real-time Networking on Ethernet Hariprasad Sampathkumar 25 th January 2005 Master s Thesis Defense Committee Dr. Douglas Niehaus, Chair Dr. Jeremiah James,

More information

Master Thesis Project Plan. Reusable Mathematical Models

Master Thesis Project Plan. Reusable Mathematical Models Master Thesis Project Plan Reusable Mathematical Models Tobias K. Widmer widmer@id.ethz.ch Supervisors: Prof. Dr. B. Meyer B. Schoeller Chair of Software Engineering Department of Computer Science, ETH

More information

MODELING LANGUAGES AND ABSTRACT MODELS. Giovanni De Micheli Stanford University. Chapter 3 in book, please read it.

MODELING LANGUAGES AND ABSTRACT MODELS. Giovanni De Micheli Stanford University. Chapter 3 in book, please read it. MODELING LANGUAGES AND ABSTRACT MODELS Giovanni De Micheli Stanford University Chapter 3 in book, please read it. Outline Hardware modeling issues: Representations and models. Issues in hardware languages.

More information

What is Computer Architecture?

What is Computer Architecture? What is Computer Architecture? Architecture abstraction of the hardware for the programmer instruction set architecture instructions: operations operands, addressing the operands how instructions are encoded

More information

Combining Timing, Localities and Migration in a Process Calculus

Combining Timing, Localities and Migration in a Process Calculus Combining Timing, Localities and Migration in a Process Calculus Andrew Hughes http://www.dcs.shef.ac.uk/~andrew Department of Computer Science University of Sheffield BCTCS - 05/04/2006 Outline 1 Introduction

More information

TDDD07 Real-time Systems Lecture 10: Wrapping up & Real-time operating systems

TDDD07 Real-time Systems Lecture 10: Wrapping up & Real-time operating systems TDDD07 Real-time Systems Lecture 10: Wrapping up & Real-time operating systems Simin Nadjm-Tehrani Real-time Systems Laboratory Department of Computer and Information Science Linköping Univerity 28 pages

More information

Standardized Basic System Software for Automotive Embedded Applications

Standardized Basic System Software for Automotive Embedded Applications Standardized Basic System Software for Automotive Embedded Applications Thomas M. Galla Elektrobit Austria GmbH Stumpergasse 48/28, A-1060 Vienna, Austria phone: +43 1 59983 15 fax: +43 1 59983 18 email:

More information

Bluespec-4: Rule Scheduling and Synthesis. Synthesis: From State & Rules into Synchronous FSMs

Bluespec-4: Rule Scheduling and Synthesis. Synthesis: From State & Rules into Synchronous FSMs Bluespec-4: Rule Scheduling and Synthesis Arvind Computer Science & Artificial Intelligence Lab Massachusetts Institute of Technology Based on material prepared by Bluespec Inc, January 2005 March 2, 2005

More information

Hardware, Software and Mechanical Cosimulation for Automotive Applications

Hardware, Software and Mechanical Cosimulation for Automotive Applications Hardware, Software and Mechanical Cosimulation for Automotive Applications P. Le Marrec, C.A. Valderrama, F. Hessel, A.A. Jerraya TIMA Laboratory 46 Avenue Felix Viallet 38031 Grenoble France fphilippe.lemarrec,

More information

A COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS. and. and

A COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS. and. and Parallel Processing Letters c World Scientific Publishing Company A COMPARISON OF MESHES WITH STATIC BUSES AND HALF-DUPLEX WRAP-AROUNDS DANNY KRIZANC Department of Computer Science, University of Rochester

More information

Verifying ARM6 Multiplication

Verifying ARM6 Multiplication Verifying ARM6 Multiplication Anthony Fox Computer Laboratory, University of Cambridge Abstract. The hol-4 proof system has been used to formally verify the correctness of the ARM6 micro-architecture.

More information

Design and Analysis of Time-Critical Systems Introduction

Design and Analysis of Time-Critical Systems Introduction Design and Analysis of Time-Critical Systems Introduction Jan Reineke @ saarland university ACACES Summer School 2017 Fiuggi, Italy computer science Structure of this Course 2. How are they implemented?

More information

Moby/plc { Graphical Development of. University of Oldenburg { Department of Computer Science. P.O.Box 2503, D Oldenburg, Germany

Moby/plc { Graphical Development of. University of Oldenburg { Department of Computer Science. P.O.Box 2503, D Oldenburg, Germany Moby/plc { Graphical Development of PLC-Automata??? Josef Tapken and Henning Dierks University of Oldenburg { Department of Computer Science P.O.Box 2503, D-26111 Oldenburg, Germany Fax: +49 441 798-2965

More information

2 nd UML 2 Semantics Symposium: Formal Semantics for UML

2 nd UML 2 Semantics Symposium: Formal Semantics for UML 2 nd UML 2 Semantics Symposium: Formal Semantics for UML Manfred Broy 1, Michelle L. Crane 2, Juergen Dingel 2, Alan Hartman 3, Bernhard Rumpe 4, and Bran Selic 5 1 Technische Universität München, Germany

More information

An LCF-Style Interface between HOL and First-Order Logic

An LCF-Style Interface between HOL and First-Order Logic An LCF-Style Interface between HOL and First-Order Logic Joe Hurd Computer Laboratory University of Cambridge, joe.hurd@cl.cam.ac.uk 1 Introduction Performing interactive proof in the HOL theorem prover

More information

Computer Hardware Requirements for Real-Time Applications

Computer Hardware Requirements for Real-Time Applications Lecture (4) Computer Hardware Requirements for Real-Time Applications Prof. Kasim M. Al-Aubidy Computer Engineering Department Philadelphia University Real-Time Systems, Prof. Kasim Al-Aubidy 1 Lecture

More information

Philip Andrew Simpson. FPGA Design. Best Practices for Team-based Reuse. Second Edition

Philip Andrew Simpson. FPGA Design. Best Practices for Team-based Reuse. Second Edition FPGA Design Philip Andrew Simpson FPGA Design Best Practices for Team-based Reuse Second Edition Philip Andrew Simpson San Jose, CA, USA ISBN 978-3-319-17923-0 DOI 10.1007/978-3-319-17924-7 ISBN 978-3-319-17924-7

More information

Caching and Demand-Paged Virtual Memory

Caching and Demand-Paged Virtual Memory Caching and Demand-Paged Virtual Memory Definitions Cache Copy of data that is faster to access than the original Hit: if cache has copy Miss: if cache does not have copy Cache block Unit of cache storage

More information

Source EE 4770 Lecture Transparency. Formatted 16:43, 30 April 1998 from lsli

Source EE 4770 Lecture Transparency. Formatted 16:43, 30 April 1998 from lsli 17-3 17-3 Rate Monotonic Priority Assignment (RMPA) Method for assigning priorities with goal of meeting deadlines. Rate monotonic priority assignment does not guarantee deadlines will be met. A pure periodic

More information

A Rigorous Correctness Proof of a Tomasulo Scheduler Supporting Precise Interrupts

A Rigorous Correctness Proof of a Tomasulo Scheduler Supporting Precise Interrupts A Rigorous Correctness Proof of a Tomasulo Scheduler Supporting Precise Interrupts Daniel Kroening, Silvia M. Mueller Ý, and Wolfgang J. Paul Dept. 14: Computer Science, University of Saarland, Post Box

More information

Model Checking VHDL with CV

Model Checking VHDL with CV Model Checking VHDL with CV David Déharbe 1, Subash Shankar 2, and Edmund M. Clarke 2 1 Universidade Federal do Rio Grande do Norte, Natal, Brazil david@dimap.ufrn.br 2 Carnegie Mellon University, Pittsburgh,

More information

Chapter 13. The ISA of a simplified DLX Why use abstractions?

Chapter 13. The ISA of a simplified DLX Why use abstractions? Chapter 13 The ISA of a simplified DLX In this chapter we describe a specification of a simple microprocessor called the simplified DLX. The specification is called an instruction set architecture (ISA).

More information

want turn==me wait req2==0

want turn==me wait req2==0 Uppaal2k: Small Tutorial Λ 16 October 2002 1 Introduction This document is intended to be used by new comers to Uppaal and verification. Students or engineers with little background in formal methods should

More information

Outline. policies. with some potential answers... MCS 260 Lecture 19 Introduction to Computer Science Jan Verschelde, 24 February 2016

Outline. policies. with some potential answers... MCS 260 Lecture 19 Introduction to Computer Science Jan Verschelde, 24 February 2016 Outline 1 midterm exam on Friday 26 February 2016 policies 2 questions with some potential answers... MCS 260 Lecture 19 Introduction to Computer Science Jan Verschelde, 24 February 2016 Intro to Computer

More information

Seamless Method- and Model-based Software and Systems Engineering

Seamless Method- and Model-based Software and Systems Engineering Seamless Method- and Model-based Software and Systems Engineering Manfred Broy Institut für Informatik, Technische Universität München D-80290 München Germany, broy@in.tum.de http://wwwbroy.informatik.tu-muenchen.de

More information

Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving

Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving Stefan Maus 1, Micha l Moskal 2, and Wolfram Schulte 3 1 Universität Freiburg, Freiburg, Germany 2 European Microsoft Innovation

More information

CSC236H Lecture 5. October 17, 2018

CSC236H Lecture 5. October 17, 2018 CSC236H Lecture 5 October 17, 2018 Runtime of recursive programs def fact1(n): if n == 1: return 1 else: return n * fact1(n-1) (a) Base case: T (1) = c (constant amount of work) (b) Recursive call: T

More information

Inductive Proof Outlines for Multithreaded Java with Exceptions

Inductive Proof Outlines for Multithreaded Java with Exceptions Inductive Proof Outlines for Multithreaded Java with Exceptions Extended Abstract 30. April, 2004 Erika Ábrahám1, Frank S. de Boer 2, Willem-Paul de Roever 1, and Martin Steffen 1 1 Christian-Albrechts-University

More information

Common Computer-System and OS Structures

Common Computer-System and OS Structures Common Computer-System and OS Structures Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection General System Architecture Oct-03 1 Computer-System Architecture

More information

Compiler Construction

Compiler Construction Compiler Construction Thomas Noll Software Modeling and Verification Group RWTH Aachen University https://moves.rwth-aachen.de/teaching/ss-16/cc/ Conceptual Structure of a Compiler Source code x1 := y2

More information