This paper presents behavior contracts as a new assertion mechanism and a tool that uses such contracts to support the testing of Object-Oriented (OO) systems. A behavior contract...
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...
In this paper we discuss how the concept of ontology can be beneficial for the authoring support of Web-based educational systems (WBES). We take a semantic perspective on the know...
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
Marta Z. Kwiatkowska, Gethin Norman, David Parker,...
Abstract. Symbolic Trajectory Evaluation (STE) is a powerful technique for hardware model checking. It is based on a 3-valued symbolic simulation, using 0,1 and X n"), where t...