4047 search results - page 81 / 810 » Some Properties and Some Problems on Set Functors |
CONCUR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
TPHOL
2003
IEEE
15 years 5 months ago
2003
IEEE
Coverage checking is the problem of deciding whether any closed term of a given type is an instance of at least one of a given set of patterns. It can be used to verify if a functi...
RSCTC
2004
Springer
15 years 5 months ago
2004
Springer
We study properties of infomorphisms between information systems. In particular, we interpret infomorphisms between information systems in terms of sums with constraints (constrain...
112
click to vote
CP
2011
Springer
13 years 11 months ago
2011
Springer
We introduce tractable classes of VCSP instances based on convex cost functions. Firstly, we show that the class of VCSP instances satisfying the hierarchically nested convexity pr...
CAISE
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The translation of information between heterogeneous representations is a long standing issue. With the large spreading of cooperative applications fostered by the advent...