We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
d abstract) Sam Staton Computer Laboratory, University of Cambridge Abstract. A labelled transition system can be understood as a coalgebra for a particular endofunctor on the cate...
Abstract. We present a software tool platform which facilitates security and performance analysis of systems which starts and ends with UML model descriptions. A UML project is pre...
Mikael Buchholtz, Stephen Gilmore, Valentin Haenel...
Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwar...
In this paper we show how Rate Transition Systems (RTSs) can be used as a unifying framework for the definition of the semantics of stochastic process algebras. RTSs facilitate the...
Rocco De Nicola, Diego Latella, Michele Loreti, Mi...