<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <title>DSpace Collection:</title>
  <link rel="alternate" href="http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/345" />
  <subtitle />
  <id>http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/345</id>
  <updated>2013-05-25T09:28:31Z</updated>
  <dc:date>2013-05-25T09:28:31Z</dc:date>
  <entry>
    <title>On the (un-)decidability of model-checking resource-bounded agents</title>
    <link rel="alternate" href="http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/522" />
    <author>
      <name>Muller, Berndt</name>
    </author>
    <id>http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/522</id>
    <updated>2012-05-03T08:53:27Z</updated>
    <published>2012-05-02T23:00:00Z</published>
    <summary type="text">Title: On the (un-)decidability of model-checking resource-bounded agents
Authors: Muller, Berndt
Abstract: The verification and modelling of multi-agent systems is an important topic that has attracted much attention in recent years. Resources, however, have only recently been studied as simple extensions to well-known logics. Trying to find a set of useful features while retaining essential properties for practical use, we explore the question: Where are the limits of what can be verified about resource-bounded agents? We try to answer this question by considering several natural logic-based settings that may arise and prove that verification is usually undecidable apart from bounded or otherwise restrictive settings. Most interestingly, we identify various factors that influence the (un-)decidability and provide grounds for future research on more promising constraints leading to decidable fragments.</summary>
    <dc:date>2012-05-02T23:00:00Z</dc:date>
  </entry>
  <entry>
    <title>A unified approach to network traffic and network security visualisation</title>
    <link rel="alternate" href="http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/517" />
    <author>
      <name>Read, Huw O.</name>
    </author>
    <author>
      <name>Blyth, Andrew J.</name>
    </author>
    <author>
      <name>Sutherland, Iain</name>
    </author>
    <id>http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/517</id>
    <updated>2012-05-02T12:06:55Z</updated>
    <published>2012-05-01T23:00:00Z</published>
    <summary type="text">Title: A unified approach to network traffic and network security visualisation
Authors: Read, Huw O.; Blyth, Andrew J.; Sutherland, Iain
Abstract: In this paper we present an architecture which enables data-sharing between computer security and network traffic visualisation tools. At its core is a middleware which manages all interactions. This enables one application to determine the acceptable input for another, and send compatible data. The middleware sits atop a unified database which provides data in a generic form to the applications. Interesting traffic patterns or attack trends seen in one tool can be sent directly to another for further examination and analysis. All communication in the middleware is performed using XML as a data transport mechanism.</summary>
    <dc:date>2012-05-01T23:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Expressing properties of resource-bounded systems: the Logics RTL* and RTL</title>
    <link rel="alternate" href="http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/516" />
    <author>
      <name>Muller, Berndt</name>
    </author>
    <id>http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/516</id>
    <updated>2012-05-02T11:58:57Z</updated>
    <published>2012-05-01T23:00:00Z</published>
    <summary type="text">Title: Expressing properties of resource-bounded systems: the Logics RTL* and RTL
Authors: Muller, Berndt
Abstract: Computation systems and logics for modelling such systems have been studied to a great extent in the past decades. This paper introduces resources into the models of systems and discusses the Resource-Bounded Tree Logics RTL and RTL*, based on the well-known Computation Tree Logics CTL and CTL*, for reasoning about computations of such systems. We present initial results on the complexity/decidability of model checking.</summary>
    <dc:date>2012-05-01T23:00:00Z</dc:date>
  </entry>
  <entry>
    <title>Defining High-Level Signatures Using the Footprint Mark-up Language (FTML)</title>
    <link rel="alternate" href="http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/512" />
    <author>
      <name>Blyth, Andrew J.</name>
    </author>
    <id>http://dspace1.isd.glam.ac.uk:80/dspace/handle/10265/512</id>
    <updated>2012-05-02T10:41:01Z</updated>
    <published>2012-05-01T23:00:00Z</published>
    <summary type="text">Title: Defining High-Level Signatures Using the Footprint Mark-up Language (FTML)
Authors: Blyth, Andrew J.
Abstract: The computer misuse model of intrusion detection focuses upon single events, and attempts to extrapolate from this starting point to identify an attack. It has long been understood that computer intrusions are multifaceted complex entities that evolve over time. Current applications of the computer misuse model are narrow and lack depth when applied to the analysis of complex attacks that cannot be understood simply by examining packets in an isolated fashion without regards of the general context in which they occur. In this paper, a mark-up language that draws upon the state transition model of signatures is presented and extends it in allowing us to express complex and evolving attacks using the concept of a footprint.</summary>
    <dc:date>2012-05-01T23:00:00Z</dc:date>
  </entry>
</feed>

