64 search results - page 12 / 13 » Partial Order Reduction for State Event LTL |
KBSE
2007
IEEE
14 years 1 days ago
2007
IEEE
Concurrent programs are difficult to debug and verify because of the nondeterministic nature of concurrent executions. A particular concurrency-related bug may only show up under ...
HYBRID
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In many cases, complex system behaviors are naturally modeled as nonlinear differential equations. However, these equations are often hard to analyze because of "sti...
COMPSEC
2010
13 years 5 months ago
2010
Model checking security protocols is based on an intruder model that represents the eavesdropping or interception of the exchanged messages, while at the same time performs attack...
FM
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. Linearizability is an important correctness criterion for implementations of concurrent objects. Automatic checking of linearizability is challenging because it requires ...
ATVA
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...