The aim of this article is to revisit Dalal’s operator for belief revision. Dalal has proposed a technique for revising belief bases based on the minimization of a distance betw...
We apply static analysis and symbolic interpretation techniques to reverse engineer the semantics of legacy assembler code. We examine the case of IBM-1800 programs in detail. Fro...
A symbolic semantics for Full LOTOS in terms of symbolic transition systems is de ned, following the approach taken for message passing CCS in HL95a], altered to take account of th...
In this paper we give a symbolic concurrent semantics for network of timed automata (NTA) in terms of extended symbolic nets. Extended symbolic nets are standard occurrence nets ex...
Abstract We revisit the classical QuickSort and QuickSelect algorithms, under a complexity model that fully takes into account the elementary comparisons between symbols composing ...