From 6e1620de7fd37b567a1b52b022ed43ab5dfa9015 Mon Sep 17 00:00:00 2001 From: Mart Lubbers Date: Wed, 1 Feb 2023 14:12:21 +0100 Subject: [PATCH] updates from Peter --- appx/bytecode.tex | 2 +- intro/intro.tex | 92 ++++++++++++++++++++++---------------------- intro/iot-layers.tex | 3 ++ other.bib | 45 +++++++++++----------- process_bib.sh | 6 ++- tiot.bib | 2 +- 6 files changed, 77 insertions(+), 73 deletions(-) diff --git a/appx/bytecode.tex b/appx/bytecode.tex index 6884e53..ce6c4df 100644 --- a/appx/bytecode.tex +++ b/appx/bytecode.tex @@ -75,7 +75,7 @@ The byte code instructions are of variable length and automatically encoded and & & \multicolumn{3}{l}{similar for Real and Long variants}\\ \texttt{cast}\textsubscript{f-t} & & $st[sp\shortminus{}1] = cast_{f-t} (st[sp\shortminus{}1])$ & $sp$ & $pc+1$\\ & & \multicolumn{3}{l}{{\bf for all} $f,t\in\{Int, Real, Long\}$}\\ - \pagebreak +% \pagebreak \texttt{mkTask} & \texttt{Stable\textsubscript{n}} & $st[sp\shortminus{}n\shortminus{}1] = node (stable,$ & $sp\shortminus{}n+1$ & $pc+2$\\ & & $\qquad\qquad st[sp\shortminus{}1], \ldots, st[sp\shortminus{}n\shortminus{}1])$\\ & \texttt{Unstable\textsubscript{n}} & $st[sp\shortminus{}n\shortminus{}1] = node (unstable,$ & $sp\shortminus{}n+1$ & $pc+2$\\ diff --git a/intro/intro.tex b/intro/intro.tex index 00ed080..01475cf 100644 --- a/intro/intro.tex +++ b/intro/intro.tex @@ -10,7 +10,7 @@ \begin{chapterabstract} This chapter introduces the dissertation by providing: \begin{itemize} - \item a general introduction to the topics and research venues; + \item a general introduction to the topics and research directions; \item a reading guide; \item background material on the \glsxtrlong{IOT}, \glsxtrlongpl{DSL}, \glsxtrlong{TOP}, \gls{ITASK}, and \gls{MTASK}; \item and a detailed overview of the scientific contributions. @@ -18,38 +18,37 @@ \end{chapterabstract} There are at least 13.4 billion devices connected to the internet at the time of writing \citep{transformation_insights_current_2023}. -Each of these sense, act, or otherwise, interact with people, other computers, and the environment surrounding us. -Despite their immense diversity in characteristics, they are all computers. -And as computers, they require software to operate. +Each of these sense, act, or otherwise, interacts with people, computers, and the environment. +Despite their immense diversity in characteristics, they are all computers and they they all require software to operate. -An increasing amount of these connected devices are so-called \emph{edge devices} that operate in the \gls{IOT}. +An increasing number of these connected devices are so-called \emph{edge devices} that operate in the \gls{IOT}. Edge devices are the leaves of the \gls{IOT} systems. -They perform the interaction with the physical world and are often physically embedded in the fabric, residing usually in hard-to-reach places such as light bulbs, smart electricity meters, or even farm animals. +They perform the interaction with the physical world and are often physically embedded in the fabric itself, residing usually in hard-to-reach places such as light bulbs, clothing, smart electricity meters, buildings, or even farm animals. +Typically, these edge devices are powered by microcontrollers. Microcontrollers are equipped with a lot of connectivity for integrating peripherals such as sensors and actuators. The connectivity makes them very suitable to interact with their surroundings. -Typically, these edge devices are powered by microcontrollers. These miniature computers contain integrated circuits that accommodate a microprocessor designed for use in embedded applications. -Hence, microcontrollers are cheap; tiny; have little memory; and contain a slow, but energy-efficient processor. +As a consequence, microcontrollers are cheap; tiny; have little memory; and contain a slow, but energy-efficient processor. Unlike the conductor in an orchestra waving their baton to instruct the ensemble of instruments, in the universe of software there is room for little error. Moreover, in dynamic \gls{IOT} applications, there is not always a coordinating conductor. -Even though edge devices---the instruments---come and go, perform their own pieces, or are instructed to perform a certain piece, they operate without a central authority. -In the traditional setting, an \gls{IOT} engineer has to program each device and their interoperation using different programming paradigms, programming languages, and abstraction levels. +Edge devices---the instruments---come and go, perform their own pieces, or are sometimes instructed to perform a certain piece, they might even operate without a central authority. +In a traditional setting, an \gls{IOT} engineer has to program each device and their interoperation using different programming paradigms, programming languages, and abstraction levels. This results in semantic friction, which makes programming and maintaining \gls{IOT} systems a complex and error-prone process. This dissertation describes the research carried out around orchestrating these complex \gls{IOT} systems using \gls{TOP}. \Gls{TOP} is an innovative tierless programming paradigm for interactive multi-layered systems. -By utilising advanced compiler technologies, much of the internals, communication, and interoperation between the tiers or layers of the applications is automatically generated. +By utilising advanced compiler technologies, much of the internals, communication, and interoperation between the tiers or layers of the applications are automatically generated. From a single declarative specification of the work required, the compiler makes a ready-for-work application consisting of interconnected components for all tiers. For example, the \gls{TOP} system \gls{ITASK} is used to program all layers of multi-user distributed web applications from a single source specification. -It is implemented in \gls{CLEAN}, executes in \gls{CLEAN}'s general-purpose run time, and therefore requires relatively powerful hardware. -The high hardware requirements are no problem for regular computers but impractical for the average edge device. +It is implemented in the general-purpose lazy functional programming language \gls{CLEAN}, and therefore requires relatively powerful hardware. +The inflated hardware requirements are no problem for regular computers but impractical for the average edge device. This is where \glspl{DSL} must be brought into play. -Using \glspl{DSL}, hardware requirements can be drastically lowered, even with high levels of abstraction for the specified domain. \Glspl{DSL} are programming languages created with a specific domain in mind. -Consequently, jargon does not have to be expressed in the language itself, but they can be built-in features. +Consequently, jargon does not have to be expressed in terms of the language itself, but they can be built-in features. Furthermore, the \gls{DSL} can eschew language or system features that are irrelevant for the domain. +Using \glspl{DSL}, hardware requirements can be drastically lowered, even while maintaining a high abstraction level for the specified domain. To incorporate the plethora of edge devices in the orchestra of a \gls{TOP} system, the \gls{MTASK} system is used. The \gls{MTASK} language is a novel programming language for programming \gls{IOT} edge devices using \gls{TOP}. @@ -65,10 +64,10 @@ The \citet{wikipedia_contributors_rhapsody_2022} define a musical rhapsody is de \end{quote} This dissertation consists of three episodes. \Cref{prt:dsl} is a paper-based---otherwise known as cumulative---episode containing chapters that provide insight in advanced \gls{DSL} embedding techniques for \gls{FP} languages. -The chapters are readable independently. +The chapters can be read independently from each other. \Cref{prt:top} is a monograph showing \gls{MTASK}, a \gls{TOP} \gls{DSL} for the \gls{IOT}. Hence, the chapters in this episode are best read in order. -It introduces \gls{IOT} edge device programming, shows the complete \gls{MTASK} language, provides details on how \gls{MTASK} is integrated with \gls{ITASK}, shows how the byte code compiler is implemented, presents a guide for green computing with \gls{ITASK}, and ends with a conclusion and overview of future and related work. +It introduces \gls{IOT} edge device programming, shows the complete \gls{MTASK} language, provides details on how \gls{MTASK} is integrated with \gls{ITASK}, shows how the byte code compiler is implemented, presents a guide for green computing with \gls{MTASK}, and ends with a conclusion and overview of future and related work. \Cref{prt:tvt} is a single chapter based on a journal article in which traditional tiered \gls{IOT} programming is qualitatively and quantitatively compared to tierless programming using a real-world application. The chapter is readable independently. @@ -84,11 +83,11 @@ While the term \gls{IOT} briefly gained interest around 1999 to describe the com \end{quote} Much later, CISCO states that the \gls{IOT} started when there were as many connected devices as there were people on the globe, i.e.\ around 2008 \citep{evans_internet_2011}. -Today, \gls{IOT} is the term for a system of devices that sense the environment, act upon it, and communicate with each other and the world they live in. +Today, \gls{IOT} is the term for a system of devices that sense the environment, act upon it, and communicate with each other and the world they operate in. These connected devices are already in households all around us in the form of smart electricity meters, fridges, phones, watches, home automation, \etc. When describing \gls{IOT} systems, a tiered---or layered---architecture is often used for compartmentalisation. -The number of tiers heavily depends on the required complexity of the model. +The number of tiers depends on the required complexity of the model. For the intents and purposes of this thesis, the layered architecture as shown in \cref{fig:iot-layers} is used. \begin{figure} @@ -99,7 +98,7 @@ For the intents and purposes of this thesis, the layered architecture as shown i \end{figure} To explain the tiers, an example \gls{IOT} application---home automation---is dissected. -Closest to the end-user is the presentation layer, it provides the interface between the user and the \gls{IOT} systems. +Closest to the end-user is the presentation layer, it provides the interface between the user and the \gls{IOT} system. In home automation this may be a web interface, an app used on a phone, or wall-mounted tablet to interact with edge devices and view sensor data. The application layer provides the \glspl{API}, data interfaces, data storage processing, and data processing of \gls{IOT} systems. @@ -111,13 +110,13 @@ In home automation this layer consists of all devices hosting sensors and actuat All layers are connected using the network layer. In some applications this is implemented using conventional networking techniques such as Wi-Fi or Ethernet. -However, network technology that is tailored to the needs of the specific interconnection between the two layers are increasingly popular. +However, network technology that is tailored to the needs of the specific interconnection between two layers is increasingly popular. Examples of this are BLE, LoRa, ZigBee, and LTE-M as a communication protocol for connecting the perception layer to the application layer using \gls{IOT} transport protocols such as \gls{MQTT}. Protocols such as HTTP, AJAX, and WebSocket connecting the presentation layer to the application layer that are designed for the use in web applications. Across the layers, the devices are a large heterogeneous collection of different platforms, protocols, paradigms, and programming languages often resulting in impedance problems or semantic friction between layers when programming \citep{ireland_classification_2009}. -Even more so, the perception layer itself is often a heterogeneous collection of microcontrollers in itself, each having their own peculiarities, language of choice, and hardware interfaces. -As edge hardware needs to be cheap, small scale, and energy efficient, the microcontrollers used to power them do not have a lot of computational power, only a soup\c{c}on of memory, and little communication bandwidth. +Even more so, the perception layer itself is often a heterogeneous collection of microcontrollers in itself, each having their own peculiarities, programming language of choice, and hardware interfaces. +As edge hardware needs to be cheap, small scale, and energy efficient, the microcontrollers used to power them do not have a lot of computational power, only a smidge of memory, and little communication bandwidth. Typically, these devices are unable to run a full-fledged general-purpose \gls{OS}. Rather they employ compiled firmware written in imperative languages that combines all tasks on the device in a single program. While devices are getting a bit faster, smaller, and cheaper, they keep these properties to an extent. @@ -137,7 +136,7 @@ It does so by compiling the \gls{DSL} to byte code that is executed in a feather % General Programming languages can be divided up into two categories: \glspl{DSL} and \glspl{GPL} \citep{fowler_domain_2010}. Where \glspl{GPL} are not made with a demarcated area in mind, \glspl{DSL} are tailor-made for a specific domain. -Writing idiomatic domain-specific code in a \gls{DSL} is easier and requires less background knowledge. +Writing idiomatic domain-specific code in a \gls{DSL} is easier and requires less \gls{GPL} knowledge for a domain expert. This does come at the cost of the \gls{DSL} being sometimes less expressive to an extent that it may not even be Turing complete. \Glspl{DSL} come in two main flavours: standalone and embedded (\cref{sec:standalone_embedded})\footnote{Standalone and embedded are also called external and internal respectively.}. Standalone languages are languages for which the complete toolchain has been developed, just as for any other \gls{GPL}. @@ -164,14 +163,14 @@ The dichotomous approach to standalone \glspl{DSL} is embedding the \gls{DSL} in By defining the language as constructs in the host language, much of the machinery is inherited \citep{krishnamurthi_linguistic_2001}. This greatly reduces the cost of creating embedded languages and shields the user from having to learn the host language and toolchain. However, there are two sides to this coin. -If the syntax of the host language is not very flexible, the syntax of the \gls{DSL} could become clumsy. +If the syntax of the host language is not very flexible, the syntax of the \gls{DSL} can become clumsy. Furthermore, \gls{DSL} errors shown to the programmer may be larded with host language errors, making it difficult for a non-expert of the host language to work with the \gls{DSL}. \Gls{FP} languages are especially suitable for hosting embedded \glspl{DSL}. -They offer tooling for building abstraction levels by a strong and versatile type systems, minimal but flexible syntax, and referential transparency. +They offer tooling for building abstraction levels by a strong and versatile type system, minimal but flexible syntax, and referential transparency. \subsection{Heterogeneity and homogeneity}% \label{sec:hetero_homo} -\Citet{tratt_domain_2008} applied a notion from metaprogramming \citep{sheard_accomplishments_2001} to \glspl{EDSL} to define homogeneity and heterogeneity of \glspl{EDSL} as follows: +\Citet{tratt_domain_2008} applies a notion from metaprogramming \citep{sheard_accomplishments_2001} to \glspl{EDSL} to define homogeneity and heterogeneity of \glspl{EDSL} as follows: \begin{quote} \emph{A homogeneous system is one where all the components are specifically designed to work with each other, whereas in heterogeneous systems at least one of the components is largely, or completely, ignorant of the existence of the other parts of the system. @@ -185,7 +184,8 @@ Examples of homogeneous \glspl{EDSL} are libraries such as ones for sets, region On the other hand, heterogeneous \glspl{EDSL} are languages that are not executed in the host language. For example, \citet{elliott_compiling_2003} describe the language Pan, for which the final representation in the host language is a compiler that will, when executed, generate code for a completely different target platform. -In fact, both \gls{ITASK} and \gls{MTASK} are \glspl{EDSL}. + +Both \gls{ITASK} and \gls{MTASK} are \glspl{EDSL}. Programs written in \gls{ITASK} run in the host language, and it is a homogeneous \gls{DSL}. Tasks written using \gls{MTASK} are dynamically compiled to byte code for an edge device, making it a heterogeneous \gls{DSL}. The interpreter running on the edge device has no knowledge of the higher level task specification. @@ -193,7 +193,7 @@ It just interprets the byte code it was sent and takes care of the communication \section{\texorpdfstring{\Glsxtrlong{TOP}}{Task-oriented programming}}% \label{sec:back_top} -\Gls{TOP} is a recent declarative programming paradigm for modelling interactive systems \citep{plasmeijer_task-oriented_2012}. +\Gls{TOP} is a declarative programming paradigm for modelling interactive systems \citep{plasmeijer_task-oriented_2012}. Instead of dividing problems into layers, \gls{TOP} deals with separation of concerns in a novel way. This approach to software development is called \gls{TOSD} \citep{wang_maintaining_2018}. @@ -212,9 +212,9 @@ This approach to software development is called \gls{TOSD} \citep{wang_maintaini \item[Tasks:] In \gls{TOP} languages, tasks are the basic building blocks. A task is an abstract representation of a piece of work that needs to be done. - It provides an intuitive abstraction over work in the real world. + It provides an abstraction over work in the real world. The nature of tasks makes them observable during execution. - It is possible to observe a---partial---typed result and act upon it, e.g.\ taking the partial result as good enough, or by starting new tasks. + It is possible to observe the current task value act upon it, e.g.\ taking a partial result as good enough, or by starting new tasks. Examples of tasks are filling forms, sending emails, reading sensors or even doing physical tasks. Just as with real-life tasks, multiple tasks can be combined in various ways such as in parallel or in sequence to form workflows. Such combination operators are called task combinators. @@ -226,26 +226,24 @@ This approach to software development is called \gls{TOSD} \citep{wang_maintaini \Glspl{SDS} can also represent external impure data such as the time, random numbers or sensor data. In many \gls{TOP} languages, combinators are available to filter, combine, transform, and focus \glspl{SDS}. \item[\Gls{UI}:] - The \gls{UI} of the system is automatically generated from the structural representation of the type. + The \gls{UI} of the system is automatically generated from the structural representation of the types. Though, practical \gls{TOP} systems allow tweaking afterwards to suit the specific needs of the application. \item[\Gls{UOD}:] - The \gls{UOD} is explicitly and separately modelled by the relations that exist in the functions of the host language. + The \gls{UOD} is explicitly and separately modelled by the data types and relations that exist in the functions of the host language. \end{description} \Cref{fig:tosd} differs from the presented \gls{IOT} architecture shown in \cref{fig:iot-layers} because they represent different concepts. The \gls{IOT} architecture is an execution architecture whereas \gls{TOSD} is a software development model. E.g.\ from a software development perspective, a task is a task, whether it is executed on a microcontroller, a server, or a client. Only when a task is executed, the location of the execution becomes important, but this is taken care of by the system. -Some concepts from the \gls{TOSD} model can be mapped upon the \gls{IOT} architecture though. -Applying the concepts of \gls{TOSD} to \gls{IOT} systems can be done in two ways. +Some concepts from the \gls{TOSD} model can be mapped upon the \gls{IOT} architecture in two ways. Firstly, edge devices can be seen as simple resources, thus accessed through \glspl{SDS}. The second view is that edge devices contain miniature \gls{TOP} systems in itself. The individual components in the miniature systems, the tasks, the \glspl{SDS}, are, in the eventual execution, connected to the main system. \subsection{The \texorpdfstring{\gls{ITASK}}{iTask} system} The concept of \gls{TOP} originated from the \gls{ITASK} framework, a declarative language and \gls{TOP} engine for defining interactive multi-user distributed web applications. -The \gls{ITASK} system is implemented as an \gls{EDSL} in the lazy pure \gls{FP} language \gls{CLEAN}\footnotemark{} \citep{plasmeijer_itasks:_2007,plasmeijer_task-oriented_2012}. -\footnotetext{\Cref{chp:clean_for_haskell_programmers} contains a guide for \gls{CLEAN} tailored to \gls{HASKELL} programmers.} +The \gls{ITASK} system is implemented as an \gls{EDSL} in the programming language \gls{CLEAN}\footnote{\Cref{chp:clean_for_haskell_programmers} contains a guide for \gls{CLEAN} tailored to \gls{HASKELL} programmers.} \citep{plasmeijer_itasks:_2007,plasmeijer_task-oriented_2012}. From the structural properties of the data types and the current status of the work to be done, the entire \gls{UI} is automatically generated. Browsers are powering \gls{ITASK}'s presentation layer. The framework is built on top of standard web techniques such as JavaScript, HTML, and {CSS}. @@ -277,7 +275,7 @@ The task for updating the to-do list is an editor (\cref{lst:todo_editor}) combi The actions either change the value, sorting or clearing it, or terminate the task by returning the current value of the \gls{SDS}. Special combinators (e.g.\ \cleaninline{@>>} at \cref{lst:todo_ui}) are used to tweak the \gls{UI} to display informative labels. -\cleaninputlisting[float=,firstline=6,lastline=22,tabsize=3,numbers=left,caption={The code for the shared to-do list in \gls{ITASK}.},label={lst:todo}]{lst/sharedlist.icl} +\cleaninputlisting[float=,firstline=6,lastline=22,tabsize=3,numbers=left,caption={The code for a shared to-do list in \gls{ITASK}.},label={lst:todo}]{lst/sharedlist.icl} \begin{figure} \centering @@ -289,8 +287,8 @@ Special combinators (e.g.\ \cleaninline{@>>} at \cref{lst:todo_ui}) are used to \subsection{The \texorpdfstring{\gls{MTASK}}{mTask} system} The work for \gls{IOT} edge devices can often be succinctly described by \gls{TOP} programs. Software on microcontrollers is usually composed of smaller basic tasks, are interactive, and share data with other components or the server. -The \gls{ITASK} system seems an obvious candidate at first glance for bringing \gls{TOP} to \gls{IOT} edge devices. -An \gls{ITASK} application contains many features that are not needed on \emph{edge devices} such as higher-order tasks, support for a distributed architecture, or a multi-user web server. +The \gls{ITASK} system seems an obvious candidate for bringing \gls{TOP} to \gls{IOT} edge devices. +However, an \gls{ITASK} application contains many features that are not needed on \emph{edge devices} such as higher-order tasks, support for a distributed architecture, or a multi-user web server. Furthermore, \gls{IOT} edge devices are in general not powerful enough to run or interpret \gls{CLEAN}\slash\gls{ABC} code, they just lack the processor speed and memory. To bridge this gap, \gls{MTASK} is developed, a domain-specific \gls{TOP} system for \gls{IOT} edge devices that is integrated in \gls{ITASK} \citep{koopman_task-based_2018}. The \gls{ITASK} language abstracts away from details such as user interfaces, data storage, client-side platforms, and persistent workflows. @@ -298,7 +296,7 @@ On the other hand, \gls{MTASK} offers abstractions for edge layer-specific detai The \gls{MTASK} system is seamlessly integrated with \gls{ITASK}. Tasks in \gls{MTASK} are integrated in such a way that they function as regular \gls{ITASK} tasks. -Furthermore, \glspl{SDS} on the device can tether \gls{ITASK} \glspl{SDS}. +Furthermore, \glspl{SDS} on the device can proxy \gls{ITASK} \glspl{SDS}. Using \gls{MTASK}, the programmer can define all layers of an \gls{IOT} system as a single declarative specification. The \gls{MTASK} language is written in \gls{CLEAN} as a multi-view \gls{EDSL} and hence there are multiple interpretations possible. The byte code compiler is the most relevant for this thesis. @@ -344,9 +342,9 @@ intBlink :: (Shared sds Int) -> Main (MTask v Int) | mtask v & ...\end{lstClean} \cleaninputlisting[aboveskip=0pt,firstnumber=4,firstline=23,numbers=left,caption={The \gls{MTASK} code for the interactive blinking application.},label={lst:intro_blink_mtask}]{lst/blink.icl} \subsection{Other \texorpdfstring{\glsxtrshort{TOP}}{TOP} languages} -While \gls{ITASK} conceived \gls{TOP}, it is not the only \gls{TOP} system anymore. +While \gls{ITASK} conceived \gls{TOP}, it is no longer the only \gls{TOP} system. Some \gls{TOP} languages were created to fill a gap encountered in practise. -Toppyt \citep{lijnse_toppyt_2022} is a general purpose \gls{TOP} language written in \gls{PYTHON} used to host frameworks for modelling \emph{Command\&Control} systems, and hTask \citep{lubbers_htask_2022}, a vessel for experimenting with asynchronous \glspl{SDS}. +Toppyt \citep{lijnse_toppyt_2022} is a general purpose \gls{TOP} language written in \gls{PYTHON} used to host frameworks for modelling \emph{command \& control} systems, and hTask \citep{lubbers_htask_2022}, a vessel for experimenting with asynchronous \glspl{SDS}. Furthermore, some \gls{TOP} systems arose from Master's and Bachelor's thesis projects. For example, \textmu{}Task \citep{piers_task-oriented_2016}, a \gls{TOP} language for modelling non-interruptible embedded systems in \gls{HASKELL}, and LTasks \citep{van_gemert_task_2022}, a \gls{TOP} language written in the dynamically typed programming language {LUA}. Finally, there are \gls{TOP} languages with strong academic foundations. @@ -395,7 +393,7 @@ It is compiled from the following publications: It provides an overview of the initial \gls{TOP} \gls{MTASK} language and shows first versions of some interpretations. \item \emph{Task Oriented Programming for the Internet of Things} \citep{lubbers_task_2018}\footnotetext{This work is an extension of my Master's thesis \citep{lubbers_task_2017}.} shows how a simple imperative variant of \gls{MTASK} was integrated with \gls{ITASK}. - While the language was a lot different from later versions, the integration mechanism is still used in \gls{MTASK} today. + While the language differs a lot from the current version, the integration mechanism is still used. % \paragraph{Contribution} % The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer in which we discussed and refined the ideas. \item \emph{Multitasking on Microcontrollers using Task Oriented Programming} \citep{lubbers_multitasking_2019}\footnote{This work acknowledges the support of the \erasmusplus{} project ``Focusing Education on Composability, Comprehensibility and Correctness of Working Software'', no.\ 2017--1--SK01--KA203--035402.} @@ -403,7 +401,7 @@ It is compiled from the following publications: % \paragraph{Contribution} % The research in this paper and writing the paper was performed by me, though there were weekly meetings with Pieter Koopman and Rinus Plasmeijer. \item \emph{Simulation of a Task-\kern-1.25ptBased Embedded Domain Specific Language for the Internet of Things} \citep{koopman_simulation_2023}\footnotemark[\value{footnote}] - are the revised lecture notes for a course on the \gls{MTASK} simulator was provided at the 2018 \gls{CEFP}\slash{}\gls{3COWS} winter school in Ko\v{s}ice, Slovakia, January 22--26, 2018. + are the revised lecture notes for a course on the \gls{MTASK} simulator provided at the 2018 \gls{CEFP}\slash{}\gls{3COWS} winter school in Ko\v{s}ice, Slovakia, January 22--26, 2018. % \paragraph{Contribution} % Pieter Koopman wrote and taught it, I helped with the software and research. \item \emph{Writing Internet of Things Applications with Task Oriented Programming} \citep{lubbers_writing_2023}\footnotemark[\value{footnote}] @@ -432,10 +430,10 @@ It is compiled from the following publications: \paragraph{Contribution:} The original \gls{MTASK} language, and their initial interpretations were developed by Pieter Koopman and Rinus Plasmeijer. I extended the language, developed the byte code interpreter, the integration with \gls{ITASK}, and the \gls{RTS}. -The paper of which I am first author are solely written by me, there were weekly meetings with the co-authors in which we discussed and refined the ideas. +The papers of which I am first author are solely written by me, there were weekly meetings with the co-authors in which we discussed and refined the ideas. \subsection{\Fullref{prt:tvt}} -\Cref{prt:tvt} is based on a journal paper that quantitatively and qualitatively compares traditional \gls{IOT} architectures with \gls{IOT} systems using \gls{TOP} and contains a single chapter. +\Cref{prt:tvt} is based on a journal paper that quantitatively and qualitatively compares traditional \gls{IOT} architectures with \gls{IOT} systems using \gls{TOP}. This chapter is based on the conference paper and a journal paper extending it: \begin{enumerate}[resume] \item \emph{Tiered versus Tierless \glsxtrshort{IOT} Stacks: Comparing Smart Campus Software Architectures} \citep{lubbers_tiered_2020}\footnote{This work was partly funded by the 2019 Radboud-Glasgow Collaboration Fund.}\label{enum:iot20} compares traditional tiered programming to tierless architectures by comparing two implementations of a smart-campus application. diff --git a/intro/iot-layers.tex b/intro/iot-layers.tex index 5ece800..6b0b8d9 100644 --- a/intro/iot-layers.tex +++ b/intro/iot-layers.tex @@ -26,5 +26,8 @@ -- ([yshift=2em,xshift=1em]3.north east) -- ([yshift=-2em,xshift=1em]1.south east) -- cycle; + + \draw [densely dotted] (1.south) -- (2.north); + \draw [densely dotted] (2.south) -- (3.north); \end{tikzpicture} \end{document} diff --git a/other.bib b/other.bib index 96afadd..168a87e 100644 --- a/other.bib +++ b/other.bib @@ -847,7 +847,7 @@ Publisher: Association for Computing Machinery}, year = {2008}, note = {Place: New York, NY, USA Publisher: Association for Computing Machinery}, - keywords = {compile-time meta-programming, domain specific languages, Syntax extension}, + keywords = {domain specific languages, compile-time meta-programming, Syntax extension}, file = {Tratt - 2008 - Domain Specific Language Implementation via Compil.pdf:/home/mrl/.local/share/zotero/storage/HHGYJK4H/Tratt - 2008 - Domain Specific Language Implementation via Compil.pdf:application/pdf}, } @@ -1575,6 +1575,23 @@ Publisher: Association for Computing Machinery}, file = {Hinze and Jeuring - Generic Haskell practice and theory.pdf:/home/mrl/.local/share/zotero/storage/QDRNI5VB/Hinze and Jeuring - Generic Haskell practice and theory.pdf:application/pdf}, } +@article{alhirabi_security_2021, + title = {Security and {Privacy} {Requirements} for the {Internet} of {Things}: {A} {Survey}}, + volume = {2}, + issn = {2691-1914}, + doi = {10.1145/3437537}, + abstract = {The design and development process for internet of things (IoT) applications is more complicated than that for desktop, mobile, or web applications. First, IoT applications require both software and hardware to work together across many different types of nodes with different capabilities under different conditions. Second, IoT application development involves different types of software engineers such as desktop, web, embedded, and mobile to work together. Furthermore, non-software engineering personnel such as business analysts are also involved in the design process. In addition to the complexity of having multiple software engineering specialists cooperating to merge different hardware and software components together, the development process requires different software and hardware stacks to be integrated together (e.g., different stacks from different companies such as Microsoft Azure and IBM Bluemix). Due to the above complexities, non-functional requirements (such as security and privacy, which are highly important in the context of the IoT) tend to be ignored or treated as though they are less important in the IoT application development process. This article reviews techniques, methods, and tools to support security and privacy requirements in existing non-IoT application designs, enabling their use and integration into IoT applications. This article primarily focuses on design notations, models, and languages that facilitate capturing non-functional requirements (i.e., security and privacy). Our goal is not only to analyse, compare, and consolidate the empirical research but also to appreciate their findings and discuss their applicability for the IoT.}, + number = {1}, + journal = {ACM Trans. Internet Things}, + author = {Alhirabi, Nada and Rana, Omer and Perera, Charith}, + month = feb, + year = {2021}, + note = {Place: New York, NY, USA +Publisher: Association for Computing Machinery}, + keywords = {Internet of Things, design principles, non functional requirements, notation, software design tools, software engineering}, + file = {Alhirabi et al. - 2021 - Security and Privacy Requirements for the Internet.pdf:/home/mrl/.local/share/zotero/storage/7UN4IF62/Alhirabi et al. - 2021 - Security and Privacy Requirements for the Internet.pdf:text/html}, +} + @inproceedings{torrano_strictness_2005, address = {Bristol, UK}, series = {Trends in {Functional} {Programming}}, @@ -1749,7 +1766,7 @@ Publisher: Association for Computing Machinery}, title = {Staging with {Class}: {A} {Specification} for {Typed} {Template} {Haskell}}, volume = {6}, doi = {10.1145/3498723}, - abstract = {Multi-stage programming using typed code quotation is an established technique for writing optimizing code generators with strong type-safety guarantees. Unfortunately, quotation in Haskell interacts poorly with type classes, making it difficult to write robust multi-stage programs. We study this unsound interaction and propose a resolution, staged type class constraints, which we formalize in a source calculus λ⇒ that elaborates into an explicit core calculus F. We show type soundness of both calculi, establishing that well-typed, well-staged source programs always elaborate to well-typed, well-staged core programs, and prove beta and eta rules for code quotations. Our design allows programmers to incorporate type classes into multi-stage programs with confidence. Although motivated by Haskell, it is also suitable as a foundation for other languages that support both overloading and quotation.}, + abstract = {Multi-stage programming using typed code quotation is an established technique for writing optimizing code generators with strong type-safety guarantees. Unfortunately, quotation in Haskell interacts poorly with type classes, making it difficult to write robust multi-stage programs. We study this unsound interaction and propose a resolution, staged type class constraints, which we formalize in a source calculus $\lambda$⇒ that elaborates into an explicit core calculus F. We show type soundness of both calculi, establishing that well-typed, well-staged source programs always elaborate to well-typed, well-staged core programs, and prove beta and eta rules for code quotations. Our design allows programmers to incorporate type classes into multi-stage programs with confidence. Although motivated by Haskell, it is also suitable as a foundation for other languages that support both overloading and quotation.}, number = {POPL}, journal = {Proc. ACM Program. Lang.}, author = {Xie, Ningning and Pickering, Matthew and Löh, Andres and Wu, Nicolas and Yallop, Jeremy and Wang, Meng}, @@ -1913,7 +1930,7 @@ Publisher: Association for Computing Machinery}, address = {Netherlands}, type = {{PhD} {Thesis}}, title = {Digital circuit in {C$\lambda$aSH}: functional specifications and type-directed synthesis}, - abstract = {Over the last three decades, the number of transistors used in microchips has increased by three orders of magnitude, from millions to billions. The productivity of the designers, however, lags behind. Managing to implement complex algorithms, while keeping non-functional properties within desired bounds, and thoroughly verifying the design against its specification, are the main difficulties in circuit design. As a motivation for our work we make a qualitative analysis of the tools available to circuit designers. Here we see that progress has been slow, and that the same techniques have been used for over 20 years. We claim that functional languages can be used to raise the abstraction level in circuit design. Especially higher-order functional languages, where functions are first-class and can be manipulated by other functions, offer a single abstraction mechanism that can capture many design patterns. This thesis explores the idea of using the functional language Haskell directly as a hardware specification language, and move beyond the limitations of embedded languages. Additionally, we can use normal functions from existing Haskell libraries to model the behaviour of our circuits. This thesis describes the inner workings of our CλaSH compiler, which translates the aforementioned circuit descriptions written in Haskell to low-level descriptions in VHDL. The challenge then becomes the reduction of the higher-level abstractions in the descriptions to a form where synthesis is feasible. This thesis describes a term rewrite system (with bound variables) to achieve this reduction. We prove that this term rewrite system always reduces a polymorphic, higher-order circuit description to a synthesisable variant. Even when descriptions use high-level abstractions, the CλaSH compiler can synthesize efficient circuits. Case studies show that circuits designed in Haskell, and synthesized with the C?aSH compiler, are on par with hand-written VHDL, in both area and gate propagation delay. This thesis thus shows the merits of using a modern functional language for circuit design. The advanced type system and higher-order functions allow us to design circuits that have the desired property of being correct-by-construction. Finally, our synthesis approach enables us to derive efficient circuits from descriptions that use high-level abstractions.}, + abstract = {Over the last three decades, the number of transistors used in microchips has increased by three orders of magnitude, from millions to billions. The productivity of the designers, however, lags behind. Managing to implement complex algorithms, while keeping non-functional properties within desired bounds, and thoroughly verifying the design against its specification, are the main difficulties in circuit design. As a motivation for our work we make a qualitative analysis of the tools available to circuit designers. Here we see that progress has been slow, and that the same techniques have been used for over 20 years. We claim that functional languages can be used to raise the abstraction level in circuit design. Especially higher-order functional languages, where functions are first-class and can be manipulated by other functions, offer a single abstraction mechanism that can capture many design patterns. This thesis explores the idea of using the functional language Haskell directly as a hardware specification language, and move beyond the limitations of embedded languages. Additionally, we can use normal functions from existing Haskell libraries to model the behaviour of our circuits. This thesis describes the inner workings of our C$\lambda$aSH compiler, which translates the aforementioned circuit descriptions written in Haskell to low-level descriptions in VHDL. The challenge then becomes the reduction of the higher-level abstractions in the descriptions to a form where synthesis is feasible. This thesis describes a term rewrite system (with bound variables) to achieve this reduction. We prove that this term rewrite system always reduces a polymorphic, higher-order circuit description to a synthesisable variant. Even when descriptions use high-level abstractions, the C$\lambda$aSH compiler can synthesize efficient circuits. Case studies show that circuits designed in Haskell, and synthesized with the C?aSH compiler, are on par with hand-written VHDL, in both area and gate propagation delay. This thesis thus shows the merits of using a modern functional language for circuit design. The advanced type system and higher-order functions allow us to design circuits that have the desired property of being correct-by-construction. Finally, our synthesis approach enables us to derive efficient circuits from descriptions that use high-level abstractions.}, language = {Undefined}, school = {University of Twente}, author = {Baaij, C. P. R.}, @@ -1922,7 +1939,7 @@ Publisher: Association for Computing Machinery}, doi = {10.3990/1.9789036538039}, note = {ISBN: 978-90-365-3803-9}, keywords = {Haskell, Digital Circuits, EC Grant Agreement nr.: FP7/248465, EC Grant Agreement nr.: FP7/610686, EWI-23939, FPGA, Functional Programming, Hardware, IR-93962, Lambda calculus, METIS-308711, Rewrite Systems}, - file = {Baaij - 2015 - Digital circuit in CλaSH functional specification.pdf:/home/mrl/.local/share/zotero/storage/MYJ33ISL/Baaij - 2015 - Digital circuit in CλaSH functional specification.pdf:application/pdf}, + file = {Baaij - 2015 - Digital circuit in C$\lambda$aSH functional specification.pdf:/home/mrl/.local/share/zotero/storage/MYJ33ISL/Baaij - 2015 - Digital circuit in C$\lambda$aSH functional specification.pdf:application/pdf}, } @inproceedings{mcdonell_embedded_2022, @@ -2156,25 +2173,7 @@ Publisher: Association for Computing Machinery}, pages = {440--445}, } -@article{alhirabi_security_2021, - title = {Security and {Privacy} {Requirements} for the {Internet} of {Things}: {A} {Survey}}, - volume = {2}, - issn = {2691-1914}, - url = {https://doi.org/10.1145/3437537}, - doi = {10.1145/3437537}, - abstract = {The design and development process for internet of things (IoT) applications is more complicated than that for desktop, mobile, or web applications. First, IoT applications require both software and hardware to work together across many different types of nodes with different capabilities under different conditions. Second, IoT application development involves different types of software engineers such as desktop, web, embedded, and mobile to work together. Furthermore, non-software engineering personnel such as business analysts are also involved in the design process. In addition to the complexity of having multiple software engineering specialists cooperating to merge different hardware and software components together, the development process requires different software and hardware stacks to be integrated together (e.g., different stacks from different companies such as Microsoft Azure and IBM Bluemix). Due to the above complexities, non-functional requirements (such as security and privacy, which are highly important in the context of the IoT) tend to be ignored or treated as though they are less important in the IoT application development process. This article reviews techniques, methods, and tools to support security and privacy requirements in existing non-IoT application designs, enabling their use and integration into IoT applications. This article primarily focuses on design notations, models, and languages that facilitate capturing non-functional requirements (i.e., security and privacy). Our goal is not only to analyse, compare, and consolidate the empirical research but also to appreciate their findings and discuss their applicability for the IoT.}, - number = {1}, - journal = {ACM Trans. Internet Things}, - author = {Alhirabi, Nada and Rana, Omer and Perera, Charith}, - month = feb, - year = {2021}, - note = {Place: New York, NY, USA -Publisher: Association for Computing Machinery}, - keywords = {design principles, Internet of Things, non functional requirements, notation, software design tools, software engineering}, - file = {Alhirabi et al. - 2021 - Security and Privacy Requirements for the Internet.pdf:/home/mrl/.local/share/zotero/storage/7UN4IF62/Alhirabi et al. - 2021 - Security and Privacy Requirements for the Internet.pdf:text/html}, -} - -@techreport{transformation_insights_current_2023, +@techreport{transforma_insights_current_2023, title = {Current {IoT} {Forecast} {Highlights}}, url = {https://transformainsights.com/research/forecast/highlights}, institution = {{Transforma Insights}}, diff --git a/process_bib.sh b/process_bib.sh index f7b3f09..e1bdb49 100755 --- a/process_bib.sh +++ b/process_bib.sh @@ -4,4 +4,8 @@ then echo "Usage: $0 FILE.bib [FILE.bib ...]" exit fi -sed -i '/url = {https\?:\/\/\(doi.org\|link\.springer\|ieeexplore\|dl\.acm\|services\.igi-global\|arxiv\.org\)/d' "${@}" +sed -i \ + -e '/url = {https\?:\/\/\(doi.org\|link\.springer\|ieeexplore\|dl\.acm\|services\.igi-global\|arxiv\.org\)/d'\ + -e 's/{Transforma Insights}/{&}/g'\ + -e 's/λ/$\\lambda$/g'\ + "${@}" diff --git a/tiot.bib b/tiot.bib index ecd62ca..3136fe7 100644 --- a/tiot.bib +++ b/tiot.bib @@ -634,7 +634,7 @@ series = {Onward! 2020} publisher = {Association for Computing Machinery}, address = {New York, NY, USA}, doi = {10.1145/325694.325709}, - abstract = {This paper describes a new approach to generic functional programming, which allows us to define functions generically for all datatypes expressible in Haskell. A generic function is one that is defined by induction on the structure of types. Typical examples include pretty printers, parsers, and comparison functions. The advanced type system of Haskell presents a real challenge: datatypes may be parameterized not only by types but also by type constructors, type definitions may involve mutual recursion, and recursive calls of type constructors can be arbitrarily nested. We show that—despite this complexity—a generic function is uniquely defined by giving cases for primitive types and type constructors (such as disjoint unions and cartesian products). Given this information a generic function can be specialized to arbitrary Haskell datatypes. The key idea of the approach is to model types by terms of the simply typed λ-calculus augmented by a family of recursion operators. While conceptually simple, our approach places high demands on the type system: it requires polymorphic recursion, rank-n types, and a strong form of type constructor polymorphism. Finally, we point out connections to Haskell's class system and show that our approach generalizes type classes in some respects.}, + abstract = {This paper describes a new approach to generic functional programming, which allows us to define functions generically for all datatypes expressible in Haskell. A generic function is one that is defined by induction on the structure of types. Typical examples include pretty printers, parsers, and comparison functions. The advanced type system of Haskell presents a real challenge: datatypes may be parameterized not only by types but also by type constructors, type definitions may involve mutual recursion, and recursive calls of type constructors can be arbitrarily nested. We show that—despite this complexity—a generic function is uniquely defined by giving cases for primitive types and type constructors (such as disjoint unions and cartesian products). Given this information a generic function can be specialized to arbitrary Haskell datatypes. The key idea of the approach is to model types by terms of the simply typed $\lambda-calculus augmented by a family of recursion operators. While conceptually simple, our approach places high demands on the type system: it requires polymorphic recursion, rank-n types, and a strong form of type constructor polymorphism. Finally, we point out connections to Haskell's class system and show that our approach generalizes type classes in some respects.}, booktitle = {Proceedings of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages}, pages = {119–132}, numpages = {14}, -- 2.20.1