2873 search results - page 288 / 575 » Model Checking and the Mu-calculus |
156
click to vote
PLDI
2012
ACM
13 years 6 months ago
2012
ACM
Modularity is a central theme in any scalable program analysis. The core idea in a modular analysis is to build summaries at procedure boundaries, and use the summary of a procedu...
122
click to vote
KBSE
2007
IEEE
15 years 10 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...
137
click to vote
ATVA
2004
Springer
15 years 8 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
142
click to vote
ATVA
2010
Springer
15 years 5 months ago
2010
Springer
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
154
click to vote
CIIA
2009
15 years 5 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...