3224 search results - page 69 / 645 » On Checking Model Checkers |
171
click to vote
IEE
2010
15 years 4 months ago
2010
A key problem in compositional model checking of software systems is that typical model checkers accept only closed systems (runnable programs) and therefore a component cannot be ...
171
click to vote
FC
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
152
click to vote
NSDI
2007
15 years 8 months ago
2007
Despite many efforts, the predominant practice of debugging a distributed system is still printf-based log mining, which is both tedious and error-prone. In this paper, we present...
183
click to vote
DAC
2005
ACM
15 years 8 months ago
2005
ACM
We propose a normalization technique for verifying arithmetic circuits in a bounded model checking environment. Our technique operates on the arithmetic bit level (ABL) descriptio...
183
click to vote
AGTIVE
2007
Springer
16 years 10 days ago
2007
Springer
Abstract. Business process models describe workflows by a set of actions together with their ordering. When implementing business processes within a service-oriented architecture,...