We describe an approach to logic programming where the execution of a pure logic program is ordered on “temporal” values in the program. The resulting programs are relational and avoid a premature commitment to data structures. This is a strong advantage in a programming language. We present the programming language Starlog as an example of this approach and give a summary of its denotational a...

Many current approaches to statistical language modeling rely on independence a.~sumptions 1)etween the different explanatory variables. This results in models which are computationally simple, but which only model the main effects of the explanatory variables oil the response variable. This paper presents an argmnent in favor of a statistical approach that also models the interactions between ...

This article traces the unstable semantics of use cases from Jacobson to UML 1.3. The UML 1.1 metamodel formally defined the «uses» and «extends» use case relationships as stereotypes of generalisation, yet both received interpretations that varied between inheritance and composition, reflecting a large degree of confusion among developers. The recently revised UML 1.3 has quietly dropped these...

This report describes the development and use of an online teaching tool giving students exercises in logical modelling, or formalisation as it is called in the older literature. The original version of the site, ‘Logic for Fun’, dates from 2001, though it was little used except by small groups of students at the Australian National University. It is currently in the process of being replaced b...

We present practical poisoning and name-server blocking attacks on standard DNS resolvers, by off-path, spoofing adversaries. Our attacks exploit large DNS responses that cause IP fragmentation; such long responses are increasingly common, mainly due to the use of DNSSEC. In common scenarios, where DNSSEC is partially or incorrectly deployed, our poisoning attacks allow ‘complete’ domain hijack...