• Seven abstraction rules preserving generalised nonblocking

    Malik, Robi; Leduc, Ryan (University of Waikato, Department of Computer Science, 2009-09-01)
    This working paper proposes a compositional approach to verify the generalised nonblocking property of discrete-event systems. Generalised nonblocking is introduced in [15] to overcome weaknesses of the standard nonblocking ...
  • Linear-time graph triples census algorithm under assumptions typical of social networks

    McEnnis, Daniel (University of Waikato, Department of Computer Science, 2009-08-20)
    A graph triples census is a histogram of all possible sets of three vertici (called a triple) from a graph. Graph triples census have been in active use in sociology for over 50 years. The earliest paper using this approach ...
  • MIR task and evaluation techniques

    McEnnis, Daniel (University of Waikato, Department of Computer Science, 2009-08-12)
    Existing tasks in MIREX have traditionally focused on low-level MIR tasks working with flat (usually DSP-only) ground-truth. These evaluation techniques, however, can not evaluate the increasing number of algorithms that ...
  • Graph-RAT programming environment

    McEnnis, Daniel (University of Waikato, Department of Computer Science, 2009-08-12)
    Graph-RAT is a new programming environment specializing in relational data mining. It incorporates a number of different techniques into a single framework for data collection, data cleaning, propositionalization, and ...
  • A robust semantics hides fewer errors

    Reeves, Steve; Streader, David (University of Waikato, Department of Computer Science, 2009-06-10)
    In this paper we explore how formal models are interpreted and to what degree meaning is captured in the formal semantics and to what degree it remains in the informal interpretation of the semantics. By applying a robust ...
  • Guarded operations, refinement and simulation

    Reeves, Steve; Streader, David (University of Waikato, Department of Computer Science, 2009-06-10)
    Simulation rules have long been used as an effective computational means to decide refinement relations in state-based formalisms. Here we investigate how they might be amended so as to decide the event-based notion of ...
  • A semantics and implementation of a causal logic programming language

    Cleary, John G.; Utting, Mark; Clayton, Roger (University of Waikato, Department of Computer Science, 2009-02-11)
    The increasingly widespread availability of multicore and manycore computers demands new programming languages that make parallel programming dramatically easier and less error prone. This paper describes a semantics for ...

View more