To understand the effect of code complexity on static analysis, thirty-five format string vulnerabilities were selected from the National Vulnerability Database. We analyzed two sets of code for each vulnerability. The first set of code contained the vulnerability, while the second was a later version of the code in which the vulnerability had been fixed. We examined the effect of both code com...

This paper discusses how to construct a legal ontology using a general ontology that has already been developed and a case ontology that has been automatically constructed on the basis of precedent cases input by the user. In order to construct a legal ontology, we consider to nd out the best correspondence to given a legal concept in a general ontology and a case ontology. Furthermore, we conc...

We propose a new space–time coding scheme for the quasi-static multiple-antenna channel with perfect channel state information at the receiver and no channel state information at the transmitter. In our scheme, codewords produced by a trellis encoder are formatted into space–time codeword arrays such that decoding can be implemented efficiently by minimum mean-square error (MMSE) decision–feedb...

In this paper we study the strengths and limitations of collaborative teams of simple agents. In particular, we discuss the efficient use of “ant robots” for covering a connected region on the Z grid, whose area is unknown in advance, and which expands at a given rate, where n is the initial size of the connected region. We show that regardless of the algorithm used, and the robots’ hardware an...

Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that can both be checked and computed in polynomial time. In this paper we develop a static analysis in relational form which substantially improves the precision of the results obtained while being able to deal with the fu...

In this paper a single-cycle issue queue circuit architecture that simplifies the wakeup and selection logic is proposed. The micro-architecture and fully static CMOS circuits are presented for a 32-entry queue that issues four instructions per cycle. The instruction-ready signals are divided into groups and processed in parallel to issue the four oldest ready instructions. The complete issue q...

A fitness landscape is a genetic space – with two genotypes adjacent if they differ in a single locus – and a fitness function. Evolutionary dynamics produce a flow on this landscape from lower fitness to higher; reaching equilibrium only if a local fitness peak is found. I use computational complexity to question the common assumption that evolution on static fitness landscapes can quickly rea...

Flow Logic is an approach to the static analysis of programs that has been developed for functional, imperative and objectoriented programming languages and for concurrent, distributed, mobile and cryptographic process calculi. In this paper we extend it to deal with modal logics and prove that it can give an exact characterisation of the semantics of formulae in a modal logic. This shows that ...