In this paper we investigate how information surrogates might be useful in exploratory search and what information it is useful for a surrogate to contain. By comparing assessment...
Ian Ruthven, Mark Baillie, Leif Azzopardi, Ralf Bi...
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Two types of simulations for weighted tree automata (wta) are considered. Wta process trees and assign a weight to each of them. The weights are taken from a semiring. The two type...
Abstract. We design a deadlock-free semantics for a concurrent, functional and imperative programming language where locks are implicitly and univocally associated with pointers. T...
This paper studies two families of codes over Z4, MacDonald codes of type α and type β. The torsion code, weight distribution, and Gray image properties are studied. Some intere...