831 search results - page 140 / 167 » Coalgebraic Correspondence Theory |
FAC
2010
14 years 9 months ago
2010
Inspired by the properties of the refinement development of the Mondex Electronic Purse, we view an isolated atomic action as a family of transitions with a common before-state, an...
115
Voted
TCS
2011
14 years 6 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
142
click to vote
COMPGEOM
2011
ACM
14 years 3 months ago
2011
ACM
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
129
click to vote
NETWORKS
2011
14 years 2 months ago
2011
A graph is terminal ∆ − Y -reducible if, it can be reduced to a distinguished set of terminal vertices by a sequence of series-parallel reductions and ∆−Y -transformations...
156
click to vote
PLPV
2011
ACM
14 years 2 months ago
2011
ACM
Soundness proofs of program logics such as Hoare logics and type systems are often made easier by decorating the operational semantics with information that is useful in the proof...