713 search results - page 33 / 143 » Model Checking and Transitive-Closure Logic |
93
Voted
AAI
2004
14 years 10 months ago
2004
We are interested in applying model checking techniques to the verification of communication protocols which require safe communication. Typically, in such scenarios, one desires ...
104
Voted
FM
2003
Springer
15 years 4 months ago
2003
Springer
We present a novel application on model checking through SPIN as a means for verifying purely descriptive specifications written in TRIO, a first order, linear-time temporal logic ...
71
Voted
FSTTCS
2010
Springer
14 years 9 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...
107
Voted
RTSS
1997
IEEE
15 years 3 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
93
Voted
JOT
2008
14 years 11 months ago
2008
We present, in this paper, a framework supporting a formal verification of concurrent UML models using the Maude language. We consider both static and dynamic features of concurre...