128
Voted
MEMOCODE
2008
IEEE
15 years 7 months ago
2008
IEEE
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
118
click to vote
CIE
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. If L is a finite relational language then all computable Lstructures can be effectively enumerated in a sequence {An}n∈ω in such a way that for every computable L-st...
105
Voted
PEPM
2010
ACM
15 years 10 months ago
2010
ACM
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
81
Voted
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We present a method for merging multiple partitions into a single partition, by minimising the ratio of pairwise agreements and contradictions between the equivalence relations cor...