2661 search results - page 76 / 533 » Model Checking Performability Properties |
133
click to vote
CMSB
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Probabilistic model checking is a formal verification technique that has been successfully applied to the analysis of systems from a broad range of domains, including sec...
158
click to vote
NFM
2011
14 years 9 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
135
click to vote
ICCAD
2006
IEEE
15 years 8 months ago
2006
IEEE
This paper addresses SAT-based Unbounded Model Checking based on Craig Interpolants. This recently introduced methodology is often able to outperform BDDs and other SAT-based tech...
116
click to vote
ATAL
2005
Springer
15 years 8 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
124
click to vote
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
The use of XML as the de facto data exchange standard has allowed integration of heterogeneous web based software systems regardless of implementation platforms and programming la...