Most automatic expression analysis systems attempt to recognize a small set of prototypic expressions (e.g. happiness and anger). Such prototypic expressions, however, occur infre...
In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed auThis technique refines commonly-used ...
Consensus is one of the most fundamental problems in fault-tolerant distributed computing. This paper proposes a mechanical method for analyzing the condition that allows one to s...
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
This paper advocates a strict compositional and hybrid approach for obtaining key (performance) metrics of embedded At its core the developed methodology abstracts system componen...