4460 search results - page 486 / 892 » Formal methods for interactive systems |
137
Voted
CALCO
2005
Springer
16 years 9 days ago
2005
Springer
In the specific situation of formal reasoning concerned with “regular expression equivalence” we address instances of more general questions such as: how can coinductive argum...
192
click to vote
CCS
2005
ACM
16 years 9 days ago
2005
ACM
We provide an effective procedure for deciding the existence of off-line guessing attacks on security protocols, for a bounded number of sessions. The procedure consists of a co...
174
click to vote
FMCAD
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on th...
164
click to vote
FORMATS
2004
Springer
16 years 5 days ago
2004
Springer
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
211
click to vote
CAV
2003
Springer
16 years 7 hour ago
2003
Springer
We consider the problem of synthesizing controllers for timed systems modeled using timed automata. The point of departure from earlier work is that we consider controllers that ha...