Learn More
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)
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)
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)
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)
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)
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)