Sciweavers

39039 search results - page 32 / 7808
» Implementation of the
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
13 years 7 months ago
Proving Approximate Implementations for Probabilistic I/O Automata
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...
Sayan Mitra, Nancy A. Lynch
ENTCS
2007
104views more  ENTCS 2007»
13 years 7 months ago
Implementing a Distributed Mobile Calculus Using the IMC Framework
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,...
TC
2008
13 years 7 months ago
Implementing Synchronous Models on Loosely Time Triggered Architectures
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...
ESE
2002
114views Database» more  ESE 2002»
13 years 7 months ago
An Industrial Case Study to Examine a Non-Traditional Inspection Implementation for Requirements Specifications
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...
Oliver Laitenberger, Thomas Beil, Thilo Schwinn
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 7 months ago
A Systematic Study of Functional Language Implementations
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...
Rémi Douence, Pascal Fradet