This paper extends for the first time semantic interpretation tools to infinite data in order to ensure Input/Output upper bounds on first order Haskell like programs on streams...
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
Magdalena Kacprzak, Alessio Lomuscio, Wojciech Pen...
Recent years have seen a proliferation of 3-valued or capturing abstractions of systems, since these enable verifying both universal and existential properties. Reasoning about suc...
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
In this paper we discuss extensions to the conventional relatronal algebra to support transaction time We show that these extensions are applicable to hrstorlcal algebras that sup...