1167 search results - page 209 / 234 » A Really Temporal Logic |
CCS
2000
ACM
14 years 1 months ago
2000
ACM
We consider compositional properties of reactive systems that are secure in a cryptographic sense. We follow the wellknown simulatability approach, i.e., the specification is an ...
CONCUR
1999
Springer
14 years 29 days ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
IFM
1999
Springer
14 years 28 days ago
1999
Springer
The feature interaction problem is prominent in telephone service development. Through a number of case studies, we have discovered that no single semantic framework is suitable f...
SIGSOFT
1998
ACM
14 years 27 days ago
1998
ACM
Implicit invocation SN92, GN91] has become an important architectural style for large-scale system design and evolution. This paper addresses the lack of speci cation and veri cat...
FMCAD
1998
Springer
14 years 27 days ago
1998
Springer
We present a new approach to the verification of hardware systems with data dependencies using temporal logic symbolic model checking. As a benchmark we take Tomasulo's algori...