Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Pointer analysis statically approximates the heap pointer structure during a program execution in order to track heap objects or to establish alias relations between references, a...
Lennart Beringer, Robert Grabowski, Martin Hofmann
A general framework for typing graph rewriting systems is presented: the idea is to statically derive a type graph from a given graph. In contrast to the original graph, the type g...
Abstract. We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the e ect of statically preventing certain communi...
Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secr...