A Graph Transformation-Based Semantics for Deep Metamodelling
|
|
- Elaine Webb
- 5 years ago
- Views:
Transcription
1 A Graph Transformation-Based Semantics for Deep Metamodelling Alessandro Rossini 1, Juan de Lara 2, Esther Guerra 2, Adrian Rutle 3, Yngve Lamo 3 1 Department of Informatics, University of Bergen, Norway 2 Department of Computer Engineering, Universidad Autónoma de Madrid, Spain 3 Department of Computer Engineering, Bergen University College, Norway 05 October 2011 AGTIVE 2011, Budapest, Hungary
2 Traditional metamodelling
3 i... Traditional metamodelling stack Modelling language metamodel of Linear stack Model conforms to... Metalevel l... conforms to Modelling language metamodel of Model i+1 conforms to Model conforms to... Modelling language metamodel of conforms to Model 1
4 OMG s 4-layer hierarchy 4-layer hiearachy conforms to Metalevel MOF metamodel of Metametamodel M 3 conforms to UML/DSL metamodel of Metamodel M 2 conforms to Model M 1 represented by Original O
5 src * Metamodel Model DSL using traditional metamodelling datalink * trg Component id: String 1 type * trg * CInstance dlinstance name: String visualise: Boolean src * Table src id="fusiontable" geopos profstype UAMProfs name="uamprofs" visualise=false src trg Map id="googlemaps" camptype UAMCamp name="uamcampus" visualise=true trg offices
6 Deep metamodelling
7 Deep metamodelling Originally proposed by Atkinson and Kühne
8 Deep metamodelling Originally proposed by Atkinson and Kühne Deep characterisation Double linguistic/ontological typing
9 Deep characterisation Describe structure and express constraints for metalevels below the adjacent one
10 Model M 1 DSL using deep context Component inv: self.trg-> datalink trg * Component@2 id: String@1 name: String@2 visualise: src * Map id="googlemaps" Table * geopos 0..1 trg src id="fusiontable" Model M 2 UAMCamp name="uamcampus" visualise=true offices trg src UAMProfs name="uamprofs" visualise=false Model M 3
11 Double linguistic/ontological typing Orthogonal linguistic and ontological typing for each model element
12 Metamodelling stack with double typing Linguistic metamodel conforms to (ling.) Ontological stack Model conforms to (onto.) Metalevel 1 DeepElement potency: Int name: String conforms to (ling.)... conforms to (onto.) Model conforms to (onto.) i... Attribute * Clabject 1 1 * Association * conforms to (ling.) Model conforms to (onto.) i+1 conforms to (ling.)... conforms to (onto.) Model l...
13 Diagram Predicate Framework
14 Diagram Predicate Framework (DPF) Formal diagrammatic specification framework founded on category theory and graph transformation diagrammatic modelling metamodelling model transformation model versioning deep metamodelling
15 Diagrammatic models in DPF Specification T = (T, C T :Σ) [irr] id [1..1] datalink Component String
16 Diagrammatic models in DPF Specification T = (T, C T :Σ) Graph T [irr] id id [1..1] datalink Component String datalink Component String
17 Diagrammatic models in DPF Specification T = (T, C T :Σ) Graph T [irr] id id [1..1] datalink Component String datalink Component String Signature Σ = (Π Σ, α Σ ) π Π Σ α Σ (π) Proposed vis. Semantic interpretation [irreflexive] 1 [mult(m, n)] 1 a a 2 X [irr] X f [m..n] f x X : x / f (x) Y x X : m f (x) n, with 0 m n and n 1
18 Diagrammatic models in DPF Specification T = (T, C T :Σ) Graph T [irr] id id [1..1] datalink Component String datalink Component String Atomic constraints C T :Σ a datalink ([irreflexive], δ1) 1 Component a id ([mult(1, 1)], δ2) 1 2 Component String Signature Σ = (Π Σ, α Σ ) π Π Σ α Σ (π) Proposed vis. Semantic interpretation [irreflexive] 1 [mult(m, n)] 1 a a 2 X [irr] X f [m..n] f x X : x / f (x) Y x X : m f (x) n, with 0 m n and n 1
19 Typing and conformance in DPF T [irr] id [1..1] datalink Component String Σ π Π Σ α Σ (π) Proposedvis. Semanticinterpretation [irreflexive] 1 [mult(m, n)] 1 a a 2 X [irr] X f [m..n] f x X : x / f(x) Y x X : m f(x) n, with 0 m nand n 1 S Map idmap Google Maps source Plot S'
20 Formalisation of deep metamodelling
21 Our contribution Distinction of two semantics for potency Syntax of potency Structural semantics of double linguistic/ontological typing Operational semantics of potency
22 Multi-potency Metalevel Clabject Reference i A p A a p N i + 1 B p-1 B b p-1 O..... i + p 1 L 1 L l 1 Y i + p M 0 M m 0 Z
23 Single-potency Metalevel Clabject Reference Attribute i A p A a p N A a p DT i + p B 0 M b 0 Z M b 0 DV
24 Tag signature Ψ for specifying potencies θ Θ Ψ α Ψ (θ) Proposed visual. <multi(p)> 1 1 X p <multi(p)> 2 1 <multi(p)> π 1 a a 2 X 2 X f p f π p <single(p)> 1 1 X p <single(p)> 2 1 <single(p)> π 1 a a 2 X 2 X f p f π p Y Y Y Y
25 Deep metamodelling stack Σ S i C i P i Ψ
26 Deep metamodelling stack S i 1 C i 1 Σ ω i S i P i C i P i 1 Ψ
27 Deep metamodelling stack LM λ i 1 C i 1 S i 1 Σ λ i = ω i S i P i C i P i 1 Ψ
28 Deep metamodelling stack λ 1 LM S 1 C 1 Ω λ i 1 λ i ω 2 ω i 1. C i 1 C i = S i 1 C l λ l ω i S i P 1 ω i+1. P i 1 P i ω l S l P l Ψ
29 DSL using the deep metamodelling stack Clabject Attribute DataType Reference (b)s 1 [0..1] 2 datalink 2 [irr] 2 2 Component Map 1 id 1 name 2 idmap 0 geopos 1 [1..1] 1 [1..1] 2 String Google Maps Table 1 idtable 0 Fusion Table (c)s 2 UAM Campus namemapuam 0 UAMCamp 0 offices 0 (a)lm (d)s 3 UAM Profs nametableuam 0 UAMProfs 0
30 DSL after the transformation Clabject Attribute DataType Reference (b)s 1 (c)s 2 String 1 [0..1] 2 datalink 2 [irr] 2 [1..1] 1 namemap 1 nametable 1 2 Component Map 1 id 1 name 2 idmap 0 geopos 1 [0..1] 1 Table 1 [1..1] 1 [1..1] 2 String Google Maps idtable 0 Fusion Table UAM Campus namemapuam 0 UAMCamp 0 offices 0 (a)lm (d)s 3 UAM Profs nametableuam 0 UAMProfs 0
31 Rules for flattening the semantics of single-potencies ta 1 CL = CK CR a:attribute p a:attribute p A:Clabject DT:DataType A:Clabject DT:DataType ω L i ω L i ω R i ω R i ω R i B:Clabject DT:DataType B:Clabject ab:attribute p-1 DT:DataType tr 1 A:Clabject a:reference p N:Clabject A:Clabject a:reference p N:Clabject ω L i ω L i ω R i ω R i ω R i B:Clabject O:Clabject ab:reference p-1 B:Clabject O:Clabject tacr 2 A:Clabject π p a:reference N:Clabject A:Clabject π p a:reference N:Clabject ω L i ω L i ω L i ω R i ω R i ω R i B:Clabject ab:reference O:Clabject B:Clabject π p-1 ab:reference O:Clabject
32 Rules for flattening the semantics of single-potencies tacr 3 A:Clabject CL π p a:reference N:Clabject A:Clabject CK = CR a:reference N:Clabject ω L i ω L i ω L i ω R i ω R i ω R i tr 4 B:Clabject A:Clabject π p-1 ab:reference a:reference p O:Clabject N:Clabject B:Clabject A:Clabject π p-1 ab:reference O:Clabject N:Clabject ω L i ω L i ω L i ω R i ω R i ab:reference p-1 B:Clabject O:Clabject ab:reference p-1 B:Clabject O:Clabject ta 4 A:Clabject a:attribute p DT:DataType A:Clabject DT:DataType ω L i ω L i ω L i ω R i ω R i B:Clabject ab:attribute p-1 DT:DataType B:Clabject ab:attribute p-1 DT:DataType
33 Conclusion Distinction of multi- and single-potency Syntax of multi- and single-potency Structural semantics of double linguistic/ontological typing Operational semantics of single-potency
34 Related work Multi-level metamodelling [Gitzel et al., 2007] Extension of MOF with multiple metalevels to enable XML-based code generation [Asikainen et al., 2009] Nivel: double metamodelling framework based on the weighted constraint rule language [Clark et al., 2010] XMF: language-driven development framework allowing arbitrary number of metalevels
35 Related work Deep characterisation [Kühne et al., 2007] DeepJava: superset of Java which features an unbounded number of metalevels [Atkinson et al., 2009] Prototype modelling infrastructure with multiple ontological and linguistic metalevels [de Lara et al., 2010] metadepth: deep metamodelling framework which supports potency, double linguistic/ontological typing and linguistic extension
36 Future work Structural semantics of multi- and single-potency (in progress) Structural semantics of linguistic extension (in progress) Investigation of the effects of overriding the potency of a clabject using inheritance
37 Thank you! Questions?
A Formal Approach to Modeling and Model Transformations in Software Engineering
A Formal Approach to Modeling and Model Transformations in Software Engineering Adrian Rutle 1, Uwe Wolter 2, and Yngve Lamo 1 1 Bergen University College, p.b. 7030, 5020 Bergen, Norway {aru,yla}@hib.no
More informationA Formal Approach to Modeling and Model Transformations in Software Engineering
A Formal Approach to Modeling and Model Transformations in Software Engineering Adrian Rutle 1, Uwe Wolter 2, and Yngve Lamo 1 1 Bergen University College, p.b. 7030, 5020 Bergen, Norway {aru,yla}@hib.no
More informationREPORTS IN INFORMATICS
REPORTS IN INFORMATICS ISSN 0333-3590 On the Category of Graph Chains and Graph Chain Morphisms Uwe Wolter, Fernando Macías and Adrian Rutle REPORT NO 416 January 2018 UNIVERSITAS B ER G E NSIS Department
More informationForschungsberichte der Fakultät IV Elektrotechnik und Informatik
Forschungsberichte der Fakultät IV Elektrotechnik und Informatik Correctness, Completeness and Termination of Pattern-Based Model-to-Model Transformation: Long Version Fernando Orejas, Esther Guerra, Juan
More informationLecture 7. Logic. Section1: Statement Logic.
Ling 726: Mathematical Linguistics, Logic, Section : Statement Logic V. Borschev and B. Partee, October 5, 26 p. Lecture 7. Logic. Section: Statement Logic.. Statement Logic..... Goals..... Syntax of Statement
More informationEnsuring Structural Constraints in Graph-Based Models with Type Inheritance
Ensuring Structural Constraints in Graph-Based Models with Type Inheritance Gabriele Taentzer 1 and Arend Rensink 2 1 Computer Science Department Technical University of Berlin Berlin, Germany 2 Computer
More informationTowards a traceability framework for model transformations in Kermeta
Towards a traceability framework for model transformations in Kermeta Jean-Rémy Falleri, Marianne Huchard, and Clémentine Nebut LIRMM, CNRS and Université de Montpellier 2, 161, rue Ada, 34392 Montpellier
More informationFormal Analysis of UML/OCL Models
Formal Analysis of UML/OCL Models Achim D. Brucker Vincenz-Priessnitz-Str. 1, 76131 Karlsruhe, Germany achim.brucker@sap.com University Bremen Computer Science Colloqium Bremen, 29th October 2008 Outline
More informationCSE 1400 Applied Discrete Mathematics Definitions
CSE 1400 Applied Discrete Mathematics Definitions Department of Computer Sciences College of Engineering Florida Tech Fall 2011 Arithmetic 1 Alphabets, Strings, Languages, & Words 2 Number Systems 3 Machine
More informationTable of Contents. Preface...viii. Acknowledgment... xiv. Section 1 Basics
Table of Contents Preface...viii Acknowledgment... xiv Section 1 Basics Chapter 1 Reverse Engineering and MDA: An Introduction... 1 Introduction... 1 Reverse Engineering in the Last 20 Years... 4 Reverse
More informationAn OWL Ontology for Quantum Mechanics
An OWL Ontology for Quantum Mechanics Marcin Skulimowski Faculty of Physics and Applied Informatics, University of Lodz Pomorska 149/153, 90-236 Lodz, Poland mskulim@uni.lodz.pl Abstract. An OWL ontology
More informationOn Syntactic and Semantic Complexity Classes
1 On Syntactic and Semantic Complexity Classes Anuj Dawar University of Cambridge Computer Laboratory Spitalfields Day, Isaac Newton Institute, 9 January 2012 2 Semantics and Syntax Semantics and Syntax:
More informationA Conceptual Model for Submarine Feature Description and Generalisation in Nautical Chart Production
A Conceptual Model for Submarine Feature Description and Generalisation in Nautical Chart Production Jingya YAN Naval Academy Research Institute Department of Land Surveying and Geo-Informatics The Hong
More informationDSLTrans: A Turing Incomplete Transformation Language
DSLTrans: A Turing Incomplete Transformation Language Bruno Barroca, Levi Lúcio, Vasco Amaral, Roberto Félix, and Vasco Sousa CITI, Departamento de Informática, Faculdade de Ciencias e Tecnologia Universidade
More informationLecture 04: OCL Semantics
Software Design, Modelling and Analysis in UML Lecture 04: OCL Semantics 2014-10-30 Prof. Dr. Andreas Podelski, Dr. Bernd Westphal 04 2014-10-30 main Albert-Ludwigs-Universität Freiburg, Germany Contents
More information4.2 The Halting Problem
172 4.2 The Halting Problem The technique of diagonalization was discovered in 1873 by Georg Cantor who was concerned with the problem of measuring the sizes of infinite sets For finite sets we can simply
More informationDepartment of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)
Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007) Problem 1: Specify two different predicates P (x) and
More informationCS 6110 Lecture 28 Subtype Polymorphism 3 April 2013 Lecturer: Andrew Myers
CS 6110 Lecture 28 Subtype Polymorphism 3 April 2013 Lecturer: Andrew Myers 1 Introduction In this lecture, we make an attempt to extend the typed λ-calculus for it to support more advanced data structures
More informationA comprehensive application of category theory to semantics of modelling language
A comprehensive application of category theory to semantics of modelling language Carlos Ramisch, Iulia-Maria Hudita ENSIMAG, INP Grenoble Math for Fun January 21., 2008 {ramischc, huditai}@ensimag.fr
More informationLecture 4. Algebra. Section 1:. Signature, algebra in a signature. Isomorphisms, homomorphisms, congruences and quotient algebras.
V. Borschev and B. Partee, September 18, 2001 p. 1 Lecture 4. Algebra. Section 1:. Signature, algebra in a signature. Isomorphisms, homomorphisms, congruences and quotient algebras. CONTENTS 0. Why algebra?...1
More informationSeamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems
Seamless Model Driven Development and Tool Support for Embedded Software-Intensive Systems Computer Journal Lecture - 22nd June 2009 Manfred Broy Technische Universität München Institut für Informatik
More informationLecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra.
V. Borschev and B. Partee, October 26, 2006 p. 1 Lecture 12. Statement Logic as a word algebra on the set of atomic statements. Lindenbaum algebra. 0. Preliminary notes...1 1. Freedom for algebras. Word
More informationModel Theory in the Univalent Foundations
Model Theory in the Univalent Foundations Dimitris Tsementzis January 11, 2017 1 Introduction 2 Homotopy Types and -Groupoids 3 FOL = 4 Prospects Section 1 Introduction Old and new Foundations (A) (B)
More informationSPARQL Rewriting for Query Mediation over Mapped Ontologies
SPARQL Rewriting for Query Mediation over Mapped Ontologies Konstantinos Makris*, Nektarios Gioldasis*, Nikos Bikakis**, Stavros Christodoulakis* *Laboratory of Distributed Multimedia Information Systems
More informationKnowledge Representation
INF5390 Kunstig intelligens Knowledge Representation Roar Fjellheim Outline General ontology Categories and objects Events and processes Reasoning systems Internet shopping world Summary Extracts from
More informationStructural Foundations for Abstract Mathematics
May 5, 2013 What no foundation can give us: Certainty What foundations need not give us: Ontological reduction What set theory gives us: Common language in which all mathematics can be encoded:,,,... Dispute
More information1 Introduction. 2 Recap The Typed λ-calculus λ. 3 Simple Data Structures
CS 6110 S18 Lecture 21 Products, Sums, and Other Datatypes 1 Introduction In this lecture, we add constructs to the typed λ-calculus that allow working with more complicated data structures, such as pairs,
More informationProposition Knowledge Graphs. Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel
Proposition Knowledge Graphs Gabriel Stanovsky Omer Levy Ido Dagan Bar-Ilan University Israel 1 Problem End User 2 Case Study: Curiosity (Mars Rover) Curiosity is a fully equipped lab. Curiosity is a rover.
More informationAbstract model theory for extensions of modal logic
Abstract model theory for extensions of modal logic Balder ten Cate Stanford, May 13, 2008 Largely based on joint work with Johan van Benthem and Jouko Väänänen Balder ten Cate Abstract model theory for
More informationSymbolic Graphs for Attributed Graph Constraints
Symbolic Graphs for Attributed Graph Constraints Fernando Orejas Dpt. L.S.I., Universitat Politècnica de Catalunya, Campus Nord, Mòdul Omega, Jordi Girona 1-3, 08034 Barcelona, Spain. Abstract In this
More informationStatic BiLog: a Unifying Language for Spatial Structures
Fundamenta Informaticae 80 (2007) 1 20 1 IOS Press Static BiLog: a Unifying Language for Spatial Structures Giovanni Conforti DI, Università di Pisa, Italy Damiano Macedonio DSI, Università Ca Foscari
More informationIntroduction to Kleene Algebras
Introduction to Kleene Algebras Riccardo Pucella Basic Notions Seminar December 1, 2005 Introduction to Kleene Algebras p.1 Idempotent Semirings An idempotent semiring is a structure S = (S, +,, 1, 0)
More informationA NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE
Janusz Maciaszek Luis Villegas-Forero A NOTE ON COMPOSITIONALITY IN THE FIRST ORDER LANGUAGE Abstract The main objective of this paper is to present the syntax and semantic of First Order Language in a
More informationIncomplete Information in RDF
Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens
More informationFirst Order Predicate Logic (FOL) Formulas
1 First Order Predicate Logic (FOL) Formulas Let Σ = (S, Ω) be a signature. P L(Σ) is the smallest set with (i) t = u P L(Σ), (ii) (iii) (iv) if X set of variables for Σ, s S, t, u T Σ(X),s (ϕ 1 ϕ 2 )
More informationIndependence-Friendly Cylindric Set Algebras
Independence-Friendly Cylindric Set Algebras by Allen Lawrence Mann B.A., Albertson College of Idaho, 2000 M.A., University of Colorado at Boulder, 2003 A thesis submitted to the Faculty of the Graduate
More informationCausal Block Diagrams: Compiler to LaTeX and DEVS
Causal Block Diagrams: Compiler to LaTeX and DEVS Nicolas Demarbaix University of Antwerp Antwerp, Belgium nicolas.demarbaix@student.uantwerpen.be Abstract In this report I present the results of my project
More informationRelational Composition
Relations 4 Joseph Spring 1COM Formal Systems Relations 1 & 2 We reviewed Set concepts and considered: The concept of a relation Pairs and arrow diagram Homogeneous v Heterogeneous Source, Target, Domain
More informationHandout: Proof of the completeness theorem
MATH 457 Introduction to Mathematical Logic Spring 2016 Dr. Jason Rute Handout: Proof of the completeness theorem Gödel s Compactness Theorem 1930. For a set Γ of wffs and a wff ϕ, we have the following.
More informationBringing class diagrams to life
Bringing class diagrams to life Luis S. Barbosa & Sun Meng DI-CCTC, Minho University, Braga & CWI, Amsterdam UML & FM Workshop 2009 Rio de Janeiro 8 December, 2009 Formal Methods proofs problems structures
More informationFoundations of Mathematics
Foundations of Mathematics L. Brian Lawrence Department of Mathematics George Mason University Fairfax, VA 22030 4444 U.S.A. e mail: blawrenc@mail.gmu.edu January 1, 2007 Preface This set of notes is an
More informationModal logics: an introduction
Modal logics: an introduction Valentin Goranko DTU Informatics October 2010 Outline Non-classical logics in AI. Variety of modal logics. Brief historical remarks. Basic generic modal logic: syntax and
More informationTheorems for free : a (calculational) introduction
Theorems for free : a (calculational) introduction J.N. Oliveira Dept. Informática, Universidade do Minho Braga, Portugal 2003 (last update: 2013) Parametric polymorphism by example Function countbits
More informationLogic: Propositional Logic Truth Tables
Logic: Propositional Logic Truth Tables Raffaella Bernardi bernardi@inf.unibz.it P.zza Domenicani 3, Room 2.28 Faculty of Computer Science, Free University of Bolzano-Bozen http://www.inf.unibz.it/~bernardi/courses/logic06
More informationPredication via Finite-State Methods
Predication via Finite-State Methods 4/5. Finite-state truthmaking Tim Fernando ESSLLI 2017, Toulouse Key phrases: events vs statives vs forces ceteris paribus: explicit vs derived pathfinding granularity
More informationDiscrete Mathematics Fall 2018 Midterm Exam Prof. Callahan. Section: NetID: Multiple Choice Question (30 questions in total, 4 points each)
Discrete Mathematics Fall 2018 Midterm Exam Prof. Callahan Section: NetID: Name: Multiple Choice Question (30 questions in total, 4 points each) 1 Consider the following propositions: f: The student got
More informationLecture 12: Core State Machines II
Software Design, Modelling and Analysis in UML Lecture 12: Core State Machines II 2015-12-15 12 2015-12-15 main Prof. Dr. Andreas Podelski, Dr. Bernd Westphal Albert-Ludwigs-Universität Freiburg, Germany
More informationLanguages. Languages. An Example Grammar. Grammars. Suppose we have an alphabet V. Then we can write:
Languages A language is a set (usually infinite) of strings, also known as sentences Each string consists of a sequence of symbols taken from some alphabet An alphabet, V, is a finite set of symbols, e.g.
More information1 Circuit Complexity. CS 6743 Lecture 15 1 Fall Definitions
CS 6743 Lecture 15 1 Fall 2007 1 Circuit Complexity 1.1 Definitions A Boolean circuit C on n inputs x 1,..., x n is a directed acyclic graph (DAG) with n nodes of in-degree 0 (the inputs x 1,..., x n ),
More informationComputation Histories
208 Computation Histories The computation history for a Turing machine on an input is simply the sequence of configurations that the machine goes through as it processes the input. An accepting computation
More informationPolynomial Time Computation. Topics in Logic and Complexity Handout 2. Nondeterministic Polynomial Time. Succinct Certificates.
1 2 Topics in Logic and Complexity Handout 2 Anuj Dawar MPhil Advanced Computer Science, Lent 2010 Polynomial Time Computation P = TIME(n k ) k=1 The class of languages decidable in polynomial time. The
More informationInf2A: The Pumping Lemma
Inf2A: Stuart Anderson School of Informatics University of Edinburgh October 8, 2009 Outline 1 Deterministic Finite State Machines and Regular Languages 2 3 4 The language of a DFA ( M = Q, Σ, q 0, F,
More informationBetween proof theory and model theory Three traditions in logic: Syntactic (formal deduction)
Overview Between proof theory and model theory Three traditions in logic: Syntactic (formal deduction) Jeremy Avigad Department of Philosophy Carnegie Mellon University avigad@cmu.edu http://andrew.cmu.edu/
More informationThe Lambda Calculus. Stephen A. Edwards. Fall Columbia University
The Lambda Calculus Stephen A. Edwards Columbia University Fall 2014 Lambda Expressions Function application written in prefix form. Add four and five is (+ 4 5) Evaluation: select a redex and evaluate
More informationarxiv: v2 [cs.se] 12 Mar 2018
From SysML/KAOS Domain Models to B System Specifications Steve Jeffrey Tueno Fotso,3, Marc Frappier 3, Amel Mammar 2, and Régine Laleau Université Paris-Est Créteil, LACL, Créteil, France, steve.tuenofotso@univ-paris-est.fr,
More informationThe Life Cycle of Grammarware. CWI Scientific Meeting Vadim Zaytsev, SWAT, CWI 2012
The Life Cycle of Grammarware CWI Scientific Meeting Vadim Zaytsev, SWAT, CWI 2012 Grammarware Software Languages Language: make all: test: make clean make build make test./converge.py master.bgf base/
More informationAn Introduction to Modal Logic III
An Introduction to Modal Logic III Soundness of Normal Modal Logics Marco Cerami Palacký University in Olomouc Department of Computer Science Olomouc, Czech Republic Olomouc, October 24 th 2013 Marco Cerami
More informationNominal Completion for Rewrite Systems with Binders
Nominal Completion for Rewrite Systems with Binders Maribel Fernández King s College London July 2012 Joint work with Albert Rubio Summary Motivations Nominal Rewriting Closed nominal rules Confluence
More informationCityGML in Detail Part 2
CityGML in Detail Part 2 Prof. Dr. Thomas H. Kolbe Institute for Geodesy and Geoinformation Science Berlin University of Technology kolbe@igg.tu-berlin.de May 2008 EduServ6 Course on CityGML Copyright
More informationPropositional and Predicate Logic - II
Propositional and Predicate Logic - II Petr Gregor KTIML MFF UK WS 2016/2017 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - II WS 2016/2017 1 / 16 Basic syntax Language Propositional logic
More informationTowards a Mechanised Denotational Semantics for Modelica
Towards a Mechanised Denotational Semantics for Modelica Simon Foster Bernhard Thiele Jim Woodcock Peter Fritzson Department of Computer Science, University of York PELAB, Linköping University 3rd February
More informationA conceptualization is a map from the problem domain into the representation. A conceptualization specifies:
Knowledge Sharing A conceptualization is a map from the problem domain into the representation. A conceptualization specifies: What sorts of individuals are being modeled The vocabulary for specifying
More informationAlgebraic Trace Theory
Algebraic Trace Theory EE249 Presented by Roberto Passerone Material from: Jerry R. Burch, Trace Theory for Automatic Verification of Real-Time Concurrent Systems, PhD thesis, CMU, August 1992 October
More informationNon-emptiness Testing for TMs
180 5. Reducibility The proof of unsolvability of the halting problem is an example of a reduction: a way of converting problem A to problem B in such a way that a solution to problem B can be used to
More informationDISCRETE GLOBAL GRID SYSTEMS FOR HANDLING BIG DATA FROM SPACE
DISCRETE GLOBAL GRID SYSTEMS FOR HANDLING BIG DATA FROM SPACE Matthew Purss, Perry Peterson, Robert Gibb, Faramarz Samavati, Peter Strobl Open Geospatial Consortium Discrete Global Grid Systems Standards
More informationREDUCTION OF HILBERT-TYPE PROOF SYSTEMS TO THE IF-THEN-ELSE EQUATIONAL LOGIC. 1. Introduction
J. Appl. Math. & Computing Vol. 14(2004), No. 1-2, pp. 69-80 REDUCTION OF HILBERT-TYPE PROOF SYSTEMS TO THE IF-THEN-ELSE EQUATIONAL LOGIC JOOHEE JEONG Abstract. We present a construction of the linear
More informationSome consequences of compactness in Lukasiewicz Predicate Logic
Some consequences of compactness in Lukasiewicz Predicate Logic Luca Spada Department of Mathematics and Computer Science University of Salerno www.logica.dmi.unisa.it/lucaspada 7 th Panhellenic Logic
More informationSoftware Engineering
Software Engineering Lecture 07: Design by Contract Peter Thiemann University of Freiburg, Germany 02.06.2014 Table of Contents Design by Contract Contracts for Procedural Programs Contracts for Object-Oriented
More informationGEO-INFORMATION (LAKE DATA) SERVICE BASED ON ONTOLOGY
GEO-INFORMATION (LAKE DATA) SERVICE BASED ON ONTOLOGY Long-hua He* and Junjie Li Nanjing Institute of Geography & Limnology, Chinese Academy of Science, Nanjing 210008, China * Email: lhhe@niglas.ac.cn
More informationCompositions of Tree Series Transformations
Compositions of Tree Series Transformations Andreas Maletti a Technische Universität Dresden Fakultät Informatik D 01062 Dresden, Germany maletti@tcs.inf.tu-dresden.de December 03, 2004 1. Motivation 2.
More informationYet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs
Yet Another Proof of the Strong Equivalence Between Propositional Theories and Logic Programs Joohyung Lee and Ravi Palla School of Computing and Informatics Arizona State University, Tempe, AZ, USA {joolee,
More informationMarie Farrell Supervisors: Dr Rosemary Monahan & Dr James Power Principles of Programming Research Group
EXAMINING REFINEMENT: THEORY, TOOLS AND MATHEMATICS Marie Farrell Supervisors: Dr Rosemary Monahan & Dr James Power Principles of Programming Research Group PROBLEM Different formalisms do not integrate
More informationLecture 15: Validity and Predicate Logic
Lecture 15: Validity and Predicate Logic 1 Goals Today Learn the definition of valid and invalid arguments in terms of the semantics of predicate logic, and look at several examples. Learn how to get equivalents
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationFormal Epistemology: Lecture Notes. Horacio Arló-Costa Carnegie Mellon University
Formal Epistemology: Lecture Notes Horacio Arló-Costa Carnegie Mellon University hcosta@andrew.cmu.edu Logical preliminaries Let L 0 be a language containing a complete set of Boolean connectives, including
More informationBringing machine learning & compositional semantics together: central concepts
Bringing machine learning & compositional semantics together: central concepts https://githubcom/cgpotts/annualreview-complearning Chris Potts Stanford Linguistics CS 244U: Natural language understanding
More informationOn Model Checking for Visibly Pushdown Automata
Japan Institute of Advanced Industrial Science and Technology Research Center for Specification and Verification LATA 2012 On Model Checking for Visibly Pushdown Automata Nguyen Van Tang and Hitoshi Ohsaki
More informationDescription Logics. Logics and Ontologies. franconi. Enrico Franconi
(1/38) Description Logics Logics and Ontologies Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/38) Summary What is an
More information22.615, MHD Theory of Fusion Systems Prof. Freidberg Lecture 14: Formulation of the Stability Problem
.65, MHD Theory of Fusion Systems Prof. Freidberg Lecture 4: Formulation of the Stability Problem Hierarchy of Formulations of the MHD Stability Problem for Arbitrary 3-D Systems. Linearized equations
More informationSemantic Foundation of the Tagged Signal Model
Semantic Foundation of the Tagged Signal Model Xiaojun Liu Sun Microsystems, Inc. Chess Seminar February 21, 2006 Outline Motivation Heterogeneous embedded systems The tagged signal model as a semantic
More informationCOMPUTER SCIENCE TRIPOS
CST.2015.2.1 COMPUTER SCIENCE TRIPOS Part IA Tuesday 2 June 2015 1.30 to 4.30 pm COMPUTER SCIENCE Paper 2 Answer one question from each of Sections A, B and C, and two questions from Section D. Submit
More informationBisimulation for Neighbourhood Structures
Bisimulation for Neighbourhood Structures Helle Hvid Hansen 1,2 Clemens Kupke 2 Eric Pacuit 3 1 Vrije Universiteit Amsterdam (VUA) 2 Centrum voor Wiskunde en Informatica (CWI) 3 Universiteit van Amsterdam
More informationRealism and Idealism External Realism
Realism and Idealism External Realism Owen Griffiths oeg21@cam.ac.uk St John s College, Cambridge 8/10/15 What is metaphysics? Metaphysics is the attempt to: give a general description of the whole of
More informationMDE: Modelling the DEVS formalism
MDE: Modelling the DEVS formalism Yentl Van Tendeloo Yentl.VanTendeloo@student.ua.ac.be January 24, 2013 1 / 25 The problem: Difficult to comprehend c l a s s Root ( CoupledDEVS ) : d e f i n i t ( s e
More informationPropositional and Predicate Logic - VII
Propositional and Predicate Logic - VII Petr Gregor KTIML MFF UK WS 2015/2016 Petr Gregor (KTIML MFF UK) Propositional and Predicate Logic - VII WS 2015/2016 1 / 11 Theory Validity in a theory A theory
More informationLogic: Propositional Logic (Part I)
Logic: Propositional Logic (Part I) Alessandro Artale Free University of Bozen-Bolzano Faculty of Computer Science http://www.inf.unibz.it/ artale Descrete Mathematics and Logic BSc course Thanks to Prof.
More informationInner Product Spaces
Inner Product Spaces Linear Algebra Josh Engwer TTU 28 October 2015 Josh Engwer (TTU) Inner Product Spaces 28 October 2015 1 / 15 Inner Product Space (Definition) An inner product is the notion of a dot
More informationLogic in Computer Science. Frank Wolter
Logic in Computer Science Frank Wolter Meta Information Slides, exercises, and other relevant information are available at: http://www.liv.ac.uk/~frank/teaching/comp118/comp118.html The module has 18 lectures.
More information1. Write a program to calculate distance traveled by light
G. H. R a i s o n i C o l l e g e O f E n g i n e e r i n g D i g d o h H i l l s, H i n g n a R o a d, N a g p u r D e p a r t m e n t O f C o m p u t e r S c i e n c e & E n g g P r a c t i c a l M a
More informationTheory of Languages and Automata
Theory of Languages and Automata Chapter 0 - Introduction Sharif University of Technology References Main Reference M. Sipser, Introduction to the Theory of Computation, 3 nd Ed., Cengage Learning, 2013.
More informationFormal Conformance Testing 2006
Formal Conformance Testing 2006 Lecture 1 14th Sep 2006 Welcome! This is T-79.5304: Formal Conformance Testing Lectures from 10 to 12 am, no regular tutorials Cancellations and other notes at the web page
More informationDL-Lite Contraction and Revision
Journal of Artificial Intelligence Research 56 (2016) 329-378 Submitted 12/15; published 06/16 DL-Lite Contraction and Revision Zhiqiang Zhuang Institute for Integrated and Intelligent Systems Griffith
More informationAnnotation tasks and solutions in CLARIN-PL
Annotation tasks and solutions in CLARIN-PL Marcin Oleksy, Ewa Rudnicka Wrocław University of Technology marcin.oleksy@pwr.edu.pl ewa.rudnicka@pwr.edu.pl CLARIN ERIC Common Language Resources and Technology
More informationECE473 Lecture 15: Propositional Logic
ECE473 Lecture 15: Propositional Logic Jeffrey Mark Siskind School of Electrical and Computer Engineering Spring 2018 Siskind (Purdue ECE) ECE473 Lecture 15: Propositional Logic Spring 2018 1 / 23 What
More informationComplexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes
Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L
More informationReflexives and non-fregean quantifiers
UCLA Working Papers in Linguistics, Theories of Everything Volume 17, Article 49: 439-445, 2012 Reflexives and non-fregean quantifiers Richard Zuber It is shown that depending on the subject noun phrase
More informationINTRODUCTION TO NONMONOTONIC REASONING
Faculty of Computer Science Chair of Automata Theory INTRODUCTION TO NONMONOTONIC REASONING Anni-Yasmin Turhan Dresden, WS 2017/18 About the Course Course Material Book "Nonmonotonic Reasoning" by Grigoris
More informationInvariant Generation for Parametrized Systems using Self-Reflection
Invariant Generation for Parametrized Systems using Self-Reflection Alejandro Sánchez 1 César Sánchez 1,3 Sriram Sankaranarayanan 2 Bor-Yuh Evan Chang 2 1 IMDEA Software Institute, Spain 2 University of
More informationDeclarative Computation Model. Conditional. Case statement. Procedure values (2) Procedure values. Sequential declarative computation model
Declarative Computation Model Kernel language semantics revisited (VRH.4.5) From kernel to practical language (VRH.6) Exceptions (VRH.7) Carlos Varela RPI October 0, 009 Adapted with permission from: Seif
More informationSEPARATING NOTIONS OF HIGHER-TYPE POLYNOMIAL-TIME. Robert Irwin Syracuse University Bruce Kapron University of Victoria Jim Royer Syracuse University
SEPARATING NOTIONS OF HIGHER-TYPE POLYNOMIAL-TIME Robert Irwin Syracuse University Bruce Kapron University of Victoria Jim Royer Syracuse University FUNCTIONALS & EFFICIENCY Question: Suppose you have
More information