Sciweavers

262 search results - page 5 / 53
» State Space Reduction Techniques for Component Interfaces
Sort
View
SODA
2000
ACM
127views Algorithms» more  SODA 2000»
13 years 8 months ago
Dimensionality reduction techniques for proximity problems
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
Piotr Indyk
FSTTCS
1998
Springer
13 years 11 months ago
Partial Order Reductions for Bisimulation Checking
Partial order methods have been introduced to avoid the state explosion problem in veri cation resulting from the representation of multiple interleavings of concurrent transitions...
Michaela Huhn, Peter Niebert, Heike Wehrheim
TOPNOC
2010
13 years 2 months ago
Search-Order Independent State Caching
Abstract. State caching is a memory reduction technique used by model checkers to alleviate the state explosion problem. It has traditionally been coupled with a depth-first search...
Sami Evangelista, Lars Michael Kristensen
SAC
2010
ACM
14 years 2 months ago
Extraction of component-environment interaction model using state space traversal
Scalability of software engineering methods can be improved by application of the methods to individual components instead of complete systems. This is, however, possible only if ...
Pavel Parizek, Nodir Yuldashev
ENTCS
2010
127views more  ENTCS 2010»
13 years 7 months ago
Action Prefixes: Reified Synchronization Paths in Minimal Component Interaction Automata
Component Interaction Automata provide a fitting model to capture and analyze the temporal facets of hierarchical-structured component-oriented software systems. However, the rule...
Markus Lumpe