783 search results - page 111 / 157 » Compositional Reasoning in Model Checking |
CAV
2009
Springer
14 years 10 months ago
2009
Springer
Context-bounded analysis is an attractive approach to verification of concurrent programs. Bounding the number of contexts executed per thread not only reduces the asymptotic compl...
CSL
2009
Springer
14 years 4 months ago
2009
Springer
One of Courcelle’s celebrated results states that if C is a class of graphs of bounded tree-width, then model-checking for monadic second order logic (MSO2) is fixed-parameter t...
PPDP
2009
Springer
14 years 4 months ago
2009
Springer
Many recent research projects focus on language support for behavioral software contracts, that is, assertions that govern the boundaries between software building blocks such as ...
POPL
2010
ACM
13 years 10 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
TIME
2006
IEEE
14 years 4 months ago
2006
IEEE
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...