Abstract. This paper introduces simulatable verifiable random functions (sVRF). VRFs are similar to pseudorandom functions, except that they are also verifiable: corresponding to...
Abstract. This paper adopts an interdisciplinary view of the significant elements of ecosystems and the methods by which these might be simulated to explore theoretical issues of r...
Abstract. Innermost context-sensitive rewriting has been proved useful for modeling computations of programs of algebraic languages like Maude, OBJ, etc. Furthermore, innermost ter...
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Abstract. This tutorial explores the design space of heterogeneous synchronization, which is concerned with establishing consistency among artifacts that conform to different sche...