In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task str...
In the last decade, many calculi for modelling distributed mobile code have been proposed. To assess their merits and encourage use, implementations of the calculi have often been...
Lorenzo Bettini, Rocco De Nicola, Daniele Falassi,...
Synchronous systems offer clean semantics and an easy verification path at the expense of often inefficient implementations. Capturing design specifications as synchronous models a...
Stavros Tripakis, Claudio Pinello, Albert Benvenis...
Software inspection is one of the key enablers for quality improvement and defect cost reduction. Although its benefits are shown in many studies, a major obstacle to implement an...
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...