5015 search results - page 718 / 1003 » Model Checking a Path |
227
click to vote
POPL
2011
ACM
14 years 9 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
204
click to vote
POPL
2012
ACM
14 years 2 months 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...
203
click to vote
PLDI
2012
ACM
13 years 9 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...
197
Voted
EMSOFT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. We classify component-based models of computation into component models and interface models. A component model speci es for each component how the component behaves in a...
151
click to vote
IMC
2006
ACM
16 years 19 days ago
2006
ACM
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure...