Sciweavers

6167 search results - page 149 / 1234
» Can Refinement be Automated
Sort
View
AIPS
1994
15 years 5 months ago
Adapting Routines to Improve Task Coordination
Humanagents typically evolve a set of standard routines for carrying out often-repeated tasks. These routines effectively compile knowledgeabout howto carry out sets of interactin...
Michael Freed, Gregg Collins
IJFCS
2006
94views more  IJFCS 2006»
15 years 4 months ago
Conflicts and Fair Testing
This paper studies conflicts from a process-algebraic point of view and shows how they are related to the testing theory of fair testing. Conflicts have been introduced in the con...
Robi Malik, David Streader, Steve Reeves
TCS
2008
15 years 4 months ago
Anisotropic diagrams: Labelle Shewchuk approach revisited
F. Labelle and J. Shewchuk [3] have proposed a discrete definition of anisotropic Voronoi diagrams. These diagrams are parametrized by a metric field. Under mild hypotheses on the...
Jean-Daniel Boissonnat, Camille Wormser, Mariette ...
FORMATS
2010
Springer
15 years 2 months ago
A Framework for Verification of Software with Time and Probabilities
Abstract. Quantitative verification techniques are able to establish system properties such as "the probability of an airbag failing to deploy on demand" or "the exp...
Marta Z. Kwiatkowska, Gethin Norman, David Parker
MEMOCODE
2010
IEEE
15 years 2 months ago
LTSs for translation validation of (multi-clocked) SIGNAL specifications
Design of critical embedded systems demands for guarantees on the reliability of the implementation/compilation of a specification. In general, this guarantee takes either the form...
Julio C. Peralta, Thierry Gautier, Loïc Besna...