1283 search results - page 230 / 257 » A Survey on Temporal Logics |
97
Voted
ISSTA
2000
ACM
15 years 2 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
81
Voted
AMAST
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Algebraic compilers provide a powerful and convenient mechanism for specifying language translators. With each source language operation one associates a computation for ...
80
Voted
CAV
2000
Springer
15 years 2 months ago
2000
Springer
We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A con guration of a discrete pushdown timed automa...
90
Voted
CCS
2000
ACM
15 years 2 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 ...
109
Voted
CONCUR
1999
Springer
15 years 2 months 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...