323 search results - page 24 / 65 » Verify Your Runs |
CAV
1994
Springer
13 years 11 months ago
1994
Springer
Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are P-complete and hence it may not be possible to design ...
ICIW
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract-- Maintaining large websites and verifying their semantic content is a difficult task. In this paper we propose a framework for syntactic validation, semantic verification...
WSC
1997
13 years 8 months ago
1997
This paper describes a general framework for the modeling, design, simulation, and prototyping of large scale systems. The framework uses a coherent set of tools that model the sy...
TPDS
1998
13 years 7 months ago
1998
—Relational Coarsest Partition Problems (RCPPs) play a vital role in verifying concurrent systems. It is known that RCPPs are 3-complete and hence it may not be possible to desig...
JMLR
2010
13 years 2 months ago
2010
Hartigan's method for k-means clustering is the following greedy heuristic: select a point, and optimally reassign it. This paper develops two other formulations of the heuri...