Human operators use mental models to guide their interaction with automated systems. We can “model the human” by constructing explicit descriptions of plausible mental models. Using mechanized formal methods, we can then calculate divergences between the actual system behavior and that suggested by the mental model. These divergences indicate possible automation surprises and other human factor...

We introduce the notion of array-based system as a suitable abstraction of infinite state systems such as broadcast protocols or sorting programs. By using a class of quantified-first order formulae to symbolically represent array-based systems, we propose methods to check safety (invariance) and liveness (recurrence) properties on top of Satisfiability Modulo Theories solvers. We find hypothes...

Human operators use mental models to guide their interaction with automated systems. We can “model the human” by constructing explicit descriptions of plausible mental models. Using mechanized formal methods, we can then calculate divergences between the actual system behavior and that suggested by the mental model. These divergences indicate possible automation surprises and other human factor...

In this paper, we show how a system for automated deduction can be given computational reeection, i.e. can aaect its own computation mechanism, by using the very same machinery implementing logical deduction. This feature, that we call computational reeection via mechanized logical deduction, provides both theoretical and practical advantages. First, the theorem prover can inspect, extend and m...

This paper describes optimization of the Takagi-Sugeno fuzzy model. To prove the existence of optimal control, we apply compactness of a set of membership functions in L space and continuity of approximate reasoning and show the existence of a pair of membership functions which minimize the quadratic performance function.