Analyses for possible variable sharing and de nite freeness are important both in the automatic parallelisation and in the optimisation of sequential logic programs In this paper a new e cient approach to analysis is described which can infer sharing and freeness information to an unusually high degree of accuracy The analysis exploits a con uence property of the uni cation algorithm to split t...

In this paper, abstract interpretation algorithms are described for computing the sharmg as well as the freeness information about the run-time instantiations of program variables. An abstract domain is proposed which accurately and concisely represents combined freeness and sharing information for program variables. Abstract unification and all other domain-specific functions for an abstract i...

We study structural restrictions on biautomata such as, e.g., acyclicity, permutation-freeness, strongly permutation-freeness, and orderability, to mention a few. We compare the obtained language families with those induced by deterministic finite automata with the same property. In some cases, it is shown that there is no difference in characterization between deterministic finite automata and...

In this paper, we propose a new electronic voting scheme which guarantees receipt-freeness as well as privacy, universal veriiability and robustness. The result of Cramer, Gennaro, and SchoenmarkerssCGS97] proposed at Eurocrypt'97 seems to be promising because it provides optimal performance , privacy, robustness, and universal veriiability. But in their scheme, receipt-freeness was left as an ...

Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness guarantees the stress freeness. More generally, we prove that every Kr+2-minor free graph is generically r-stress free for 1 ≤ r ≤ 4. (This assertion is false for r ≥ 6.) Some further extensions are discussed.

We study property testing in the context of distributed computing, under the classical CONGEST model. It is known that testing whether a graph is triangle-free can be done in a constant number of rounds, where the constant depends on how far the input graph is from being triangle-free. We show that, for every connected 4-node graph H , testing whether a graph is H-free can be done in a constant...

To Philippe Biane, for his 55th birthday. CONTENTS 1. Introduction 2 1.1. Asymptotic representation theory 2 1.2. Connection with RMT 3 1.3. Biane-Perelomov-Popov quantization 4 1.4. The semiclassical limit 6 1.5. Mean values and asymptotic freeness 6 1.6. Proof strategy 8 1.7. Higher correlators and higher order freeness 9 2.

We study the freeness problem for matrix semigroups. We show that the freeness problem is decidable for upper-triangular 2 × 2 matrices with rational entries when the products are restricted to certain bounded languages. We also show that this problem becomes undecidable for sufficiently large matrices.

We formally study two privacy-type properties for e-auction protocols: bidding-price-secrecy and receipt-freeness. These properties are formalised as observational equivalences in the applied pi calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. Bidding-price-secrecy of the protocol is verified using the automatic verifier ProVerif, whereas receipt-freeness of the protoco...