<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>OAR@UM Community:</title>
    <link>https://www.um.edu.mt/library/oar/handle/123456789/8336</link>
    <description />
    <pubDate>Thu, 29 Oct 2026 14:32:35 GMT</pubDate>
    <dc:date>2026-10-29T14:32:35Z</dc:date>
    <item>
      <title>If at first you don’t succeed : extended monitorability through multiple executions</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/150534</link>
      <description>Title: If at first you don’t succeed : extended monitorability through multiple executions
Authors: Achilleos, Antonis; Francalanza, Adrian; Xuereb, Jasmine
Abstract: This paper studies the extent to which branchingtime&#xD;
properties can be adequately verified using runtime monitors.&#xD;
We depart from the classical setup where monitoring&#xD;
is limited to a single system execution and investigate the&#xD;
enhanced observational capabilities when monitoring a system&#xD;
over multiple runs. To ensure generality, we focus on branchingtime&#xD;
properties expressed in the modal m-calculus, a well-studied&#xD;
foundational logic. Our results show that the proposed setup&#xD;
can systematically extend established monitorability limits for&#xD;
branching-time properties. We validate our results by instantiating&#xD;
them to verify actor-based systems. We also prove bounds&#xD;
that capture the correspondence between the syntactic structure&#xD;
of a property and the number of required system runs.</description>
      <pubDate>Sun, 01 Jun 2025 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/150534</guid>
      <dc:date>2025-06-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>DPICache : a distributed program image cache for wireless sensor networks</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/149587</link>
      <description>Title: DPICache : a distributed program image cache for wireless sensor networks
Authors: Ellul, Joshua; Martinez, Kirk
Abstract: Wireless sensor networks, like other computing platforms, require software updates from time to time due to software bugs, new functionality, better understanding of the surrounding environment or new applications. Physically connecting to and reprogramming each node is usually not feasible and often impossible. A number of wireless code distribution and reprogramming techniques have been presented. In this paper we present a novel technique to efficiently update any nodes that were lost during programming periods. Our experiments demonstrate a 57% decrease of bytes sent over the air when updating nodes that previously missed updates.</description>
      <pubDate>Wed, 01 Oct 2008 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/149587</guid>
      <dc:date>2008-10-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>A dynamic size distributed program image cache for wireless sensor networks</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/149586</link>
      <description>Title: A dynamic size distributed program image cache for wireless sensor networks
Authors: Ellul, Joshua; Martinez, Kirk; De Roure, David
Abstract: Reprogramming node software over-the-air is an&#xD;
essential requirement in many wireless sensor network&#xD;
applications due to the inaccessibility of the deployed sensor&#xD;
nodes. Transmitting whole software images consumes a high&#xD;
amount of energy in proportion to updates, especially when&#xD;
they are small in size. Incremental updates have addressed this;&#xD;
however introduce the potential of a sensor node becoming out&#xD;
of sync when it misses an update. In this paper we present a&#xD;
dynamic size distributed program image cache that provides&#xD;
increased efficiency in reprogramming out of sync nodes and&#xD;
multi-purpose wireless sensor networks.</description>
      <pubDate>Fri, 01 May 2009 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/149586</guid>
      <dc:date>2009-05-01T00:00:00Z</dc:date>
    </item>
    <item>
      <title>Run-time compilation of bytecode in wireless sensor networks</title>
      <link>https://www.um.edu.mt/library/oar/handle/123456789/149584</link>
      <description>Title: Run-time compilation of bytecode in wireless sensor networks
Authors: Ellul, Joshua; Martinez, Kirk
Abstract: Recent work on virtual machines for wireless sensor networks&#xD;
has demonstrated the bene ts of using a Java programming&#xD;
paradigm for resource constrained sensor networks. Results&#xD;
have shown that a virtual machine approach greatly su ers&#xD;
from interpretation overheads. We present run-time compi-&#xD;
lation of bytecode which leverages from a compact platform&#xD;
independent bytecode application encoding as well as an ef-&#xD;
 cient program execution platform by converting bytecode&#xD;
to native code in situ.</description>
      <pubDate>Thu, 01 Apr 2010 00:00:00 GMT</pubDate>
      <guid isPermaLink="false">https://www.um.edu.mt/library/oar/handle/123456789/149584</guid>
      <dc:date>2010-04-01T00:00:00Z</dc:date>
    </item>
  </channel>
</rss>

