481 search results - page 59 / 97 » Model Checking Abstract State Machines and Beyond |
185
click to vote
CONCUR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The technique of partial order reduction (POR) for probabilistic model checking prunes the state space of the model so that a maximizing scheduler and a minimizing one pe...
178
Voted
ACOM
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. This paper explores the use of temporal logics in the context of communication protocols for multiagent systems. We concentrate on frameworks where protocols are used to ...
117
click to vote
ICSE
2003
IEEE-ACM
16 years 4 months ago
2003
IEEE-ACM
We present a new methodology for automatic verification of C programs against finite state machine specifications. Our approach is compositional, naturally enabling us to decompos...
138
Voted
POPL
2000
ACM
15 years 7 months ago
2000
ACM
with existing analysis tools. Modular reasoning principles such as abstraction, compositional refinement, and assume-guarantee reasoning are well understood for architectural hiera...
147
Voted
CAV
2010
Springer
15 years 8 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...