In this work we present a new sampling-based “black box” inference approach for learning the behaviors of a library component. As an application, we focus on the problem of automatically learning commutativity specifications of data structures. This is a very challenging problem, yet important, as commutativity specifications are fundamental to program analysis, concurrency control and even low...

We show, using the no–disentanglement theorem, that to teleport (exactly) any set of non–commuting states (i.e., a set containing at least two non–commuting states), it is necessary to have an entangled channel. We further show that to teleport any set of commuting states it is sufficient to have a classically correlated channel. Using this result we provide a simple proof of the fact that any ...

We give a simple characterization for a nonassociative algebra A, having characteristic 6= 2, to be commutative. Namely, A is commutative if and only if it is exible with a commuting set of generators. A counterexample shows that characteristic 6= 2 is necessary. Both the characterization and the counterexample were discovered using the computer algebra system in [2].

We consider the following condition (*) on an associative ring R : (*). There exists a function f from R into R such that f is a group homomorphism of (R,+), f is injective on R2, and f(xy) = (xy)n(x,y) for some positive integer n(x,y) > 1. Commutativity and structure are established for Artinian rings R satisfying (*), and a counterexample is given for nonArtinian rings. The results generalize...