Strategic Term Rewriting and Its Application to a VDM-SL to SQL - PowerPoint PPT Presentation

Aug 01, 2023 •207 likes •357 views

Strategic Term Rewriting and Its Application to a VDM-SL to SQL Conversion Review Outline Goal of the paper Algebraic design by calculation VooDooM model Conclusions and future work Goal of the paper Convert datatypes in

Strategic Term Rewriting and Its Application to a VDM-SL to SQL Conversion Review
Outline ● Goal of the paper ● Algebraic design by calculation ● VooDooM model ● Conclusions and future work
Goal of the paper Convert datatypes in VDM-SL to SQL relational data models
How? ● Conversion : Transforming algebraic types to maps and products ● Implementation technology : Haskell
Database design by calculation Abstraction and representation where:
Database design by calculation Datatype B implements or refines datatype A
Database design by calculation Preorder
Database design by calculation Conversion laws
Database design by calculation Normal form
Strategic term rewriting Traditional term Strategic term rewritting rewritting Programmable Programmable Fixed Programmable equations equations Strategy Strategy Combined strategies
VooDooM Tool
Transformation Refinement of the VDM-SL data types to a relational form ● Inlining and recursion removal ● Desugaring ● Conversion to relational form ● Resugaring
SQL translation
Conclusions and future work ● Automatic database schema generation ● In comparison with other approaches with the VooDooM the source data-model can be arbitrarily complex ● Reverse process: obtain algebraic data types from a relational model

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Term rewriting Equational logic Term rewriting systems Termination Confluence

Term rewriting Equational logic Term rewriting systems Termination Confluence Rapid prototyping Summary and Exercises Equational logic Reflexivity t = t t 1 = t 2 Symmetry t 2 = t 1 t 1 = t 2 t 2 = t 3 Transitivity t 1 =

769 views • 52 slides

Term rewriting in partial algebras Norbert Dojer 20.06.2014 Term rewriting motivating

Term rewriting in partial algebras Norbert Dojer 20.06.2014 Term rewriting motivating example How to check whether two polynomial expressions are equal? ? ( x + 1) 2 x ( x + 2)( x 1) + 3 = = x 2 + 2 x

308 views • 16 slides

Soundness and Completeness of Infinitary Term Graph Rewriting Patrick Bahr paba@diku.dk

Soundness and Completeness of Infinitary Term Graph Rewriting Patrick Bahr paba@diku.dk University of Copenhagen Department of Computer Science 17th Informal Workshop on Term Rewriting, Aachen, March 28, 2012 From Terms to Term Graphs f f

426 views • 19 slides

Rewriting Part 4. Termination of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Termination

Rewriting Part 4. Termination of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Termination Definition 4.1 A term rewriting system R is terminating iff R is terminating, i.e., there is no infinite reduction chain t 0 R t 1 R t

1.22k views • 94 slides

B ohm Reduction for Terms and Term Graphs Confluence in Infinitary Rewriting Patrick Bahr IT

B ohm Reduction for Terms and Term Graphs Confluence in Infinitary Rewriting Patrick Bahr IT University of Copenhagen Infinitary Term Rewriting Assign outcome to (well-formed) infinite reductions. 1 / 32 Infinitary Term Rewriting Assign

1.8k views • 151 slides

Architectural Synthesis and Exploration using Term Rewriting Systems Arvind James C. Hoe

Architectural Synthesis and Exploration using Term Rewriting Systems Arvind James C. Hoe Laboratory for Computer Science Massachusetts Institute of Technology http:/ /www.csg.lcs.mit.edu Outline u Introduction u Term Rewriting Systems (TRS)

425 views • 30 slides

C ONTENT A PPLYING A R EWRITE R ULE l Intro & motivation, getting started

L AST T IME Introducing new Types Equations and Term Rewriting Confluence and Termination of reduction systems NICTA Advanced Course Term Rewriting in Isabelle Slide 1 Slide 3 Theorem Proving Principles, Techniques, Applications

374 views • 8 slides

Term Rewriting with Genetic Programming or, unfortunately, writing a lot of code that attempts

Term Rewriting with Genetic Programming or, unfortunately, writing a lot of code that attempts to do term rewriting with genetic programming, but doesnt actually work Rewrite simplification of Prop Simplification: representing a term in an

532 views • 38 slides

B ohm Reduction in Infinitary Term Graph Rewriting Systems Patrick Bahr IT University of

B ohm Reduction in Infinitary Term Graph Rewriting Systems Patrick Bahr IT University of Copenhagen Overview 1. Motivation Why term graphs? Why infinitary term graph rewriting? Why B ohm reduction? 2. B ohm Reduction on

1.27k views • 115 slides

Infinitary Term Graph Rewriting is Simple, Sound and Complete Patrick Bahr paba@diku.dk

Infinitary Term Graph Rewriting is Simple, Sound and Complete Patrick Bahr paba@diku.dk University of Copenhagen Department of Computer Science 23rd International Conference on Rewriting Techniques and Applications, Nagoya, Japan, March May

889 views • 73 slides

Rewriting Part 5. Confluence of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Confluence

