#### Filter Results:

- Full text PDF available (112)

#### Publication Year

1991

2017

- This year (2)
- Last 5 years (33)
- Last 10 years (69)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Brain Region

#### Cell Type

#### Key Phrases

#### Organism

Learn More

- Florence Benoy, Andy King
- LOPSTR
- 1996

Argument size relationships are useful in termination analysis which, in turn, is important in program synthesis and goal-replacement transformations. We show how a precise analysis for inter-argument size relationships, formulated in terms of abstract interpretation, can be implemented straightforwardly in a language with constraint support like CLP(R) or… (More)

- Andy King, Harald Søndergaard
- VMCAI
- 2010

One approach to verifying bit-twiddling algorithms is to derive invariants between the bits that constitute the variables of a program. Such invariants can often be described with systems of congruences where in each equation c · x = d mod m, m is a power of two, c is a vector of integer coefficients, and x is a vector of propositional variables (bits).… (More)

- Jörg Brauer, Andy King
- SAS
- 2010

Traditionally, transfer functions have been manually designed for each operation in a program. Recently, however, there has been growing interest in computing transfer functions, motivated by the desire to reason about sequences of operations that constitute basic blocks. This paper focuses on deriving transfer functions for intervals — possibly the most… (More)

- Andy King, Paul Soper
- JICSLP
- 1992

- Andy King
- ESOP
- 1994

Accurate variable sharing information is crucial both in the automatic parallelisation and in the optimisation of sequential logic programs. Analysis for possible variable sharing is thus an important topic in logic programming and many analyses have been proposed for inferring dependencies between the variables of a program, for instance, by combining… (More)

- Axel Simon, Andy King, Jacob M. Howe
- LOPSTR
- 2002

Domain Axel Simon Andy King Jacob M. Howe Computing Laboratory, Department of Computing, University of Kent, Canterbury, UK. City University, London, UK. {a.m.king, a.simon}@ukc.ac.uk jacob@soi.city.ac.uk Abstract. This paper explores the spatial domain of sets of inequalities where each inequality contains at most two variables – a domain that is richer… (More)

- Charalampos Tsoumpas, Claudius M. Bürger, +7 authors Paul K. Marsden
- Physics in medicine and biology
- 2011

We have implemented and evaluated a framework for simulating simultaneous dynamic PET-MR data using the anatomic and dynamic information from real MR acquisitions. PET radiotracer distribution is simulated by assigning typical FDG uptake values to segmented MR images with manually inserted additional virtual lesions. PET projection data and images are… (More)

- Axel Simon, Andy King
- SAS
- 2007

Variables in programs are usually confined to a fixed number of bits and results that require more bits are truncated. Due to the use of 32-bit and 64-bit variables, inadvertent overflows are rare. However, a sound static analysis must reason about overflowing calculations and conversions between unsigned and signed integers; the latter remaining a common… (More)

- Axel Simon, Andy King
- SAS
- 2005

The intrinsic cost of polyhedra has lead to research on more tractable sub-classes of linear inequalities. Rather than committing to the precision of such a sub-class, this paper presents a projection algorithm that works directly on any sparse system of inequalities and which sacrifices precision only when necessary. The algorithm is based on a novel… (More)

- Jonathan C. Martin, Andy King
- TAPSOFT
- 1997