Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
Abstract. We revisit the classical notion of noninterference for statebased systems, as presented by Rushby in 1992. We strengthen his results in several ways, in particular clarif...
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
We consider an extension of integer linear arithmetic with a "star" operator takes closure under vector addition of the solution set of a linear arithmetic subformula. We...