Reuben N. S. Rowe

Learn More
We investigate the *model checking* problem for symbolic-heap separation logic with user-defined inductive predicates, i.e., the problem of checking that a given stack-heap memory state satisfies a given formula in this language, as arises e.g. in software testing or runtime verification. First, we show that the problem is *decidable*; specifically, we(More)
We apply the principles of the intersection type discipline to the study of class-based object oriented programs and; our work follows from a similar approach (in the context of Abadi and Cardelli's &sigmaf;-object calculus) taken by van Bakel and de'Liguoro. We define an extension of Featherweight Java, <i>p</i>FJ, and present a <i>predicate</i> system(More)
We consider a semantics for a class-based object-oriented calculus based upon approximation; since in the context of lc such a semantics enjoys a strong correspondence with intersection type assignment systems, we also define such a system for our calculus and show that it is sound and complete. We establish the link with between type (we use the(More)
We describe a formal verification framework and tool implementation, based upon cyclic proofs, for certifying the safe termination of imperative pointer programs with recursive procedures. Our assertions are <em>symbolic heaps</em> in separation logic with user defined inductive predicates; we employ <em>explicit approximations</em> of these predicates as(More)
We investigate semantics-based type assignment for class-based object-oriented programming. Our motivation is developing a theoretical basis for practical, expressive, type-based analysis of the functional behaviour of object-oriented programs. We focus our research using Featherweight Java, studying two notions of type assignment:one using intersection(More)
The effects of acetaldehyde concentration (0, 0.025, 0.05, 0.1, 0.2,0.3, 0.4 or 0.5%) in solution on the vase life and ethylene productionoftwo carnation (Dianthus caryophyllus L.) cultivarscontrasting in vase life (Sandrosa (long lasting) and Yellow Candy (shortlasting)) were studied. In Sandrosa, acetaldehyde solution (0.05%)increased the vase life by 3(More)
A cyclic proof system generalises the standard notion of a proof as a finite tree of locally sound inferences by allowing proof objects to be potentially infinite. Regular infinite proofs can be finitely represented as graphs. To preclude spurious cyclic reasoning, cyclic proof systems come equipped with a well-founded notion of ‘size’ for the models that(More)
We consider a semantics for a class-based object-oriented calculus based upon approximation; since in the context of LC such a semantics enjoys a strong correspondence with intersection type assignment systems, we also define such a system for our calculus and show that it is sound and complete. We establish the link with between type (we use the(More)
We consider semantics for the class-based object-oriented calculus Featherweight Java (without casts) based upon<lb>approximation. We also define an intersection type assignment system for this calculus and show that it satisfies subject<lb>reduction and expansion, i.e. types are preserved under reduction and its converse. We establish a link between(More)