Sciweavers

1302 search results - page 1 / 261
» Fair Equivalence Relations
Sort
View
BIRTHDAY
2003
Springer
13 years 9 months ago
Fair Equivalence Relations
Equivalence between designs is a fundamental notion in verification. The linear and branching approaches to verification induce different notions of equivalence. When the designs...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
BIRTHDAY
2003
Springer
13 years 9 months ago
Bounded Fairness
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
Nachum Dershowitz, D. N. Jayasimha, Seungjoon Park
DIS
2007
Springer
13 years 10 months ago
Unsupervised Spam Detection Based on String Alienness Measures
We propose an unsupervised method for detecting spam documents from Web page data, based on equivalence relations on strings. We propose 3 measures for quantifying the alienness (...
Kazuyuki Narisawa, Hideo Bannai, Kohei Hatano, Mas...
IJFCS
2006
94views more  IJFCS 2006»
13 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
SAS
2000
Springer
13 years 8 months ago
Tree Schemata and Fair Termination
We present a new representation for possibly infinite sets of possibly infinite trees. This representation makes extensive use of sharing to achieve efficiency. As much as possible...
Laurent Mauborgne