We present a new formalization of the algebraic hierarchy in Coq, exploiting its new type class mechanism to make practical a solution formerly thought infeasible. Our approach add...
Traces Kuntal Nanshi, Fabio Somenzi University of Colorado at Boulder ne abstraction refinement and simulation to provide a more efficient approach to checking invariant properti...
Dynamic programming algorithms have been successfully applied to propositional stochastic planning problems by using compact representations, in particular algebraic decision diag...
Abstract. We consider two systems of constructive modal logic which are computationally motivated. Their modalities admit several computational interpretations and are used to capt...
Natasha Alechina, Michael Mendler, Valeria de Paiv...
The development of data warehouses is based on a threestage process that starts specifying both the static and dynamic properties of on-line analytical processing (OLAP) applicati...