4962 search results - page 456 / 993 » Stochastic Model Checking |
135
Voted
AMC
2007
15 years 4 months ago
2007
: The present paper makes use of factorial experiments to assess software complexity using insertion sort as a trivial example. We next propose to implement the methodology in quic...
84
Voted
ORL
2007
15 years 3 months ago
2007
We clarify a financial meaning of duality in the semi-infinite programming problem which emerges in the context of determining a derivative price range based only on the no-arbi...
147
click to vote
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)...
189
click to vote
TSE
2011
14 years 11 months ago
2011
— 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...
157
click to vote
DATE
2009
IEEE
15 years 11 months ago
2009
IEEE
—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...