We investigate the construction of linear operators representing the semantics of probabilistic programming languages expressed via probabilistic transition systems. Finite transi...
We deal with temporal aspects of distributed systems, introducing and studying a new model called timed distributed -calculus. This model extends distributed -calculus with timers...
Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse existing progra...
In previous work we proposed Linear Programs as a fine grained model for imperative programs, and showed how the model checking procedure used in SLAM can be generalised to a mode...
We refine our algebraic axiomatization in [8,9] of epistemic actions and epistemic update (notions defined in [5,6] using Kripke-style semantics), to incorporate a mechanism for d...