Rewriting Part 5. Confluence of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Confluence Is Undecidable The following problem is undecidable: Given: A finite TRS R . Question: Is R confluent or not? Confluence Is Undecidable The

752 views • 46 slides

Rewriting Part 6. Completion of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Word problem

Rewriting Part 6. Completion of Term Rewriting Systems Temur Kutsia RISC, JKU Linz Word problem Recall the word problem: Given: A set of identities E and two terms s and t . Decide: s E t holds or not. Word problem Recall the word

964 views • 69 slides

Homological Computations for Term Papers We Love, NY Aug 2017 Rewriting Systems Homological

Gershom Bazerman Homological Computations for Term Papers We Love, NY Aug 2017 Rewriting Systems Homological Computations for Term Rewriting Systems 4 - 6 + 4 = 2 8 - 12 + 6 = 2 6 - 12 + 8 = 2 20 - 30 + 12 = 2 12 - 30 + 20 = 2 (a)

627 views • 51 slides

CO3 a COnverter for proving COnfluence of COnditional term rewriting systems Ver. 1.1 Naoki

CO3 a COnverter for proving COnfluence of COnditional term rewriting systems Ver. 1.1 Naoki Nishida Makishi Yanagisawa Karl Gmeiner Nagoya University UAS Technikum Wien CoCo 2014 Vienna, July 13, 2014 Target and Main

230 views • 5 slides

On Confluence of Innermost Terminating Term Rewriting Systems Masahiko Sakai (Nagoya

On Confluence of Innermost Terminating Term Rewriting Systems Masahiko Sakai (Nagoya University) joint work with Sayaka Ishizuki, Michio Oyamaguchi Sep. 9, 2017, IFIP WG 1.6, Oxford 1 This talk Background: - Open problems on

534 views • 35 slides

Certification of proving termination of term rewriting by matrix interpretations Adam Koprowski

Certification of proving termination of term rewriting by matrix interpretations Adam Koprowski and Hans Zantema Eindhoven University of Technology Department of Mathematics and Computer Science 21 January 2008 SOFSEM08 Nov Smokovec,

1.06k views • 78 slides

Semiexclusive production of vector mesons in proton-proton collisions with electromagnetic

ANNA CISEK Semiexclusive production of vector mesons in proton-proton collisions with electromagnetic dissociation of protons Anna Cisek University of Rzeszow MESON 2018 - 15 th International Workshop on Meson Physics Krakw, 7-12 June 2018

422 views • 18 slides

Nontraditional Notions of Polynomial Ordering with Computational Applications Steve Hussung

Intro Potential Theoretic Background Convex Bodies, Orderings WAMS, Discrete Sequences Nontraditional Notions of Polynomial Ordering with Computational Applications Steve Hussung Indiana University Bloomington Midwestern Workshop on

801 views • 47 slides

Preventing Arithmetic Overflows in Alloy Aleksandar Milicevic Daniel Jackson

Preventing Arithmetic Overflows in Alloy Aleksandar Milicevic Daniel Jackson (aleks@csail.mit.edu) (dnj@csail.mit.edu) Software Design Group Massachusetts Institute of Technology Cambridge, MA International Conference of Alloy, ASM, B, VDM,

2.03k views • 65 slides

C M S A N D L H C R E P O R T A L L E X P E R I M E N T E R S M E E T I N G F E R M I L A B J U

C M S L H C R E P O R T C M S A N D L H C R E P O R T A L L E X P E R I M E N T E R S M E E T I N G F E R M I L A B J U LY 9 , 2 0 1 8 Javier Duarte Fermilab 1 L H C & C M S S C H E D U L E LHC performing a complex program

474 views • 14 slides

Decoding the nature of Dark Matter at current and future experiments Alexander Belyaev

Decoding the nature of Dark Matter at current and future experiments Alexander Belyaev Southampton University & Rutherford Appleton Laboratory June 10 , 2020, Particle Physics Seminar Alexander Belyaev Decoding the nature of DM 1 Why

917 views • 77 slides

Secure Protocols for Secrecy Hanane Houmani and Mohamed Mejri LSFM Research Group Computer

Secure Protocols for Secrecy Hanane Houmani and Mohamed Mejri LSFM Research Group Computer Science Department LAVAL University Quebec, Canada Houmani, 2003 p. 1/25 c Outline Motivations Related works Overview Protocol Modelling

518 views • 33 slides

Introduction Q uantum C hromo D ynamics is a Yang-Mills theory with fermions, based on local SU

PADES and LARGE- N c QCD SANTI PERIS (IFAE - UA Barcelona) Luminy, Sep. 2009 LARGE- Nc QCD p.1/19 PADES and Introduction Q uantum C hromo D ynamics is a Yang-Mills theory with fermions, based on local SU ( N c ) : 1 F A 4 g

733 views • 23 slides

TEST ORACLES Formal Definitions and Classifications Shin Yoo & Mark Harman(UCL) Muzammil

TEST ORACLES Formal Definitions and Classifications Shin Yoo & Mark Harman(UCL) Muzammil Shahbaz & Phil McMinn(University of Sheffield) OVERVIEW Formal Definitions Oracle Literature Timeline & Classification FORMAL

564 views • 22 slides