1036 search results - page 44 / 208 » Verification Programs for Abduction |
135
click to vote
ENTCS
2008
15 years 4 months ago
2008
This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems t...
136
Voted
RV
2010
Springer
15 years 1 months ago
2010
Springer
Software transactional memories (STMs) promise simple and efficient concurrent programming. Several correctness properties have been proposed for STMs. Based on a bounded conflict ...
255
click to vote
PLDI
2009
ACM
16 years 4 months ago
2009
ACM
Reasoning about string variables, in particular program inputs, is an important aspect of many program analyses and testing frameworks. Program inputs invariably arrive as strings...
166
click to vote
CAV
2009
Springer
16 years 4 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...
118
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. Noetherian spaces are a topological concept that generalizes well quasiorderings. We explore applications to infinite-state verification problems, and show how this stimu...