Sciweavers

4299 search results - page 382 / 860
» Concurrent Test Generation
Sort
View
CONCUR
2000
Springer
15 years 8 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
AIIA
1995
Springer
15 years 8 months ago
Formalizing Reasoning About Change: A Temporal Diagnosis Approach
In this paper we describe a framework for reasoning about temporal explanation problems, which is based on our previous work on model-based diagnosis of dynamic systems. We use an ...
Johann Gamper, Wolfgang Nejdl
140
Voted
ESEC
1995
Springer
15 years 8 months ago
An Exploratory Study of Program Metrics as Predictors of Reachability Analysis Performance
This paper presents the results of an exploratory experiment investigating the use of program metrics to predict reachability graph size, reachability graph generation time, and d...
A. T. Chamillard
GRAPHICSINTERFACE
2007
15 years 6 months ago
Optimized tile-based texture synthesis
One significant problem in tile-based texture synthesis is the presence of conspicuous seams in the tiles. The reason is that the sample patches employed as primary patterns of t...
Weiming Dong, Ning Zhou, Jean-Claude Paul
CASCON
2004
110views Education» more  CASCON 2004»
15 years 6 months ago
Investigations in tree locking for compiled database applications
We report on initial experiments in tree locking schemes for compiled database applications. Such applications have a repository style of architecture in which a collection of sof...
Heng Yu, Grant E. Weddell