Relational and Algebraic Methods in Computer Science : 17th International Conference, RAMiCS 2018, Groningen, the Netherlands, October 29 - November 1, 2018, Proceedings. [elektronicky zdroj]

Autor: Desharnais, Jules

Externí odkaz: Kolekce e-knih KNAV (Registrovani uzivatele: plny text online 5 minut, dalsi pristup na vyzadani. Registered users: full text online 5 minutes, further access on requests.)

The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document}-Join as a Join with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\theta $$\end{document}

Autor: Desharnais, Jules, Möller, Bernhard

Publikováno v: Relational and Algebraic Methods in Computer Science

We present an algebra for the classical database operators. Contrary to most approaches we use (inner) join and projection as the basic operators. Theta joins result by representing theta as a database table itself and defining theta-join as a join w

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pmc_________::7f2b350aa38f753dc6b643ef7d4d322e
http://europepmc.org/articles/PMC7991301

Abstract representation theorems for demonic refinement algebras

Autor: De Carufel, Jean-Lou, Desharnais, Jules

Publikováno v: In Journal of Logic and Algebraic Programming 2010 79(8):740-767

Algebraic Notions of Termination

Autor: Desharnais Jules, Bernhard Moeller, Struth Georg

Publikováno v: Logical Methods in Computer Science, Vol Volume 7, Issue 1 (2011)

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings, which are addi

Externí odkaz: https://doaj.org/article/46f5ba64ee5c49379acd056869a89bdf

Towards an analysis of dynamic gossip in NetKAT

Autor: Gattinger, Malvin, Wagemaker, Jana, Desharnais, Jules, Guttmann, Walter, Joosten, Stef

Publikováno v: Relational and Algebraic Methods in Computer Science: 17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29 – November 1, 2018, Proceedings, 280-297
STARTPAGE=280;ENDPAGE=297;TITLE=Relational and Algebraic Methods in Computer Science
Relational and Algebraic Methods in Computer Science ISBN: 9783030021481
RAMiCS

In this paper we analyse the dynamic gossip problem using the algebraic network programming language Netkat.Netkat is a language based on Kleene algebra with tests and describes packets travelling through networks. It has a sound and complete axiomat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b54fabdb811062097c2c9a9cc6c38a92
https://doi.org/10.1007/978-3-030-02149-8_17