777 search results - page 146 / 156 » Model Checking with Formula-Dependent Abstract Models |
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. We present an in-depth discussion of the relationships between synchrony and asynchrony. Simple models of both paradigms are presented, and we state theorems which guaran...
LICS
1998
IEEE
13 years 11 months ago
1998
IEEE
d abstract) T. Eiter G. Gottlob Y. Gurevich Institut fur Informatik Institut fur Informationssysteme EECS Department Universitat Gie en Technische Universitat Wien University of Mi...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
FASE
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We present a novel algorithm for interface generation of software components. Given a component, our algorithm uses learning techniques to compute a permissive interface ...
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. State space explosion is the hardest challenge to the effective application of model checking methods. We present a new technique for achieving drastic state space reduct...