Tarski: A Platform for Automated Analysis of Dynamically Configurable Traceability Semantics
|
|
- Griselda McDowell
- 5 years ago
- Views:
Transcription
1 Tarski: A Platform for Automated Analysis of Dynamically Configurable Traceability Semantics Ferhat Erata 1,2 Moharram Challenger 1,4 Bedir Tekinerdogan 1 Anne Monceaux 3 Eray Tuzun 5 Geylani Kardas 4 1 Information Technology Group, Wageningen University, The Netherlands 2 UNIT Information Technologies R&D Ltd., Izmir, Turkey 3 System Engineering Platforms, AIRBUS Group Innovations, Toulouse, France 4 International Computer Institute, Ege University, Izmir, Turkey 5 Academy Directorate, HAVELSAN Inc., Ankara, Turkey 3rd Workshop on Dependability at Izmir Institute of Technology
2 Acknowledgements Introduction Scientific and Technological Research Council of Turkey (TUBITAK), Technology and Innovation Funding Programs Directorate (TEYDEB) under project# , Minister for the Economy, Industry and Digital Affairs of France, Directorate-General for Enterprise (DGE) under contract# European Cooperation in Science and Technology (COST) Action IC1404 Multi-Paradigm Modelling for Cyber-Physical Systems
3 Exploitations Introduction ITEA-ModelWriter: Synchronized Document Engineering Platform ITEA-ASSUME: Affordable Safe & Secure Mobility Evolution Source codes, datasets and screencasts are available at:
4 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
5 Outline Introduction Motivation Industrial Use Cases 1 Introduction Motivation Industrial Use Cases 2 3 4
6 Motivation Industrial Use Cases What is Traceability? Traceability can be defined as the degree to which a relationship can be established among work products (aka. artefacts) of the development process. What is case-based or project-based traceability configuration? Rigorously specification the semantics of traceability elements. Why is Reasoning about Traceability important? Richer and precise automated traceability analysis. Compliance and Certification in automotive and aviation industries.
7 Motivation Industrial Use Cases Challenges of Traceability in Industry Semantically meaningful traceability traceability relations should have a rich semantic (meaning) instead of being simple bi-directional referential relation Configuration of traceability (possibly dynamically) Traceability Semantics is often statically defined.
8 Motivation Industrial Use Cases Challenges of Traceability in Industry Semantically meaningful traceability traceability relations should have a rich semantic (meaning) instead of being simple bi-directional referential relation Configuration of traceability (possibly dynamically) Traceability Semantics is often statically defined. The semantics cannot be easily adapted for the needs of different projects.
9 Motivation Industrial Use Cases Challenges of Traceability in Industry Semantically meaningful traceability traceability relations should have a rich semantic (meaning) instead of being simple bi-directional referential relation Configuration of traceability (possibly dynamically) Traceability Semantics is often statically defined. The semantics cannot be easily adapted for the needs of different projects. Different traceable elements and the relation types exist in industrial settings,
10 Motivation Industrial Use Cases Challenges of Traceability in Industry Semantically meaningful traceability traceability relations should have a rich semantic (meaning) instead of being simple bi-directional referential relation Configuration of traceability (possibly dynamically) Traceability Semantics is often statically defined. The semantics cannot be easily adapted for the needs of different projects. Different traceable elements and the relation types exist in industrial settings, Likewise, different traceability analysis scenarios exists. Several industries demands formal proofs of Traceability.
11 Outline Introduction Motivation Industrial Use Cases 1 Introduction Motivation Industrial Use Cases 2 3 4
12 Airbus Group Innovations System Installation Design Principles Motivation Industrial Use Cases
13 Airbus Group Innovations System Installation Design Principles Motivation Industrial Use Cases
14 Airbus Group Innovations System Installation Design Principles Motivation Industrial Use Cases
15 Motivation Industrial Use Cases Havelsan Aerospace Electronics Industry Application Lifecycle Management DO-178C Software Considerations in Airborne Systems and Equipment Certification Traceability DO-178 requires a documented connection (called a trace) between the certification artifacts. For example, a Low Level Requirement (LLR) traces up to a High Level Requirement (HLR). A traceability analysis is then used to ensure that each requirement is fulfilled by the source code, that each requirement is tested, that each line of source code has a purpose (is connected to a requirement), and so forth. Traceability ensures the system is complete.
16 Traceability Analysis Activities defined in DO-178
17 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
18 A conceptual model for traceability and its extension Traceability elements Information {unique} 1..* Trace-element depend {xor} 0..* Trace-location 0..1 targets source 1.. * {ordered} Trace-link require satisfy XMILocation FileLocation TextLocation JavaLocation contain generate... ModelElement Requirement... EClassifier ContractRequirement... SystemRequirement
19 Semantics of contain relation (represents decomposition) Traceability elements Information {unique} 1..* XMILocation 0..* Trace-location Trace-element targets {xor} 1.. * {ordered} 0..1 source Trace-link transitive, irreflexive, antisymmetric, injective relation FileLocation TextLocation JavaLocation depend require satisfy contain generate... ModelElement Requirement... EClassifier ContractRequirement... SystemRequirement
20 Semantics of ContractRequirement Traceability elements Information {unique} 1..* Trace-element depend {xor} 0..* Trace-location 0..1 targets source 1.. * {ordered} Trace-link require satisfy XMILocation FileLocation TextLocation JavaLocation contain generate... Disjoint ModelElement subset of the set of Requirement, Domain and Co-domain of contain relation Requirement... EClassifier ContractRequirement... SystemRequirement
21 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
22 Fragments of a traceability instance X = {(U1), (S1), (S2), (U1,S1), (U1,S2)} Requirement Document [X] {(U1)} u1: UserReq {(S1)} <<refines>> ECore Design Document [Y] {(E1,E3)} e3: EClass s1: SystemReq s2: SystemReq { (U1, { (S1), (S2) }) } {(E1)} e1: EClass <<EReference>> <<inherits>> {(E2,E1)} e2: EClass {(E3)} {(S2)} {(E2)} Y = {(E1), (E2), (E3), (E2,E1), (E1,E3)} Z = {(P1), (C1), (C2), (F1), (M1), (C1,F1), (C1,M1)} + W Java Package [Z] { (F1, {(S1, E1)}) } = { (F1, S1), (F1, E1) } = jre 1 : {(F1, S1, E1)} ej 1 : {(E2, M1)} ej 2 : {(E2, M2)} ej 3 : {(E3, P2)} {(C1,F1)} f1: Field {(F1)} Java Package [W] {(M2)} {(C3,M2)} m2: Method {(C1)} c2: Class {(C1,M1)} m1: Method {(C3)} c3: Class {(C2)} {(M1)} W = {(P2), (C3), (M2), (C3,M2)}
23 First-order relational model of the traceability instance The universe of traceability of the current state D T : {S 1, E 1, E 2, E 3, F 1, M 1, M 2, P 2 } The type signature Σ T : {R EJ E C M F, R JRE F S E} The relational model under the signature Σ T M t : {S = { S 1 }, E = { E 1, E 2, E 3 }, J = { F 1, M 1, M 2, P 2 }, R EJ = { E 2, M 1, E 2, M 2, E 3, P 2 }, R JRE = { F 1, S 1, E 1 }}
24 First-order Relational Logic (FOL + Relational Calculus). Relational Join and Transpose The dot join and transpose operators ensure a uniform way of navigation between trace-locations through trace-links in constraints. ˆ(Reflexive) Transitive Closure Transitive Closure allows the encoding of common reachability constraints that otherwise could not be expressed in FOL, such as preventing cyclic dependencies between trace-locations. Domain and Range Restrictions The restriction operators are used to filter relations to a given domain or range.
25 First-order Relational Logic (FOL + Relational Calculus). Relational Join and Transpose E.R EJ = { E 1, E 2, E 3 }.{ E 2, M 1, E 2, M 2, E 3, P 2 } = { M 1, M 2, P 2 } J. R EJ = { F 1, M 1, M 2, P 2 }.{ M 1, E 2, M 2, E 2, P 2, E 3 } = { E 2, E 3 } ˆ(Reflexive) Transitive Closure ˆ{ M 1, E 1, E 1, C 1 } = { M 1, E 1, E 1, C 1, M 1, C 1 } Domain and Range Restrictions P <: R JE = { P 2 } <: { M 1, E 2, M 2, E 2, P 2, E 3 } = { P 2, E 3 }
26 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
27 Basic Type and SubType univ = {r 1,r 2,r 3,r 4,i 1,i 2,i 3 } The domain of discourse of any structure of that signature is then fragmented into disjoint subsets, one for every sort. denotes the set of all possible atoms {r 1,r 2,r 3,r 4 } Requirement Top level signatures (basic type) Implementation {i 1,i 2,i 3 } extends extends Extension signatures (subtype) in Subset signatures in {r 3 } ContractReq {r 1,r 2 } SystemReq {i 1,i 2 } Code {i 1 } Executable extends in in {r 1 } LowLevelReq {i 1 } ExecutableObjectCode Subtype (also subtype polymorphism or inclusion polymorphism) defines a subtyping relation, it is reflexive (meaning A<:A for any type A) and transitive (meaning that if A<:B and B<:C then A<:C). This makes it a preorder on types. denotes empty set and is the type of no atoms none = { }
28 Relation Types Introduction univ = {r 1,r 2,r 3,r 4,i 1,i 2,i 3 } denotes the set of all possible atoms {r 3 } {r 1,r 2,r 3,r 4 } Requirement {r 1,r 2 } Implementation in satisfiedby: SystemReq -> some Implementation {i 1,i 2,i 3 } in ContractReq SystemReq {i 1,i 2 } Code {i 1 } Executable refine: ContractReq one -> some SystemReq contain: ContractReq lone -> ContractReq {(r 3,r 1 ),(r 3,r 2 )} in in {r 1 } LowLevelReq {i 1 } ExecutableObjectCode denotes empty set and is the type of no atoms none = { }
29 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
30 Formal Specification of an example configuration 1 abstract sig Artefact { depends: set Artefact} Locate@File 4 one sig Specification extends Artefact { 5 contract: some ContractRequirement} Locate@Text 8 sig ContractRequirement extends Artefact { 9 system: set SystemRequirement, 10 contains: set ContractRequirement} Locate@ReqIF 13 sig SystemRequirement extends Artefact { 14 satisfiedby: set Implementation, 15 requires: set SystemRequirement, 16 refines: set SystemRequirement}
31 17 abstract sig Implementation extends Artefact { 18 fulfills: lone ContractRequirement} Locate@Java 21 sig Code, Component extends Implementation {} Locate@EMF 24 sig Model extends Implementation { 25 transforms, conforms: set Model, 26 generates: set ( Code Component)} Semantics@SystemRequirement. satisfiedby 29 fact { i: Implementation some i. satisfiedby}
32 Automated analysis functions over Traceability Model Consistency Checking The system checks whether the user model satisfies the specification or not. Reasoning about Trace-relations If the model is a partial (incomplete), the platform tries to complete the model with respect to the semantics declared in the specification inferring new trace-relations on the model. Trace-elements Discovery If a de-synchronization occurs on one or more ends of a trace-link probably caused by a change such as deletion of a trace-location, we try to repair the broken link based on the specified semantics.
33 Reasoning about Trace-relations system 31 fact { s: SystemRequirement, s': s.* refines 32 s'. system = s. system} Reason@SystemRequirement. requires 35 fact { s, s': SystemRequirement 36 s' in s. refines = s in s'. requires } Reason@Implementation. fulfills 39 fact { i: Implementation, s: i. satisfiedby 40 i. fulfills = s. system }
34 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
35 Configuration of User s Workspace User Traceability Framework Tarski Platform Alloy Configuration of Eclipse Workspace Loading/Updating Spec. Alloy Specification Formal Specification of the semantics Functions Load/Update Eclipse Front-End Analyze Custom Annotations uses alloy4compiler Alloy Parser User s Workspace Adaptation of Tarski Platform to Creating Trace Location Traceability Traceability Domain Text Fragments EClasses, EObjects XML Elements Java Elements... Update/Delete Trace Location Assigning Types 1 * Trace Location * to from * Trace Link Traceability Information Interpretation Function Interface interprets Model * Relation * Tuple * elements Universe * Interpreted Atom First-order Relational Model uses Abstract Syntax Tree Type hierarchy (sigs, fields) & Semantics (facts) uses generates Automated Analysis of Traceability Analyzing Traceability The user can assign types to both trace locations and links using the relation names of the specification Reasoning about trace instance Functions Consistency Check Reason about Relations Trace Elements Discovery Automated Analysis Synthesis Internal Representation Decision Procedure KodKod API Call KodKod Relational Model Finder
36 Configuration of User s Workspace
37 Type Hierarchy from the Specification User Traceability Framework Tarski Platform Alloy Configuration of Eclipse Workspace Loading/Updating Spec. Alloy Specification Formal Specification of the semantics Functions Load/Update Eclipse Front-End Analyze Custom Annotations uses alloy4compiler Alloy Parser User s Workspace Adaptation of Tarski Platform to Creating Trace Location Traceability Traceability Domain Text Fragments EClasses, EObjects XML Elements Java Elements... Update/Delete Trace Location Assigning Types 1 * Trace Location * to from * Trace Link Traceability Information Interpretation Function Interface interprets Model * Relation * Tuple * elements Universe * Interpreted Atom First-order Relational Model uses Abstract Syntax Tree Type hierarchy (sigs, fields) & Semantics (facts) uses generates Automated Analysis of Traceability Analyzing Traceability The user can assign types to both trace locations and links using the relation names of the specification Reasoning about trace instance Functions Consistency Check Reason about Relations Trace Elements Discovery Automated Analysis Synthesis Internal Representation Decision Procedure KodKod API Call KodKod Relational Model Finder
38 Type Hierarchy from the Specification
39 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
40 Creating Trace-locations and Assigning Types User Traceability Framework Tarski Platform Alloy Configuration of Eclipse Workspace Loading/Updating Spec. Alloy Specification Formal Specification of the semantics Functions Load/Update Eclipse Front-End Analyze Custom Annotations uses alloy4compiler Alloy Parser User s Workspace Adaptation of Tarski Platform to Creating Trace Location Traceability Traceability Domain Text Fragments EClasses, EObjects XML Elements Java Elements... Update/Delete Trace Location Assigning Types 1 * Trace Location * to from * Trace Link Traceability Information Interpretation Function Interface interprets Model * Relation * Tuple * elements Universe * Interpreted Atom First-order Relational Model uses Abstract Syntax Tree Type hierarchy (sigs, fields) & Semantics (facts) uses generates Automated Analysis of Traceability Analyzing Traceability The user can assign types to both trace locations and links using the relation names of the specification Reasoning about trace instance Functions Consistency Check Reason about Relations Trace Elements Discovery Automated Analysis Synthesis Internal Representation Decision Procedure KodKod API Call KodKod Relational Model Finder
41 Assigning a Sub Type to a Trace-location
42 Assigning a binary Field Type to a Trace-link
43 Selecting a Trace-Location from the co-domain of the type
44 Traceability Information...
45 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
46 First-order Relational Model...
47 Dynamic Configuration & Model Management
48 Outline Introduction 1 Introduction Motivation Industrial Use Cases 2 3 4
49 Reasoning about Trace-instance...
50
51 Synthesis of Internal Representation...
52 Should we consider also the temporal behavior of the traceability? Interesting analysis scenarios exist in industry We are not supporting ordered sets of Alloy which usually help model the dynamic behaviour. First-order theory of relations might be a candidate for traceability in Multi-pardigm Modeling for Cyber-physical Systems. Preliminary results shows that the approach works on the synchronization of design rules with design/installation of physical components. However, DPLL(T) solvers does not currently exists for this fragment of the theory. Alloy Language is too expressive for the domain of traceability. We re working on the formalization of a First-order theory for traceability and the development of a domain-specific language for traceability.
53 Modeling and Reasoning es
Alloy: A Lightweight Object Modelling Notation
Alloy: A Lightweight Object Modelling Notation Daniel Jackson, ACM Transactions on Software Engineering, 2002 Presented By: Steven Stewart, 2012-January-23 1 Alloy: 2002 to present Software is built on
More informationConceptual modeling of entities and relationships using Alloy
Conceptual modeling of entities and relationships using Alloy K. V. Raghavan Indian Institute of Science, Bangalore Conceptual modeling What is it? Capture requirements, other essential aspects of software
More informationModelWriter: Text and Model-Synchronized Document Engineering Platform
ModelWriter: Text and Model-Synchronized Document Engineering Platform Ferhat Erata, Claire Gardent, Bikash Gyawali, Anastasia Shimorina, Yvan Lussaud, Bedir Tekinerdogan, Geylani Kardas, and Anne Monceaux
More informationFrom: FM 2006 Alloy Intro and Logic. Greg Dennis and Rob Seater Software Design Group, MIT
From: FM 2006 Alloy Intro and Logic Greg Dennis and Rob Seater Software Design Group, MIT agenda Intro & Logic Language & Analysis Dynamic Modeling M.C. Escher Observations Software is built on abstractions
More informationExploitable Results by Third Parties
Affordable Safe & Secure Mobility Evolution Project details Project leader: Email: Website: Wolfgang Köpf wolfgang.w.koepf@daimler.com http://assume-project.eu/ 2 Name: Scade KCG / CompCert coupling Scade
More informationRelational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 49 Plan of the course 1 Relational databases 2 Relational database design 3 Conceptual database design 4
More informationGuidelines for deployment of MathWorks R2010a toolset within a DO-178B-compliant process
Guidelines for deployment of MathWorks R2010a toolset within a DO-178B-compliant process UK MathWorks Aerospace & Defence Industry Working Group Guidelines for deployment of MathWorks R2010a toolset within
More informationChapter 2: Intro to Relational Model
Chapter 2: Intro to Relational Model Database System Concepts, 6 th Ed. See www.db-book.com for conditions on re-use Example of a Relation attributes (or columns) tuples (or rows) 2.2 Attribute Types The
More informationUML-Based Conceptual Modeling of Pattern-Bases
UML-Based Conceptual Modeling of Pattern-Bases Stefano Rizzi DEIS - University of Bologna Viale Risorgimento, 2 40136 Bologna - Italy srizzi@deis.unibo.it Abstract. The concept of pattern, meant as an
More informationIntroduction to EGF. Benoît Langlois / Thales Global Services.
www.thalesgroup.com Introduction to EGF Benoît Langlois / Thales Global Services 2 / Agenda Introduction EGF Architecture Concepts & Practice EGF Portfolios 3 / Agenda Introduction EGF Architecture Concepts
More informationModel Finder. Lawrence Chung 1
Model Finder Lawrence Chung 1 Comparison with Model Checking Model Checking Model (System Requirements) STM Specification (System Property) Temporal Logic Model Checker M φ Model Finder (http://alloy.mit.edu/tutorial3/alloy-tutorial.html)
More informationDatabase Management System 15
Database Management System 15 Trivial and Non-Trivial Canonical /Minimal School of Computer Engineering, KIIT University 15.1 First characterize fully the data requirements of the prospective database
More informationPractical Model-based Testing With Papyrus and RT-Tester
Practical Model-based Testing With Papyrus and RT-Tester Jan Peleska and Wen-ling Huang University of Bremen Verified Systems International GmbH Fourth Halmstad Summer School on Testing, 2014-06-11 Acknowledgements.
More informationDO WE NEED TEST SPECIFICATION LANGUAGES?!
DO WE NEED TEST SPECIFICATION LANGUAGES?! Ina Schieferdecker A-MOST @ ICST 2017, Tokyo, March 17, 2017 Please look up my yesterday s proposal for the new version of the UML Testing Profile OUTLINE 1. About
More informationAutomated Refinement Checking of Asynchronous Processes. Rajeev Alur. University of Pennsylvania
Automated Refinement Checking of Asynchronous Processes Rajeev Alur University of Pennsylvania www.cis.upenn.edu/~alur/ Intel Formal Verification Seminar, July 2001 Problem Refinement Checking Given two
More informationBLU AGE 2009 Edition Agile Model Transformation
BLU AGE 2009 Edition Agile Model Transformation Model Driven Modernization for Legacy Systems 1 2009 NETFECTIVE TECHNOLOGY -ne peut être copiésans BLU AGE Agile Model Transformation Agenda Model transformation
More informationStart Up Benoît Langlois / Thales Global Services Eclipse (EMFT) EGF 2011 by Thales; made available under the EPL v1.
www.thalesgroup.com Start Up Benoît Langlois / Thales Global Services 2 / Introduction EGF Architecture Concepts & Practice EGF Portfolios 3 / Introduction EGF Architecture Concepts & Practice EGF Portfolios
More informationCIS 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 informationFrom OCL to Propositional and First-order Logic: Part I
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 From OCL to Propositional and First-order Logic: Part I Copyright 2007-8 Reiner Hähnle and Cesare Tinelli. Notes originally
More informationThe design of a programming language for provably correct programs: success and failure
The design of a programming language for provably correct programs: success and failure Don Sannella Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh http://homepages.inf.ed.ac.uk/dts
More informationEGF Tutorial. Benoît Langlois Thales/EPM. EGF Tutorial by Thales; made available under the EPL v1.0
EGF Tutorial Benoît Langlois Thales/EPM Agenda Introduction EGF Structure Pattern 2 What is EGF? EGF (Eclipse Generation Factories) is an Eclipse open source project under the EMFT project. Purpose: provide
More informationRelational Design: Characteristics of Well-designed DB
1. Minimal duplication Relational Design: Characteristics of Well-designed DB Consider table newfaculty (Result of F aculty T each Course) Id Lname Off Bldg Phone Salary Numb Dept Lvl MaxSz 20000 Cotts
More informationB.6 Types and Overloading
266 appendix b: alloy language reference B.6 Types and Overloading Alloy s type system was designed with a different aim from that of a programming language. There is no notion in a modeling language of
More informationSlides for Faculty Oxford University Press All rights reserved.
Oxford University Press 2013 Slides for Faculty Assistance Preliminaries Author: Vivek Kulkarni vivek_kulkarni@yahoo.com Outline Following topics are covered in the slides: Basic concepts, namely, symbols,
More informationAn Implementation of the Behavior Annex in the AADL-toolset Osate2
2011 16th IEEE International Conference on Engineering of Complex Computer Systems An Implementation of the Behavior Annex in the AADL-toolset Osate2 Gilles Lasnier, Laurent Pautet Inst. TELECOM - TELECOM
More information(All chapters begin with an Introduction end with a Summary, Exercises, and Reference and Bibliography) Preliminaries An Overview of Database
(All chapters begin with an Introduction end with a Summary, Exercises, and Reference and Bibliography) Preliminaries An Overview of Database Management What is a database system? What is a database? Why
More informationFormal Modelling Techniques for Efficient Development of Railway Control Products
ENABLE-S3 ECSEL EU PROJECT Formal Modelling Techniques for Efficient Development of Railway Control Products Michael Butler, Dana Dghaym, Thai Son Hoang, Colin Snook, Tomas Fischer, Klaus Reichl, Peter
More informationType Systems. Today. 1. Organizational Matters. 1. Organizational Matters. Lecture 1 Oct. 20th, 2004 Sebastian Maneth. 1. Organizational Matters
Today Type Systems 1. Organizational Matters 2. What is this course about? 3. Where do types come from? 4. Def. of the small language Expr. Its syntax and semantics. Lecture 1 Oct. 20th, 2004 Sebastian
More informationRM-ODP Part 2 Descriptive Model 1993
Poseidon House Castle Park Cambridge CB3 0RD United Kingdom TELEPHONE: Cambridge (0223) 323010 INTERNATIONAL: +44 223 323010 FAX: +44 223 359779 E-MAIL: apm@ansa.co.uk ANSA Phase III RM-ODP Part 2 Descriptive
More informationMulti-event IDS Categories. Introduction to Misuse Intrusion Detection Systems (IDS) Formal Specification of Intrusion Signatures and Detection Rules
Formal Specification of Intrusion Signatures and Detection Rules By Jean-Philippe Pouzol and Mireille Ducassé 15 th IEEE Computer Security Foundations Workshop 2002 Presented by Brian Kellogg CSE914: Formal
More informationCMPS 277 Principles of Database Systems. https://courses.soe.ucsc.edu/courses/cmps277/fall11/01. Lecture #11
CMPS 277 Principles of Database Systems https://courses.soe.ucsc.edu/courses/cmps277/fall11/01 Lecture #11 1 Limitations of Relational Algebra & Relational Calculus Outline: Relational Algebra and Relational
More information(Meta)Models between MetaEdit+
The Interchange of (Meta)Models between MetaEdit+ and Eclipse EMF Heiko Kern kern@informatik.uni-leipzig.de ni ig Nashville, Tennessee, 10/19/2008 1 Agenda 1. Introduction 2. MetaEdit-EMF-Bridge EMF 3.
More informationOperational Semantics 1 / 13
Operational Semantics 1 / 13 Outline What is semantics? Operational Semantics What is semantics? 2 / 13 What is the meaning of a program? Recall: aspects of a language syntax: the structure of its programs
More informationFundamentals of Software Engineering
Fundamentals of Software Engineering Reasoning about Programs with Dynamic Logic - Part I Ina Schaefer Institute for Software Systems Engineering TU Braunschweig, Germany Slides by Wolfgang Ahrendt, Richard
More informationSysML Past, Present, and Future. J.D. Baker Sparx Systems Ambassador Sparx Systems Pty Ltd
SysML Past, Present, and Future J.D. Baker Sparx Systems Ambassador Sparx Systems Pty Ltd A Specification Produced by the OMG Process SysML 1.0 SysML 1.1 Etc. RFI optional Issued by Task Forces RFI responses
More informationScience of Computer Programming. Aspect-oriented model-driven skeleton code generation: A graph-based transformation approach
Science of Computer Programming 75 (2010) 689 725 Contents lists available at ScienceDirect Science of Computer Programming journal homepage: www.elsevier.com/locate/scico Aspect-oriented model-driven
More informationDenotational Semantics. Domain Theory
Denotational Semantics and Domain Theory 1 / 51 Outline Denotational Semantics Basic Domain Theory Introduction and history Primitive and lifted domains Sum and product domains Function domains Meaning
More informationPooya Saadatpanah, Michalis Famelis, Jan Gorzny, Nathan Robinson, Marsha Chechik, Rick Salay. September 30th, University of Toronto.
Comparing the Pooya Michalis Jan Nathan Marsha Chechik, Rick Salay University of Toronto September 30th, 2012 MoDeVVa 12 1 / 32 in software modeling : pervasive in MDE Models with uncertainty: Represent
More informationPresented by: David Martin (SRI)
OWL-S Issues DAML Web Services Coalition Presented by: David Martin (SRI) http://www.daml.org/services/ Top-level Outline Language status (25 min.) OWL-S Status & Evolution (David Martin) New features
More informationFrom IMP to Java. Andreas Lochbihler. parts based on work by Gerwin Klein and Tobias Nipkow ETH Zurich
From IMP to Java Andreas Lochbihler ETH Zurich parts based on work by Gerwin Klein and Tobias Nipkow 2015-07-14 1 Subtyping 2 Objects and Inheritance 3 Multithreading 1 Subtyping 2 Objects and Inheritance
More information)454 8 ).&/2-!4)/. 4%#(./,/'9 /0%. $)342)"54%$ 02/#%33).' 2%&%2%.#% -/$%, &/5.$!4)/.3
INTERNATIONAL TELECOMMUNICATION UNION )454 8 TELECOMMUNICATION (11/95) STANDARDIZATION SECTOR OF ITU $!4!.%47/2+3!.$ /0%. 3934%- #/--5.)#!4)/.3 /0%. $)342)"54%$ 02/#%33).' ).&/2-!4)/. 4%#(./,/'9 /0%. $)342)"54%$
More informationRepresenting Product Designs Using a Description Graph Extension to OWL 2
Representing Product Designs Using a Description Graph Extension to OWL 2 Henson Graves Lockheed Martin Aeronautics Company Fort Worth Texas, USA henson.graves@lmco.com Abstract. Product development requires
More informationBinary Relations McGraw-Hill Education
Binary Relations A binary relation R from a set A to a set B is a subset of A X B Example: Let A = {0,1,2} and B = {a,b} {(0, a), (0, b), (1,a), (2, b)} is a relation from A to B. We can also represent
More informationComparison of the Modeling Languages Alloy and UML
Comparison of the Modeling Languages Alloy and UML Yujing He Department of Computer Science Portland State University Portland, Oregon, USA Abstract - Alloy is a new modeling language for software design,
More informationTowards a Logical Reconstruction of Relational Database Theory
Towards a Logical Reconstruction of Relational Database Theory On Conceptual Modelling, Lecture Notes in Computer Science. 1984 Raymond Reiter Summary by C. Rey November 27, 2008-1 / 63 Foreword DB: 2
More informationFUNCTIONAL DEPENDENCIES
FUNCTIONAL DEPENDENCIES CS 564- Spring 2018 ACKs: Dan Suciu, Jignesh Patel, AnHai Doan WHAT IS THIS LECTURE ABOUT? Database Design Theory: Functional Dependencies Armstrong s rules The Closure Algorithm
More informationCOS 320. Compiling Techniques
Topic 5: Types COS 320 Compiling Techniques Princeton University Spring 2016 Lennart Beringer 1 Types: potential benefits (I) 2 For programmers: help to eliminate common programming mistakes, particularly
More informationCISC836: Models in Software Development: Methods, Techniques and Tools
CISC836: Models in Software Development: Methods, Techniques and Tools Topic 3: Expressing Software Models Expressing SW models: Overview 1. Examples of software modeling languages 1. UML (for modeling
More informationEuropean Component Oriented Architecture (ECOA ) Collaboration Programme: Architecture Specification Part 2: Definitions
European Component Oriented Architecture (ECOA ) Collaboration Programme: Part 2: Definitions BAE Ref No: IAWG-ECOA-TR-012 Dassault Ref No: DGT 144487-D Issue: 4 Prepared by BAE Systems (Operations) Limited
More informationChapter 14. Database Design Theory: Introduction to Normalization Using Functional and Multivalued Dependencies
Chapter 14 Database Design Theory: Introduction to Normalization Using Functional and Multivalued Dependencies Copyright 2012 Ramez Elmasri and Shamkant B. Navathe Chapter Outline 1 Informal Design Guidelines
More informationSemantics-Based Integration of Embedded Systems Models
Semantics-Based Integration of Embedded Systems Models Project András Balogh, OptixWare Research & Development Ltd. n 100021 Outline Embedded systems overview Overview of the GENESYS-INDEXYS approach Current
More informationA3. Programming Languages for Writing Safety-Critical Software
A3. Programming Languages for Writing Safety-Critical Software (a) Overview. (b) SPARK Ada. Critical Systems, CS 411, Lent term 2002, Sec. A3 A3-1 (a) Overview Important Factors for Programming Languages
More informationStatic Program Checking
Bounded Verification Jalloy Automated Software Analysis Group, Institute of Theoretical Informatics Jun.-prof. Mana Taghdiri June 5, 2014 KIT University of the State of Baden-Wuerttemberg and National
More informationThis project has received funding from the European Union s Horizon 2020 research and innovation programme under grant agreement No
This project has received funding from the European Union s Horizon 2020 research and innovation programme under grant agreement No 643921. TOOLS INTEGRATION UnCoVerCPS toolchain Goran Frehse, UGA Xavier
More informationRIGOROUSLY AUTOMATING TRANSFORMATIONS OF UML BEHAVIOR MODELS
RIGOROUSLY AUTOMATING TRANSFORMATIONS OF UML BEHAVIOR MODELS Jon Whittle 1, João Araújo 2, Ambrosio Toval 3, and Jose Luis Fernández Alemán 3 1 QSS / NASA Ames Research Center, M/S 269-2, Moffett Field,
More informationModel Driven Engineering (MDE) and Diagrammatic Predicate Logic (DPL)
Model Driven Engineering (MDE) and Department of Computer Engineering Faculty of Engineering Bergen University College NORWAY 06.06.2008 Institute of Mathematics and Informatics, Vilnius, LITHUANIA Project
More informationOverview of the KeY System
22c181: Formal Methods in Software Engineering The University of Iowa Spring 2008 Overview of the KeY System Copyright 2007-8 Reiner Hähnle and Cesare Tinelli. Notes originally developed by Reiner Hähnle
More informationChapter 10. Normalization. Chapter Outline. Chapter Outline(contd.)
Chapter 10 Normalization Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of the Relation Attributes 1.2 Redundant Information in Tuples and Update Anomalies 1.3 Null
More informationInformation Management (IM)
1 2 3 4 5 6 7 8 9 Information Management (IM) Information Management (IM) is primarily concerned with the capture, digitization, representation, organization, transformation, and presentation of information;
More informationChapter 8 The Enhanced Entity- Relationship (EER) Model
Chapter 8 The Enhanced Entity- Relationship (EER) Model Copyright 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 8 Outline Subclasses, Superclasses, and Inheritance Specialization
More informationPOAD Book: Chapter 4: Design Patterns as Components Chapter 5: Visual Design Models
POAD Book: Chapter 4: Design Patterns as Components Chapter 5: Visual Design Models Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU Outline Chapter 4: Design Patterns
More information1. (a) What are the closure properties of Regular sets? Explain. (b) Briefly explain the logical phases of a compiler model. [8+8]
Code No: R05311201 Set No. 1 1. (a) What are the closure properties of Regular sets? Explain. (b) Briefly explain the logical phases of a compiler model. [8+8] 2. Compute the FIRST and FOLLOW sets of each
More informationCS:5810 Formal Methods in Software Engineering
CS:5810 Formal Methods in Software Engineering Introduction to Alloy Part 1 Copyright 2001-17, Matt Dwyer, John Hatcliff, Rod Howell, Laurence Pilard, and Cesare Tinelli. Created by Cesare Tinelli and
More informationPart 1.3 Modal I/O Transition Systems as Semantics of UML4SOA
IMT 2013 Lucca, Italy September 2013 Part 1.3 Modal I/O Transition Systems as Semantics of UML4SOA Martin Wirsing LMU München in co-operation with Sebastian Bauer, Rolf Hennicker, Philip Mayer M. Wirsing
More informationOWL DL / Full Compatability
Peter F. Patel-Schneider, Bell Labs Research Copyright 2007 Bell Labs Model-Theoretic Semantics OWL DL and OWL Full Model Theories Differences Betwen the Two Semantics Forward to OWL 1.1 Model-Theoretic
More informationChapter 8: Enhanced ER Model
Chapter 8: Enhanced ER Model Subclasses, Superclasses, and Inheritance Specialization and Generalization Constraints and Characteristics of Specialization and Generalization Hierarchies Modeling of UNION
More informationThis lecture. Databases -Normalization I. Repeating Data. Redundancy. This lecture introduces normal forms, decomposition and normalization.
This lecture Databases -Normalization I This lecture introduces normal forms, decomposition and normalization (GF Royle 2006-8, N Spadaccini 2008) Databases - Normalization I 1 / 23 (GF Royle 2006-8, N
More informationChapter Seven: Regular Expressions. Formal Language, chapter 7, slide 1
Chapter Seven: Regular Expressions Formal Language, chapter 7, slide The first time a young student sees the mathematical constant π, it looks like just one more school artifact: one more arbitrary symbol
More informationScala, Your Next Programming Language
Scala, Your Next Programming Language (or if it is good enough for Twitter, it is good enough for me) WORLDCOMP 2011 By Dr. Mark C. Lewis Trinity University Disclaimer I am writing a Scala textbook that
More informationMetamodeling. Janos Sztipanovits ISIS, Vanderbilt University
Metamodeling Janos ISIS, Vanderbilt University janos.sztipanovits@vanderbilt.edusztipanovits@vanderbilt edu Content Overview of Metamodeling Abstract Syntax Metamodeling Concepts Metamodeling languages
More informationElmasri/Navathe, Fundamentals of Database Systems, Fourth Edition Chapter 10-2
Elmasri/Navathe, Fundamentals of Database Systems, Fourth Edition Chapter 10-2 Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of the Relation Attributes 1.2 Redundant
More informationDeliverable: D 1.2 Specification of Traceability concepts
(ITEA 2 13017) Enabling of Results from AMALTHEA and others for Transfer into Application and building Community around Deliverable: D 1.2 Specification of Traceability concepts Work Package: 1 Continuous
More informationComputing Fundamentals 2 Introduction to CafeOBJ
Computing Fundamentals 2 Introduction to CafeOBJ Lecturer: Patrick Browne Lecture Room: K408 Lab Room: A308 Based on work by: Nakamura Masaki, João Pascoal Faria, Prof. Heinrich Hußmann. See notes on slides
More informationSchema Refinement: Dependencies and Normal Forms
Schema Refinement: Dependencies and Normal Forms Grant Weddell Cheriton School of Computer Science University of Waterloo CS 348 Introduction to Database Management Spring 2016 CS 348 (Intro to DB Mgmt)
More informationCS411 Database Systems. 05: Relational Schema Design Ch , except and
CS411 Database Systems 05: Relational Schema Design Ch. 3.1-3.5, except 3.4.2-3.4.3 and 3.5.3. 1 How does this fit in? ER Diagrams: Data Definition Translation to Relational Schema: Data Definition Relational
More informationChapter 10. Chapter Outline. Chapter Outline. Functional Dependencies and Normalization for Relational Databases
Chapter 10 Functional Dependencies and Normalization for Relational Databases Chapter Outline 1 Informal Design Guidelines for Relational Databases 1.1Semantics of the Relation Attributes 1.2 Redundant
More informationCHAPTER 3 FUZZY RELATION and COMPOSITION
CHAPTER 3 FUZZY RELATION and COMPOSITION Crisp relation! Definition (Product set) Let A and B be two non-empty sets, the prod uct set or Cartesian product A B is defined as follows, A B = {(a, b) a A,
More informationA Typed Lambda Calculus for Input Sanitation
A Typed Lambda Calculus for Input Sanitation Nathan Fulton Carthage College nfulton@carthage.edu April 11, 2013 Abstract Programmers often wish to validate or sanitize user input. One common approach to
More information; Spring 2008 Prof. Sang-goo Lee (14:30pm: Mon & Wed: Room ) ADVANCED DATABASES
4541.564; Spring 2008 Prof. Sang-goo Lee (14:30pm: Mon & Wed: Room 302-208) ADVANCED DATABASES Syllabus Text Books Exams (tentative dates) Database System Concepts, 5th Edition, A. Silberschatz, H. F.
More informationOracle Fusion Middleware 11g: Build Applications with ADF I
Oracle University Contact Us: Local: 1800 103 4775 Intl: +91 80 4108 4709 Oracle Fusion Middleware 11g: Build Applications with ADF I Duration: 5 Days What you will learn Java EE is a standard, robust,
More informationAbstractions and small languages in synthesis CS294: Program Synthesis for Everyone
Abstractions and small languages in synthesis CS294: Program Synthesis for Everyone Ras Bodik Emina Torlak Division of Computer Science University of California, Berkeley Today Today: we describe why high-level
More informationRelational Model, Relational Algebra, and SQL
Relational Model, Relational Algebra, and SQL August 29, 2007 1 Relational Model Data model. constraints. Set of conceptual tools for describing of data, data semantics, data relationships, and data integrity
More informationAn Approach to the Generation of High-Assurance Java Card Applets
An Approach to the Generation of High-Assurance Java Card Applets Alessandro Coglio Kestrel Institute 3260 Hillview Avenue, Palo Alto, CA 94304, USA Ph. +1-650-493-6871 Fax +1-650-424-1807 http://www.kestrel.edu/
More information3.4 Deduction and Evaluation: Tools Conditional-Equational Logic
3.4 Deduction and Evaluation: Tools 3.4.1 Conditional-Equational Logic The general definition of a formal specification from above was based on the existence of a precisely defined semantics for the syntax
More informationA Type Management System for an ODP Trader
A Type Management System for an ODP Trader J. Indulska a,m.bearman b and K. Raymond c a CRC for Distributed Systems Technology, Department of Computer Science, University of Queensland, Brisbane 4072,
More informationlogic & language Daniel Jackson Lipari Summer School July 18-22, 2005
logic & language Daniel Jackson Lipari Summer School July 18-22, 2005 handshaking solution what this lecture s about a relational logic first-order logic + relational operators Alloy language signatures
More informationSUMMARY: MODEL DRIVEN SECURITY
SUMMARY: MODEL DRIVEN SECURITY JAN-FILIP ZAGALAK, JZAGALAK@STUDENT.ETHZ.CH Model Driven Security: From UML Models to Access Control Infrastructres David Basin, Juergen Doser, ETH Zuerich Torsten lodderstedt,
More informationA Formal Approach to Modeling and Model Transformations in Software Engineering
A Formal Approach to Modeling and Model Transformations in Software Engineering Department of Computer Engineering Faculty of Engineering Bergen University College 17.06.2008 EXPO 2008, Integration and
More informationRECODER - The Architecture of a Refactoring System
RECODER - The Architecture of a Refactoring System Andreas Ludwig Prof. U. Aßmann http://recoder.sf.net Overview ➊Programming in the Large Problems, Concepts, The Approach ➋The Architecture of RECODER
More informationA framework for relating syntactic and semantic model differences
Softw Syst Model DOI 10.1007/s10270-016-0552-y SPECIAL SECTION PAPER A framework for relating syntactic and semantic model differences Shahar Maoz 1 Jan Oliver Ringert 1 Received: 24 January 2016 / Revised:
More informationNegations in Refinement Type Systems
Negations in Refinement Type Systems T. Tsukada (U. Tokyo) 14th March 2016 Shonan, JAPAN This Talk About refinement intersection type systems that refute judgements of other type systems. Background Refinement
More informationFrom Event-B Models to Dafny Code Contracts
From Event-B Models to Dafny Code Contracts Mohammadsadegh Dalvandi, Michael Butler, Abdolbaghi Rezazadeh Electronic and Computer Science School, University of Southampton Southampton, United Kingdom {md5g11,mjb,ra3}@ecs.soton.ac.uk
More informationInformal Design Guidelines for Relational Databases
Outline Informal Design Guidelines for Relational Databases Semantics of the Relation Attributes Redundant Information in Tuples and Update Anomalies Null Values in Tuples Spurious Tuples Functional Dependencies
More informationTowards using OWL DL as a metamodelling framework for ATL
Towards using OWL DL as a metamodelling framework for ATL Dennis Wagelaar Vrije Universiteit Brussel, Pleinlaan 2, 1050 Brussels, Belgium dennis.wagelaar@vub.ac.be Abstract. Ontologies have become increasingly
More informationDeductive Methods, Bounded Model Checking
Deductive Methods, Bounded Model Checking http://d3s.mff.cuni.cz Pavel Parízek CHARLES UNIVERSITY IN PRAGUE faculty of mathematics and physics Deductive methods Pavel Parízek Deductive Methods, Bounded
More informationThe Role of Alloy in Developing Scientific Software
The Role of Alloy in Developing Scientific Software John Baugh and Tristan Dyer Civil Engineering and Operations Research North Carolina State University, Raleigh, NC Workshop on the Future of Alloy Formative
More informationAlphabets, strings and formal. An introduction to information representation
Alphabets, strings and formal languages An introduction to information representation 1 Symbols Definition: A symbol is an object endowed with a denotation (i.e. literal meaning) Examples: Variables are
More informationSystem of Systems Architecture Generation and Evaluation using Evolutionary Algorithms
SysCon 2008 IEEE International Systems Conference Montreal, Canada, April 7 10, 2008 System of Systems Architecture Generation and Evaluation using Evolutionary Algorithms Joseph J. Simpson 1, Dr. Cihan
More informationProgramming Languages
CSE 230: Winter 2008 Principles of Programming Languages Ocaml/HW #3 Q-A Session Push deadline = Mar 10 Session Mon 3pm? Lecture 15: Type Systems Ranjit Jhala UC San Diego Why Typed Languages? Development
More informationBasic Elements of Computer Algebra in MIZAR
Basic Elements of Computer Algebra in MIZAR Adam Naumowicz Czeslaw Bylinski Institute of Computer Science University of Bialystok, Poland adamn@math.uwb.edu.pl Section of Computer Networks University of
More information