This article demonstrates how a powerful and expressive ion from concurrency theory--monads of resumptions--plays a dual r^ole as a programming tool for concurrent applications. Th...
Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a pr...
Abstract. Symmetry reduced model checking is hindered by two problems: how to identify state space symmetry when systems are not fully symmetric, and how to determine equivalence o...
Algebraization of computational logics in the theory of fork algebras has been a research topic for a while. This research allowed us to interpret classical first-order logic, seve...
We present DO-Casl, a new member of the CASL family of specification languages. It is an extension of Casl-Ltl and it supports a methodology for conveniently writing loose specific...