Abstract. We look at some sources of insecurity and difficulty in reasoning about partially ordered runs of distributed ASMs, and propose some techniques to facilitate such reasoni...
This paper is devoted to the speci cation of the Stanford FLASHcache coherence protocol within the ASM formalism. Correctness proofs related to data consistency are presented. Corn...
This paper studies various properties of the least common ancestors mapping, the duplication and mutation costs, and the complexity of nding a species tree from gene trees.
Abstract. This paper provides a modular high-level design of the Common Language Runtime (CLR) architecture. Our design is given in terms act State Machines (ASMs) and takes the fo...
Astatistical theory of local alignmentalgorithms with gaps is presented. Both the linear and logarithmic phases, as well as the phase transition separating the two phases, are des...