2872 search results - page 280 / 575 » On (Omega-)Regular Model Checking |
149
click to vote
POPL
2012
ACM
14 years 4 days ago
2012
ACM
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
159
click to vote
PLDI
2012
ACM
13 years 7 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 11 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: ...
139
Voted
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...
144
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...