Abstract. We produce counterexamples to the unique and cofinal branches hypotheses, assuming (slightly less than) the existence of a cardinal which is strong past a Woodin cardinal...
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tom&...
Abstract. We present a new open source model checker, opaal, for automatic verification of models using lattice automata. Lattice automata allow the users to incorporate abstracti...
Abstract--In the Relational Reinforcement learning framework, we propose an algorithm that learns an action model allowing to predict the resulting state of each action in any give...
Abstract—We present an approach to support the debugging of stochastic system models using interactive visualization. The goal of this work is to facilitate the identification o...