Identity of Euprymna berryi Sasaki, 1929 (Cephalopoda : Sepiolidae)

As the results of critical observations on fashion of arm sucker enlargement, morphology of tentacular suckers and bodily and spermatophoric proportions, it was concluded that the genus Euprymna in the Japanese waters contains two sympatric species, E. morsei (Verrill, 1888) and E. berryi Sasaki, 1929

A Fully Abstract Denotational Model for Communicating Processes with Label-Passing

This paper investigates the full abstractness problem for a CCS-like language, $\mathrm{C}\mathrm{C}\mathrm{S}^{++}$, with a label-passing mechanism. (Here labels are used as the names of communication channels through which interactions between processes take place.) This language is essentially the same as the one proposed by Astesiano et al.; it is an extension of full CCS of Milner and contains label-passing– an important feature of $\pi$-calculus of Milner et al. – in addition to the traditional CCS constructs: $inp\mathrm{u}\iota_{s}$ , ou$tp\mathrm{u}ts$ , parallel composition, nondeterministic choice, action restriction, and recursion. First an operational model $O$ , called the weak maximal linear semantics, is defined in terms of a Plotkin-style transition system; $\mathrm{O}$ serves as a behavioral criterion for assessing semantic models for $\mathrm{C}\mathrm{C}\mathrm{S}++$. Then a denotational model $D$ is constructed on the basis of a complete partial order $(\mathrm{c}\mathrm{p}\mathrm{o})$ and it is shown that $D$ is fffiy abstract with respect to $O$ in the sense that $D$ is the most abstract of those models which are less abstract than $\mathrm{O}$ and compositional. The full $\mathrm{a}\mathrm{b}_{\mathrm{S}}\mathrm{t}\mathrm{r}\mathrm{a}\mathrm{C}\mathrm{t}\mathrm{n}\mathrm{e}\mathrm{s}8$ result means that $D$ is the most desirable (or optimal) semantic model $\mathrm{h}\mathrm{o}\mathrm{m}$ the practical viewpoint embodied by $O$

Proving Properties of Incremental Merkle Trees

This paper proves two basic properties of the model of a single attack point-free event ordering system, developed by NTT. This model is based on an incremental construction of Merkle trees, and we show the correctness of (1) completion and (2) an incremental sanity check. These are mainly proved using the theorem prover MONA; especially, this paper gives the first proof of the correctness of the incremental sanity check

Proving Properties of Incremental Merkle Trees

Abstract. This paper proves two basic properties of the model of a single attack point-free event ordering system, developed by NTT. This model is based on an incremental construction of Merkle trees, and we show the correctness of (1) completion and (2) an incremental sanity check. These are mainly proved using the theorem prover MONA; especially, this paper gives the first proof of the correctness of the incremental sanity check