Sciweavers

3909 search results - page 277 / 782
» Extreme Model Checking
Sort
View
151
Voted
FORTE
2003
15 years 4 months ago
A Lightweight Formal Analysis of a Multicast Key Management Scheme
Abstract. This paper describes the analysis of Pull-Based Asynchronous Rekeying Framework (ARF), a recently proposed solution to the scalable group key management problem in secure...
Mana Taghdiri, Daniel Jackson
ZEUS
2010
180views Communications» more  ZEUS 2010»
15 years 4 months ago
An efficient approach to detect lack of synchronization in acyclic workflow graphs
Control-flow analysis of business process models requires to check the absence of lack of synchronization. We use workflow graphs, which may contain inclusive OR gateways, to repre...
Cédric Favre
140
Voted
CAV
2010
Springer
194views Hardware» more  CAV 2010»
15 years 7 months ago
LTSmin: Distributed and Symbolic Reachability
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)...
Stefan Blom, Jaco van de Pol, Michael Weber
180
Voted
TSE
2011
134views more  TSE 2011»
14 years 10 months ago
Verifying the Evolution of Probability Distributions Governed by a DTMC
— We propose a new probabilistic temporal logic iLTL which captures properties of systems whose state can be represented by probability mass functions (pmf’s). Using iLTL, we c...
YoungMin Kwon, Gul A. Agha
150
Voted
DATE
2009
IEEE
90views Hardware» more  DATE 2009»
15 years 10 months ago
Property analysis and design understanding
—Verification is a major issue in circuit and system design. Formal methods like bounded model checking (BMC) can guarantee a high quality of the verification. There are severa...
Ulrich Kühne, Daniel Große, Rolf Drechs...