Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level language...
Jan Schwinghammer, Lars Birkedal, Bernhard Reus, H...
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...
Abstract. One-counter processes are pushdown processes over a singleton stack alphabet (plus a stack-bottom symbol). We study the problems of model checking asynchronous products o...
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
We define an “enriched effect calculus” by extending a type theory for computational effects with primitives from linear logic. The new calculus, which generalises intuitionis...
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
We analyse the computational complexity of finding Nash equilibria in stochastic multiplayer games with ω-regular objectives.While the existence of an equilibrium whose payoff fal...
Abstract. We define an abstract pebble game that provides game interpretations for essentially all known consistency algorithms for constraint satisfaction problems including arc-...